/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/array-int-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 14:15:00,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 14:15:00,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 14:15:00,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 14:15:00,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 14:15:00,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 14:15:00,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 14:15:00,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 14:15:00,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 14:15:00,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 14:15:00,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 14:15:00,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 14:15:00,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 14:15:00,218 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 14:15:00,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 14:15:00,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 14:15:00,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 14:15:00,221 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 14:15:00,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 14:15:00,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 14:15:00,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 14:15:00,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 14:15:00,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 14:15:00,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 14:15:00,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 14:15:00,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 14:15:00,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 14:15:00,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 14:15:00,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 14:15:00,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 14:15:00,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 14:15:00,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 14:15:00,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 14:15:00,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 14:15:00,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 14:15:00,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 14:15:00,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 14:15:00,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 14:15:00,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 14:15:00,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 14:15:00,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 14:15:00,238 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:15:00,257 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 14:15:00,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 14:15:00,258 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 14:15:00,258 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 14:15:00,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 14:15:00,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 14:15:00,260 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 14:15:00,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 14:15:00,260 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 14:15:00,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 14:15:00,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 14:15:00,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 14:15:00,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 14:15:00,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 14:15:00,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 14:15:00,261 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 14:15:00,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 14:15:00,262 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 14:15:00,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 14:15:00,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 14:15:00,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 14:15:00,263 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 14:15:00,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 14:15:00,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 14:15:00,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 14:15:00,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 14:15:00,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 14:15:00,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 14:15:00,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 14:15:00,264 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 14:15:00,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 14:15:00,265 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 14:15:00,265 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:15:00,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 14:15:00,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 14:15:00,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 14:15:00,580 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 14:15:00,582 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 14:15:00,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-subst.wvr.bpl [2021-06-05 14:15:00,639 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-subst.wvr.bpl' [2021-06-05 14:15:00,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 14:15:00,706 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 14:15:00,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 14:15:00,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 14:15:00,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 14:15:00,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:15:00" (1/1) ... [2021-06-05 14:15:00,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:15:00" (1/1) ... [2021-06-05 14:15:00,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 14:15:00,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 14:15:00,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 14:15:00,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 14:15:00,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:15:00" (1/1) ... [2021-06-05 14:15:00,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:15:00" (1/1) ... [2021-06-05 14:15:00,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:15:00" (1/1) ... [2021-06-05 14:15:00,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:15:00" (1/1) ... [2021-06-05 14:15:00,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:15:00" (1/1) ... [2021-06-05 14:15:00,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:15:00" (1/1) ... [2021-06-05 14:15:00,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:15:00" (1/1) ... [2021-06-05 14:15:00,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 14:15:00,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 14:15:00,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 14:15:00,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 14:15:00,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:15:00" (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:15:00,822 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 14:15:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 14:15:00,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 14:15:00,822 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 14:15:00,822 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 14:15:00,822 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 14:15:00,823 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 14:15:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 14:15:00,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 14:15:00,823 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 14:15:00,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 14:15:00,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 14:15:00,824 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:15:01,181 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 14:15:01,181 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-05 14:15:01,182 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread1EXIT is neither atomic block end nor error location. [2021-06-05 14:15:01,182 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread2EXIT is neither atomic block end nor error location. [2021-06-05 14:15:01,182 WARN L327 CfgBuilder]: Unexpected successor node of atomic block begin: thread3EXIT is neither atomic block end nor error location. [2021-06-05 14:15:01,183 INFO L202 PluginConnector]: Adding new model array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 02:15:01 BoogieIcfgContainer [2021-06-05 14:15:01,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 14:15:01,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 14:15:01,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 14:15:01,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 14:15:01,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 02:15:00" (1/2) ... [2021-06-05 14:15:01,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af836b6 and model type array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 02:15:01, skipping insertion in model container [2021-06-05 14:15:01,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 02:15:01" (2/2) ... [2021-06-05 14:15:01,190 INFO L111 eAbstractionObserver]: Analyzing ICFG array-int-subst.wvr.bpl [2021-06-05 14:15:01,211 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 14:15:01,211 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 14:15:01,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 14:15:01,212 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 14:15:01,266 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-06-05 14:15:01,287 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 14:15:01,321 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 14:15:01,321 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 14:15:01,321 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 14:15:01,321 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 14:15:01,321 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 14:15:01,322 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 14:15:01,322 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 14:15:01,322 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 14:15:01,332 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 22 transitions, 68 flow [2021-06-05 14:15:01,348 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 57 states, 55 states have (on average 2.7818181818181817) internal successors, (153), 56 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:01,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 55 states have (on average 2.7818181818181817) internal successors, (153), 56 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:15:01,360 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:01,361 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:01,361 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:01,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:01,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2084068600, now seen corresponding path program 1 times [2021-06-05 14:15:01,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:01,374 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039145135] [2021-06-05 14:15:01,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:01,602 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:15:01,602 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:01,602 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039145135] [2021-06-05 14:15:01,603 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039145135] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:01,603 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:01,604 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:15:01,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417173600] [2021-06-05 14:15:01,608 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:15:01,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:01,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:15:01,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:15:01,625 INFO L87 Difference]: Start difference. First operand has 57 states, 55 states have (on average 2.7818181818181817) internal successors, (153), 56 states have internal predecessors, (153), 0 states have call successors, (0), 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 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:01,817 INFO L93 Difference]: Finished difference Result 139 states and 379 transitions. [2021-06-05 14:15:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:15:01,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:01,834 INFO L225 Difference]: With dead ends: 139 [2021-06-05 14:15:01,835 INFO L226 Difference]: Without dead ends: 135 [2021-06-05 14:15:01,837 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 92.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-06-05 14:15:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 84. [2021-06-05 14:15:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 2.819277108433735) internal successors, (234), 83 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 234 transitions. [2021-06-05 14:15:01,896 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 234 transitions. Word has length 14 [2021-06-05 14:15:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:01,897 INFO L482 AbstractCegarLoop]: Abstraction has 84 states and 234 transitions. [2021-06-05 14:15:01,897 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:01,897 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 234 transitions. [2021-06-05 14:15:01,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:15:01,899 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:01,899 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:01,899 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 14:15:01,899 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:01,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1063669592, now seen corresponding path program 2 times [2021-06-05 14:15:01,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:01,901 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563533573] [2021-06-05 14:15:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:01,993 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:15:01,993 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:01,993 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563533573] [2021-06-05 14:15:01,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563533573] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:01,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:01,994 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:15:01,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007629423] [2021-06-05 14:15:01,995 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:15:01,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:01,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:15:01,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:15:01,997 INFO L87 Difference]: Start difference. First operand 84 states and 234 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:02,102 INFO L93 Difference]: Finished difference Result 156 states and 429 transitions. [2021-06-05 14:15:02,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:15:02,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:02,105 INFO L225 Difference]: With dead ends: 156 [2021-06-05 14:15:02,105 INFO L226 Difference]: Without dead ends: 152 [2021-06-05 14:15:02,106 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-06-05 14:15:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 90. [2021-06-05 14:15:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.831460674157303) internal successors, (252), 89 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 252 transitions. [2021-06-05 14:15:02,130 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 252 transitions. Word has length 14 [2021-06-05 14:15:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:02,131 INFO L482 AbstractCegarLoop]: Abstraction has 90 states and 252 transitions. [2021-06-05 14:15:02,131 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 252 transitions. [2021-06-05 14:15:02,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:15:02,133 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:02,133 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:02,134 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 14:15:02,134 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:02,135 INFO L82 PathProgramCache]: Analyzing trace with hash 284971666, now seen corresponding path program 3 times [2021-06-05 14:15:02,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:02,136 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041195375] [2021-06-05 14:15:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:02,197 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:15:02,198 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:02,198 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041195375] [2021-06-05 14:15:02,198 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041195375] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:02,199 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:02,199 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:15:02,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168101505] [2021-06-05 14:15:02,199 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:15:02,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:02,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:15:02,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:15:02,202 INFO L87 Difference]: Start difference. First operand 90 states and 252 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:02,300 INFO L93 Difference]: Finished difference Result 169 states and 467 transitions. [2021-06-05 14:15:02,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:15:02,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:02,302 INFO L225 Difference]: With dead ends: 169 [2021-06-05 14:15:02,302 INFO L226 Difference]: Without dead ends: 165 [2021-06-05 14:15:02,303 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-06-05 14:15:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 94. [2021-06-05 14:15:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 2.838709677419355) internal successors, (264), 93 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 264 transitions. [2021-06-05 14:15:02,310 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 264 transitions. Word has length 14 [2021-06-05 14:15:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:02,310 INFO L482 AbstractCegarLoop]: Abstraction has 94 states and 264 transitions. [2021-06-05 14:15:02,310 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 264 transitions. [2021-06-05 14:15:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:15:02,311 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:02,311 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:02,311 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 14:15:02,312 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:02,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash -791726200, now seen corresponding path program 4 times [2021-06-05 14:15:02,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:02,313 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281371885] [2021-06-05 14:15:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:02,386 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:15:02,387 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:02,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281371885] [2021-06-05 14:15:02,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281371885] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:02,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:02,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:15:02,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953599678] [2021-06-05 14:15:02,388 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:15:02,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:02,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:15:02,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:15:02,389 INFO L87 Difference]: Start difference. First operand 94 states and 264 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:02,566 INFO L93 Difference]: Finished difference Result 173 states and 479 transitions. [2021-06-05 14:15:02,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:15:02,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:02,569 INFO L225 Difference]: With dead ends: 173 [2021-06-05 14:15:02,569 INFO L226 Difference]: Without dead ends: 169 [2021-06-05 14:15:02,569 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-06-05 14:15:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 98. [2021-06-05 14:15:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.845360824742268) internal successors, (276), 97 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 276 transitions. [2021-06-05 14:15:02,577 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 276 transitions. Word has length 14 [2021-06-05 14:15:02,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:02,577 INFO L482 AbstractCegarLoop]: Abstraction has 98 states and 276 transitions. [2021-06-05 14:15:02,578 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 276 transitions. [2021-06-05 14:15:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:15:02,579 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:02,579 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:02,579 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 14:15:02,579 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:02,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:02,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1403359368, now seen corresponding path program 5 times [2021-06-05 14:15:02,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:02,580 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313386364] [2021-06-05 14:15:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:02,666 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:02,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313386364] [2021-06-05 14:15:02,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313386364] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:02,667 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:02,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:15:02,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91680689] [2021-06-05 14:15:02,668 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:15:02,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:02,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:15:02,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:15:02,669 INFO L87 Difference]: Start difference. First operand 98 states and 276 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:02,750 INFO L93 Difference]: Finished difference Result 176 states and 489 transitions. [2021-06-05 14:15:02,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:15:02,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:02,752 INFO L225 Difference]: With dead ends: 176 [2021-06-05 14:15:02,752 INFO L226 Difference]: Without dead ends: 172 [2021-06-05 14:15:02,753 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-05 14:15:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 100. [2021-06-05 14:15:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.8484848484848486) internal successors, (282), 99 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 282 transitions. [2021-06-05 14:15:02,760 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 282 transitions. Word has length 14 [2021-06-05 14:15:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:02,761 INFO L482 AbstractCegarLoop]: Abstraction has 100 states and 282 transitions. [2021-06-05 14:15:02,761 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,761 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 282 transitions. [2021-06-05 14:15:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-06-05 14:15:02,762 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:02,762 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:02,762 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 14:15:02,762 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:02,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:02,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1756874686, now seen corresponding path program 6 times [2021-06-05 14:15:02,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:02,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195384641] [2021-06-05 14:15:02,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:02,827 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:15:02,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:02,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195384641] [2021-06-05 14:15:02,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195384641] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:02,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:02,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-05 14:15:02,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067241039] [2021-06-05 14:15:02,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 14:15:02,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:02,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 14:15:02,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-05 14:15:02,829 INFO L87 Difference]: Start difference. First operand 100 states and 282 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:02,956 INFO L93 Difference]: Finished difference Result 174 states and 483 transitions. [2021-06-05 14:15:02,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 14:15:02,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:02,958 INFO L225 Difference]: With dead ends: 174 [2021-06-05 14:15:02,958 INFO L226 Difference]: Without dead ends: 170 [2021-06-05 14:15:02,959 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-06-05 14:15:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 100. [2021-06-05 14:15:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.8484848484848486) internal successors, (282), 99 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 282 transitions. [2021-06-05 14:15:02,967 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 282 transitions. Word has length 14 [2021-06-05 14:15:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:02,967 INFO L482 AbstractCegarLoop]: Abstraction has 100 states and 282 transitions. [2021-06-05 14:15:02,967 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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:15:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 282 transitions. [2021-06-05 14:15:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:02,968 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:02,968 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:02,969 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 14:15:02,969 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:02,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1483038554, now seen corresponding path program 1 times [2021-06-05 14:15:02,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:02,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605775391] [2021-06-05 14:15:02,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:03,053 INFO L134 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:15:03,053 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:03,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605775391] [2021-06-05 14:15:03,054 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605775391] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:03,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141669258] [2021-06-05 14:15:03,054 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:15:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:03,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:03,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:03,346 INFO L134 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:15:03,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141669258] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:03,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:03,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 14:15:03,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875435965] [2021-06-05 14:15:03,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:03,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:03,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:03,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:03,348 INFO L87 Difference]: Start difference. First operand 100 states and 282 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:15:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:03,934 INFO L93 Difference]: Finished difference Result 239 states and 656 transitions. [2021-06-05 14:15:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:15:03,935 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 15 [2021-06-05 14:15:03,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:03,937 INFO L225 Difference]: With dead ends: 239 [2021-06-05 14:15:03,937 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 14:15:03,937 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 433.8ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:15:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 14:15:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 123. [2021-06-05 14:15:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.9836065573770494) internal successors, (364), 122 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 364 transitions. [2021-06-05 14:15:03,952 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 364 transitions. Word has length 15 [2021-06-05 14:15:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:03,952 INFO L482 AbstractCegarLoop]: Abstraction has 123 states and 364 transitions. [2021-06-05 14:15:03,952 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:15:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 364 transitions. [2021-06-05 14:15:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:03,953 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:03,953 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:04,173 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 14:15:04,173 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:04,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:04,174 INFO L82 PathProgramCache]: Analyzing trace with hash -180956976, now seen corresponding path program 1 times [2021-06-05 14:15:04,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:04,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850169499] [2021-06-05 14:15:04,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:04,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:15:04,245 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:04,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850169499] [2021-06-05 14:15:04,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850169499] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:04,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324991024] [2021-06-05 14:15:04,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:15:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:04,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:04,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:04,388 INFO L134 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:15:04,389 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324991024] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:04,389 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:04,389 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 14:15:04,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436694451] [2021-06-05 14:15:04,390 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:04,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:04,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:04,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:04,390 INFO L87 Difference]: Start difference. First operand 123 states and 364 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:15:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:05,022 INFO L93 Difference]: Finished difference Result 257 states and 669 transitions. [2021-06-05 14:15:05,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 14:15:05,022 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 15 [2021-06-05 14:15:05,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:05,023 INFO L225 Difference]: With dead ends: 257 [2021-06-05 14:15:05,023 INFO L226 Difference]: Without dead ends: 187 [2021-06-05 14:15:05,023 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 525.2ms TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:15:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-06-05 14:15:05,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 133. [2021-06-05 14:15:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9318181818181817) internal successors, (387), 132 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 387 transitions. [2021-06-05 14:15:05,030 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 387 transitions. Word has length 15 [2021-06-05 14:15:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:05,030 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 387 transitions. [2021-06-05 14:15:05,030 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:15:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 387 transitions. [2021-06-05 14:15:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:05,032 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:05,032 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:05,249 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:05,249 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:05,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:05,250 INFO L82 PathProgramCache]: Analyzing trace with hash 479848854, now seen corresponding path program 1 times [2021-06-05 14:15:05,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:05,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766706222] [2021-06-05 14:15:05,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:05,398 INFO L134 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:15:05,398 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:05,398 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766706222] [2021-06-05 14:15:05,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766706222] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:05,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772655298] [2021-06-05 14:15:05,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:15:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:05,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:05,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:05,556 INFO L134 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:15:05,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772655298] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:05,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:05,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:05,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426341952] [2021-06-05 14:15:05,557 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:05,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:05,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:05,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:05,558 INFO L87 Difference]: Start difference. First operand 133 states and 387 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:15:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:05,817 INFO L93 Difference]: Finished difference Result 187 states and 522 transitions. [2021-06-05 14:15:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:05,821 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 15 [2021-06-05 14:15:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:05,822 INFO L225 Difference]: With dead ends: 187 [2021-06-05 14:15:05,822 INFO L226 Difference]: Without dead ends: 182 [2021-06-05 14:15:05,822 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 217.4ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:05,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-06-05 14:15:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 145. [2021-06-05 14:15:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.9305555555555554) internal successors, (422), 144 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:15:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 422 transitions. [2021-06-05 14:15:05,829 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 422 transitions. Word has length 15 [2021-06-05 14:15:05,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:05,829 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 422 transitions. [2021-06-05 14:15:05,829 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:15:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 422 transitions. [2021-06-05 14:15:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:05,830 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:05,830 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:06,031 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 14:15:06,032 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:06,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1061667084, now seen corresponding path program 2 times [2021-06-05 14:15:06,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:06,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526814362] [2021-06-05 14:15:06,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:06,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:15:06,184 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:06,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526814362] [2021-06-05 14:15:06,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526814362] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:06,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398059601] [2021-06-05 14:15:06,185 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 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:15:06,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:06,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:06,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:06,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:06,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398059601] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:06,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:06,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:06,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807463326] [2021-06-05 14:15:06,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:06,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:06,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:06,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:06,380 INFO L87 Difference]: Start difference. First operand 145 states and 422 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:15:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:06,589 INFO L93 Difference]: Finished difference Result 197 states and 554 transitions. [2021-06-05 14:15:06,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:06,590 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 15 [2021-06-05 14:15:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:06,603 INFO L225 Difference]: With dead ends: 197 [2021-06-05 14:15:06,603 INFO L226 Difference]: Without dead ends: 192 [2021-06-05 14:15:06,605 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 196.4ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-06-05 14:15:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 147. [2021-06-05 14:15:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.952054794520548) internal successors, (431), 146 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 431 transitions. [2021-06-05 14:15:06,621 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 431 transitions. Word has length 15 [2021-06-05 14:15:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:06,621 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 431 transitions. [2021-06-05 14:15:06,621 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:15:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 431 transitions. [2021-06-05 14:15:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:06,629 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:06,629 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:06,830 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-05 14:15:06,830 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:06,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash -667380250, now seen corresponding path program 3 times [2021-06-05 14:15:06,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:06,832 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368877935] [2021-06-05 14:15:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:06,920 INFO L134 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:15:06,920 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:06,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368877935] [2021-06-05 14:15:06,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368877935] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:06,921 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016905151] [2021-06-05 14:15:06,921 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 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:15:06,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:06,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:06,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:06,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:07,072 INFO L134 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:15:07,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016905151] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:07,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:07,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:15:07,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361609714] [2021-06-05 14:15:07,075 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:15:07,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:15:07,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:15:07,089 INFO L87 Difference]: Start difference. First operand 147 states and 431 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:15:07,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:07,252 INFO L93 Difference]: Finished difference Result 209 states and 593 transitions. [2021-06-05 14:15:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:07,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-06-05 14:15:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:07,254 INFO L225 Difference]: With dead ends: 209 [2021-06-05 14:15:07,254 INFO L226 Difference]: Without dead ends: 204 [2021-06-05 14:15:07,254 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 92.1ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-06-05 14:15:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 153. [2021-06-05 14:15:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.9539473684210527) internal successors, (449), 152 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 449 transitions. [2021-06-05 14:15:07,260 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 449 transitions. Word has length 15 [2021-06-05 14:15:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:07,261 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 449 transitions. [2021-06-05 14:15:07,261 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:15:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 449 transitions. [2021-06-05 14:15:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:07,261 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:07,261 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:07,477 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-06-05 14:15:07,477 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:07,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:07,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1754797532, now seen corresponding path program 4 times [2021-06-05 14:15:07,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:07,478 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415168868] [2021-06-05 14:15:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:07,631 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:07,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415168868] [2021-06-05 14:15:07,631 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415168868] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:07,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551833301] [2021-06-05 14:15:07,634 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 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:15:07,688 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:07,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:07,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:07,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:07,820 INFO L134 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:15:07,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551833301] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:07,820 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:07,820 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:07,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773135145] [2021-06-05 14:15:07,820 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:07,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:07,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:07,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:07,821 INFO L87 Difference]: Start difference. First operand 153 states and 449 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:15:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:08,127 INFO L93 Difference]: Finished difference Result 276 states and 751 transitions. [2021-06-05 14:15:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:08,128 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 15 [2021-06-05 14:15:08,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:08,130 INFO L225 Difference]: With dead ends: 276 [2021-06-05 14:15:08,130 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 14:15:08,130 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 285.8ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:08,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 14:15:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 158. [2021-06-05 14:15:08,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:08,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 14:15:08,138 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 14:15:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:08,138 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 14:15:08,138 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:15:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 14:15:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:08,139 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:08,139 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:08,352 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:08,353 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:08,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:08,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1958351534, now seen corresponding path program 5 times [2021-06-05 14:15:08,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:08,353 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281690555] [2021-06-05 14:15:08,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:08,470 INFO L134 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:15:08,470 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:08,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281690555] [2021-06-05 14:15:08,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281690555] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:08,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539206109] [2021-06-05 14:15:08,471 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 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:15:08,671 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:08,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:08,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:08,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:08,772 INFO L134 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:15:08,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539206109] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:08,772 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:08,773 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:08,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911253433] [2021-06-05 14:15:08,773 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:08,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:08,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:08,774 INFO L87 Difference]: Start difference. First operand 158 states and 469 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:15:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:09,029 INFO L93 Difference]: Finished difference Result 276 states and 772 transitions. [2021-06-05 14:15:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:09,029 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 15 [2021-06-05 14:15:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:09,031 INFO L225 Difference]: With dead ends: 276 [2021-06-05 14:15:09,031 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 14:15:09,031 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 275.3ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 14:15:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2021-06-05 14:15:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.9539473684210527) internal successors, (449), 152 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:09,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 449 transitions. [2021-06-05 14:15:09,038 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 449 transitions. Word has length 15 [2021-06-05 14:15:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:09,038 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 449 transitions. [2021-06-05 14:15:09,038 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:15:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 449 transitions. [2021-06-05 14:15:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:09,039 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:09,039 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:09,252 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-06-05 14:15:09,253 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:09,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1013363858, now seen corresponding path program 6 times [2021-06-05 14:15:09,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:09,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792705424] [2021-06-05 14:15:09,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:09,388 INFO L134 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:15:09,388 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:09,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792705424] [2021-06-05 14:15:09,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792705424] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:09,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319115896] [2021-06-05 14:15:09,388 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 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:15:09,429 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:15:09,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:09,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2021-06-05 14:15:09,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:09,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:15:09,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319115896] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:09,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:09,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:09,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296559688] [2021-06-05 14:15:09,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:09,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:09,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:09,535 INFO L87 Difference]: Start difference. First operand 153 states and 449 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:15:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:10,408 INFO L93 Difference]: Finished difference Result 275 states and 748 transitions. [2021-06-05 14:15:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:15:10,408 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 15 [2021-06-05 14:15:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:10,410 INFO L225 Difference]: With dead ends: 275 [2021-06-05 14:15:10,410 INFO L226 Difference]: Without dead ends: 270 [2021-06-05 14:15:10,411 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 708.4ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:15:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-06-05 14:15:10,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 153. [2021-06-05 14:15:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.9539473684210527) internal successors, (449), 152 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 449 transitions. [2021-06-05 14:15:10,417 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 449 transitions. Word has length 15 [2021-06-05 14:15:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:10,417 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 449 transitions. [2021-06-05 14:15:10,417 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:15:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 449 transitions. [2021-06-05 14:15:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:10,418 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:10,418 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:10,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-06-05 14:15:10,633 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash 261780050, now seen corresponding path program 7 times [2021-06-05 14:15:10,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:10,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280580533] [2021-06-05 14:15:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:10,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:15:10,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:10,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280580533] [2021-06-05 14:15:10,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280580533] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:10,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88452230] [2021-06-05 14:15:10,707 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:10,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:10,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:10,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:15:10,862 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88452230] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:10,862 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:10,862 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:10,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238197365] [2021-06-05 14:15:10,863 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:10,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:10,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:10,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:10,864 INFO L87 Difference]: Start difference. First operand 153 states and 449 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:15:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:11,119 INFO L93 Difference]: Finished difference Result 206 states and 576 transitions. [2021-06-05 14:15:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:11,120 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 15 [2021-06-05 14:15:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:11,123 INFO L225 Difference]: With dead ends: 206 [2021-06-05 14:15:11,123 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 14:15:11,126 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 236.2ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 14:15:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 154. [2021-06-05 14:15:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.947712418300654) internal successors, (451), 153 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 451 transitions. [2021-06-05 14:15:11,131 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 451 transitions. Word has length 15 [2021-06-05 14:15:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:11,131 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 451 transitions. [2021-06-05 14:15:11,132 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:15:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 451 transitions. [2021-06-05 14:15:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:11,132 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:11,132 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:11,349 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-06-05 14:15:11,349 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:11,349 INFO L82 PathProgramCache]: Analyzing trace with hash 970590554, now seen corresponding path program 2 times [2021-06-05 14:15:11,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:11,350 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848908028] [2021-06-05 14:15:11,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:11,421 INFO L134 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:15:11,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:11,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848908028] [2021-06-05 14:15:11,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848908028] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:11,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49095321] [2021-06-05 14:15:11,422 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 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:15:11,484 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:11,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:11,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:11,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:11,572 INFO L134 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:15:11,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49095321] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:11,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:11,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 14:15:11,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772600438] [2021-06-05 14:15:11,573 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:11,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:11,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:11,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:11,574 INFO L87 Difference]: Start difference. First operand 154 states and 451 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:15:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:12,025 INFO L93 Difference]: Finished difference Result 315 states and 839 transitions. [2021-06-05 14:15:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:15:12,026 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 15 [2021-06-05 14:15:12,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:12,027 INFO L225 Difference]: With dead ends: 315 [2021-06-05 14:15:12,027 INFO L226 Difference]: Without dead ends: 273 [2021-06-05 14:15:12,028 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 366.0ms TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:15:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-06-05 14:15:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 168. [2021-06-05 14:15:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 3.0479041916167664) internal successors, (509), 167 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 509 transitions. [2021-06-05 14:15:12,034 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 509 transitions. Word has length 15 [2021-06-05 14:15:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:12,034 INFO L482 AbstractCegarLoop]: Abstraction has 168 states and 509 transitions. [2021-06-05 14:15:12,034 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:15:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 509 transitions. [2021-06-05 14:15:12,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:12,035 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:12,035 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:12,260 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:12,260 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:12,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash 511164902, now seen corresponding path program 8 times [2021-06-05 14:15:12,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:12,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502180829] [2021-06-05 14:15:12,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:12,334 INFO L134 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:15:12,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:12,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502180829] [2021-06-05 14:15:12,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502180829] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:12,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463300447] [2021-06-05 14:15:12,334 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 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:15:12,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:12,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:12,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:12,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:12,494 INFO L134 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:15:12,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463300447] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:12,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:12,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:12,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643909564] [2021-06-05 14:15:12,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:12,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:12,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:12,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:12,496 INFO L87 Difference]: Start difference. First operand 168 states and 509 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:15:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:12,727 INFO L93 Difference]: Finished difference Result 259 states and 742 transitions. [2021-06-05 14:15:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:12,727 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 15 [2021-06-05 14:15:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:12,728 INFO L225 Difference]: With dead ends: 259 [2021-06-05 14:15:12,728 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 14:15:12,729 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 239.3ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:12,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 14:15:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 170. [2021-06-05 14:15:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.059171597633136) internal successors, (517), 169 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 517 transitions. [2021-06-05 14:15:12,734 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 517 transitions. Word has length 15 [2021-06-05 14:15:12,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:12,734 INFO L482 AbstractCegarLoop]: Abstraction has 170 states and 517 transitions. [2021-06-05 14:15:12,734 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:15:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 517 transitions. [2021-06-05 14:15:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:12,735 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:12,735 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:12,953 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-06-05 14:15:12,953 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:12,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1191223272, now seen corresponding path program 2 times [2021-06-05 14:15:12,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:12,954 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275154880] [2021-06-05 14:15:12,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:13,014 INFO L134 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:15:13,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:13,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275154880] [2021-06-05 14:15:13,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275154880] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:13,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986629840] [2021-06-05 14:15:13,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:13,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:13,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:13,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:13,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:13,129 INFO L134 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:15:13,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986629840] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:13,129 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:13,129 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 14:15:13,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224005422] [2021-06-05 14:15:13,130 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:13,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:13,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:13,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:13,131 INFO L87 Difference]: Start difference. First operand 170 states and 517 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:15:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:13,399 INFO L93 Difference]: Finished difference Result 263 states and 728 transitions. [2021-06-05 14:15:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:15:13,400 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 15 [2021-06-05 14:15:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:13,401 INFO L225 Difference]: With dead ends: 263 [2021-06-05 14:15:13,401 INFO L226 Difference]: Without dead ends: 236 [2021-06-05 14:15:13,401 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 182.7ms TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-06-05 14:15:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 170. [2021-06-05 14:15:13,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.029585798816568) internal successors, (512), 169 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:15:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 512 transitions. [2021-06-05 14:15:13,407 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 512 transitions. Word has length 15 [2021-06-05 14:15:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:13,407 INFO L482 AbstractCegarLoop]: Abstraction has 170 states and 512 transitions. [2021-06-05 14:15:13,407 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:15:13,407 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 512 transitions. [2021-06-05 14:15:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:13,408 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:13,408 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:13,631 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-06-05 14:15:13,632 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:13,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1872721008, now seen corresponding path program 9 times [2021-06-05 14:15:13,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:13,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5143166] [2021-06-05 14:15:13,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:13,712 INFO L134 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:15:13,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:13,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5143166] [2021-06-05 14:15:13,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5143166] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:13,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238845145] [2021-06-05 14:15:13,713 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 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:15:13,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:13,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:13,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:13,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:13,868 INFO L134 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:15:13,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238845145] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:13,869 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:13,869 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:13,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735567527] [2021-06-05 14:15:13,870 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:13,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:13,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:13,872 INFO L87 Difference]: Start difference. First operand 170 states and 512 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:15:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:14,152 INFO L93 Difference]: Finished difference Result 230 states and 654 transitions. [2021-06-05 14:15:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:14,153 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 15 [2021-06-05 14:15:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:14,154 INFO L225 Difference]: With dead ends: 230 [2021-06-05 14:15:14,154 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 14:15:14,154 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 267.8ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:14,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 14:15:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 170. [2021-06-05 14:15:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.0236686390532546) internal successors, (511), 169 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 511 transitions. [2021-06-05 14:15:14,158 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 511 transitions. Word has length 15 [2021-06-05 14:15:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:14,158 INFO L482 AbstractCegarLoop]: Abstraction has 170 states and 511 transitions. [2021-06-05 14:15:14,159 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:15:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 511 transitions. [2021-06-05 14:15:14,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:14,159 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:14,159 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:14,372 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-06-05 14:15:14,373 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:14,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:14,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1743627284, now seen corresponding path program 3 times [2021-06-05 14:15:14,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:14,373 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347326437] [2021-06-05 14:15:14,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:14,439 INFO L134 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:15:14,440 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:14,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347326437] [2021-06-05 14:15:14,440 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347326437] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:14,440 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298245515] [2021-06-05 14:15:14,440 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:15:14,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:14,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:14,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:14,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:14,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:15:14,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298245515] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:14,607 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:14,607 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 14:15:14,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468290984] [2021-06-05 14:15:14,608 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:14,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:14,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:14,609 INFO L87 Difference]: Start difference. First operand 170 states and 511 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:15:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:14,968 INFO L93 Difference]: Finished difference Result 284 states and 758 transitions. [2021-06-05 14:15:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:15:14,968 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 15 [2021-06-05 14:15:14,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:14,969 INFO L225 Difference]: With dead ends: 284 [2021-06-05 14:15:14,969 INFO L226 Difference]: Without dead ends: 247 [2021-06-05 14:15:14,970 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 285.5ms TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:15:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-06-05 14:15:14,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 159. [2021-06-05 14:15:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0) internal successors, (474), 158 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 474 transitions. [2021-06-05 14:15:14,983 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 474 transitions. Word has length 15 [2021-06-05 14:15:14,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:14,983 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 474 transitions. [2021-06-05 14:15:14,983 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:15:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 474 transitions. [2021-06-05 14:15:14,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:14,984 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:14,984 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:15,204 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:15,205 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:15,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:15,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1421782062, now seen corresponding path program 10 times [2021-06-05 14:15:15,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:15,205 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773996885] [2021-06-05 14:15:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:15,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:15:15,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:15,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773996885] [2021-06-05 14:15:15,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773996885] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:15,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642036362] [2021-06-05 14:15:15,259 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 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:15:15,301 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:15,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:15,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:15,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:15,372 INFO L134 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:15:15,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642036362] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:15,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:15,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:15,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193401862] [2021-06-05 14:15:15,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:15,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:15,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:15,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:15,375 INFO L87 Difference]: Start difference. First operand 159 states and 474 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:15,500 INFO L93 Difference]: Finished difference Result 254 states and 734 transitions. [2021-06-05 14:15:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:15,500 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:15:15,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:15,502 INFO L225 Difference]: With dead ends: 254 [2021-06-05 14:15:15,502 INFO L226 Difference]: Without dead ends: 249 [2021-06-05 14:15:15,502 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 82.1ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-06-05 14:15:15,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 161. [2021-06-05 14:15:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.0) internal successors, (480), 160 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 480 transitions. [2021-06-05 14:15:15,508 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 480 transitions. Word has length 15 [2021-06-05 14:15:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:15,508 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 480 transitions. [2021-06-05 14:15:15,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 480 transitions. [2021-06-05 14:15:15,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:15,509 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:15,510 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:15,710 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:15,710 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:15,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:15,711 INFO L82 PathProgramCache]: Analyzing trace with hash 4818636, now seen corresponding path program 11 times [2021-06-05 14:15:15,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:15,711 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968178450] [2021-06-05 14:15:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:15,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:15:15,801 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:15,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968178450] [2021-06-05 14:15:15,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968178450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:15,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31064403] [2021-06-05 14:15:15,801 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 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:15:15,832 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:15,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:15,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:15,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:15,914 INFO L134 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:15:15,914 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31064403] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:15,915 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:15,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:15,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414755233] [2021-06-05 14:15:15,915 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:15,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:15,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:15,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:15,916 INFO L87 Difference]: Start difference. First operand 161 states and 480 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:15:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:16,012 INFO L93 Difference]: Finished difference Result 244 states and 694 transitions. [2021-06-05 14:15:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:16,012 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 15 [2021-06-05 14:15:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:16,013 INFO L225 Difference]: With dead ends: 244 [2021-06-05 14:15:16,013 INFO L226 Difference]: Without dead ends: 239 [2021-06-05 14:15:16,014 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 102.5ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:16,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-06-05 14:15:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 163. [2021-06-05 14:15:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0123456790123457) internal successors, (488), 162 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 488 transitions. [2021-06-05 14:15:16,019 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 488 transitions. Word has length 15 [2021-06-05 14:15:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:16,019 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 488 transitions. [2021-06-05 14:15:16,019 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:15:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 488 transitions. [2021-06-05 14:15:16,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:16,020 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:16,020 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:16,243 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:16,243 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:16,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1366374742, now seen corresponding path program 12 times [2021-06-05 14:15:16,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:16,244 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375480178] [2021-06-05 14:15:16,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:16,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:16,291 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375480178] [2021-06-05 14:15:16,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375480178] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:16,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481259856] [2021-06-05 14:15:16,292 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 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:15:16,318 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:15:16,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:16,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:16,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:16,412 INFO L134 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:15:16,412 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481259856] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:16,412 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:16,412 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:16,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547557846] [2021-06-05 14:15:16,413 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:16,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:16,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:16,414 INFO L87 Difference]: Start difference. First operand 163 states and 488 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:16,544 INFO L93 Difference]: Finished difference Result 217 states and 622 transitions. [2021-06-05 14:15:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:16,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:15:16,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:16,545 INFO L225 Difference]: With dead ends: 217 [2021-06-05 14:15:16,545 INFO L226 Difference]: Without dead ends: 211 [2021-06-05 14:15:16,545 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 90.1ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-06-05 14:15:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 161. [2021-06-05 14:15:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.0) internal successors, (480), 160 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:16,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 480 transitions. [2021-06-05 14:15:16,549 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 480 transitions. Word has length 15 [2021-06-05 14:15:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:16,549 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 480 transitions. [2021-06-05 14:15:16,550 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:16,550 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 480 transitions. [2021-06-05 14:15:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:16,550 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:16,550 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:16,764 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:16,764 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:16,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1908842768, now seen corresponding path program 3 times [2021-06-05 14:15:16,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:16,765 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344563890] [2021-06-05 14:15:16,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:16,795 INFO L134 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:15:16,795 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:16,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344563890] [2021-06-05 14:15:16,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344563890] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:16,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785070058] [2021-06-05 14:15:16,795 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:15:16,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:16,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:16,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:16,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:16,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:15:16,875 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785070058] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:16,875 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:16,875 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-06-05 14:15:16,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951238145] [2021-06-05 14:15:16,875 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:16,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:16,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:16,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:16,876 INFO L87 Difference]: Start difference. First operand 161 states and 480 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:15:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:17,133 INFO L93 Difference]: Finished difference Result 274 states and 770 transitions. [2021-06-05 14:15:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:15:17,136 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 15 [2021-06-05 14:15:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:17,137 INFO L225 Difference]: With dead ends: 274 [2021-06-05 14:15:17,137 INFO L226 Difference]: Without dead ends: 221 [2021-06-05 14:15:17,138 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 180.0ms TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:15:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-06-05 14:15:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 158. [2021-06-05 14:15:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 14:15:17,142 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 14:15:17,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:17,143 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 14:15:17,143 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:15:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 14:15:17,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:17,143 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:17,144 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:17,365 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2021-06-05 14:15:17,365 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:17,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1057034826, now seen corresponding path program 13 times [2021-06-05 14:15:17,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:17,366 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574280749] [2021-06-05 14:15:17,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:17,453 INFO L134 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:15:17,453 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:17,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574280749] [2021-06-05 14:15:17,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574280749] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:17,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509237608] [2021-06-05 14:15:17,453 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 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:15:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:17,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:17,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:17,581 INFO L134 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:15:17,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509237608] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:17,581 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:17,581 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:17,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005632006] [2021-06-05 14:15:17,581 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:17,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:17,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:17,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:17,582 INFO L87 Difference]: Start difference. First operand 158 states and 469 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:15:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:17,832 INFO L93 Difference]: Finished difference Result 270 states and 738 transitions. [2021-06-05 14:15:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:17,832 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 15 [2021-06-05 14:15:17,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:17,834 INFO L225 Difference]: With dead ends: 270 [2021-06-05 14:15:17,834 INFO L226 Difference]: Without dead ends: 265 [2021-06-05 14:15:17,834 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 211.7ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-06-05 14:15:17,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 163. [2021-06-05 14:15:17,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0185185185185186) internal successors, (489), 162 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 489 transitions. [2021-06-05 14:15:17,838 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 489 transitions. Word has length 15 [2021-06-05 14:15:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:17,839 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 489 transitions. [2021-06-05 14:15:17,839 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:15:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 489 transitions. [2021-06-05 14:15:17,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:17,839 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:17,839 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:18,040 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2021-06-05 14:15:18,040 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:18,040 INFO L82 PathProgramCache]: Analyzing trace with hash -475216596, now seen corresponding path program 14 times [2021-06-05 14:15:18,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:18,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373288487] [2021-06-05 14:15:18,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:18,112 INFO L134 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:15:18,112 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:18,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373288487] [2021-06-05 14:15:18,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373288487] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:18,112 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140875743] [2021-06-05 14:15:18,112 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 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:15:18,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:18,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:18,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:18,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:18,290 INFO L134 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:15:18,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140875743] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:18,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:18,291 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:18,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794712048] [2021-06-05 14:15:18,291 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:18,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:18,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:18,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:18,292 INFO L87 Difference]: Start difference. First operand 163 states and 489 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:15:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:18,528 INFO L93 Difference]: Finished difference Result 280 states and 770 transitions. [2021-06-05 14:15:18,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:18,532 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 15 [2021-06-05 14:15:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:18,533 INFO L225 Difference]: With dead ends: 280 [2021-06-05 14:15:18,533 INFO L226 Difference]: Without dead ends: 275 [2021-06-05 14:15:18,533 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 236.6ms TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:18,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-06-05 14:15:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 158. [2021-06-05 14:15:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 14:15:18,538 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 14:15:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:18,538 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 14:15:18,538 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:15:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 14:15:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:18,539 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:18,539 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:18,762 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82 [2021-06-05 14:15:18,762 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1798468500, now seen corresponding path program 15 times [2021-06-05 14:15:18,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:18,763 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312472889] [2021-06-05 14:15:18,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:18,829 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:18,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312472889] [2021-06-05 14:15:18,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312472889] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:18,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888265856] [2021-06-05 14:15:18,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 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:15:18,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:18,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:18,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:18,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:18,946 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888265856] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:18,946 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:18,946 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:18,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452213804] [2021-06-05 14:15:18,947 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:18,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:18,949 INFO L87 Difference]: Start difference. First operand 158 states and 469 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:15:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:19,362 INFO L93 Difference]: Finished difference Result 305 states and 819 transitions. [2021-06-05 14:15:19,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:19,363 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 15 [2021-06-05 14:15:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:19,364 INFO L225 Difference]: With dead ends: 305 [2021-06-05 14:15:19,364 INFO L226 Difference]: Without dead ends: 300 [2021-06-05 14:15:19,364 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 277.8ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:19,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-06-05 14:15:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 160. [2021-06-05 14:15:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.9748427672955975) internal successors, (473), 159 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 473 transitions. [2021-06-05 14:15:19,369 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 473 transitions. Word has length 15 [2021-06-05 14:15:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:19,369 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 473 transitions. [2021-06-05 14:15:19,369 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:15:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 473 transitions. [2021-06-05 14:15:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:19,370 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:19,370 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:19,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2021-06-05 14:15:19,585 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:19,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:19,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1744914988, now seen corresponding path program 16 times [2021-06-05 14:15:19,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:19,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243128999] [2021-06-05 14:15:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:19,953 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-06-05 14:15:20,133 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-06-05 14:15:20,322 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2021-06-05 14:15:20,334 INFO L134 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:15:20,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:20,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243128999] [2021-06-05 14:15:20,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243128999] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:20,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67652162] [2021-06-05 14:15:20,335 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 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:15:20,376 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:20,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:20,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:20,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:20,505 INFO L134 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:15:20,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67652162] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:20,506 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:20,506 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:20,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294740597] [2021-06-05 14:15:20,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:20,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:20,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:20,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:20,508 INFO L87 Difference]: Start difference. First operand 160 states and 473 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:15:20,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:20,916 INFO L93 Difference]: Finished difference Result 284 states and 780 transitions. [2021-06-05 14:15:20,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:20,916 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 15 [2021-06-05 14:15:20,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:20,917 INFO L225 Difference]: With dead ends: 284 [2021-06-05 14:15:20,918 INFO L226 Difference]: Without dead ends: 278 [2021-06-05 14:15:20,918 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 959.4ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-05 14:15:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 158. [2021-06-05 14:15:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9872611464968153) internal successors, (469), 157 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 469 transitions. [2021-06-05 14:15:20,922 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 469 transitions. Word has length 15 [2021-06-05 14:15:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:20,922 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 469 transitions. [2021-06-05 14:15:20,923 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:15:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 469 transitions. [2021-06-05 14:15:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:20,923 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:20,923 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:21,141 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:21,142 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:21,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:21,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1994299840, now seen corresponding path program 17 times [2021-06-05 14:15:21,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:21,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903992269] [2021-06-05 14:15:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:21,264 INFO L134 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:15:21,264 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:21,264 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903992269] [2021-06-05 14:15:21,264 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903992269] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:21,265 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604581486] [2021-06-05 14:15:21,265 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 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:15:21,305 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:21,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:21,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:21,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:21,468 INFO L134 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:15:21,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604581486] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:21,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:21,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:21,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654970921] [2021-06-05 14:15:21,469 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:21,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:21,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:21,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:21,470 INFO L87 Difference]: Start difference. First operand 158 states and 469 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:15:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:21,735 INFO L93 Difference]: Finished difference Result 306 states and 841 transitions. [2021-06-05 14:15:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:21,735 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 15 [2021-06-05 14:15:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:21,737 INFO L225 Difference]: With dead ends: 306 [2021-06-05 14:15:21,737 INFO L226 Difference]: Without dead ends: 301 [2021-06-05 14:15:21,737 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 284.7ms TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:21,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-06-05 14:15:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 159. [2021-06-05 14:15:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.9873417721518987) internal successors, (472), 158 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 472 transitions. [2021-06-05 14:15:21,742 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 472 transitions. Word has length 15 [2021-06-05 14:15:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:21,742 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 472 transitions. [2021-06-05 14:15:21,742 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:15:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 472 transitions. [2021-06-05 14:15:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:21,743 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:21,743 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:21,943 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:21,944 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:21,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:21,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1620609086, now seen corresponding path program 4 times [2021-06-05 14:15:21,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:21,944 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31915617] [2021-06-05 14:15:21,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:22,022 INFO L134 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:15:22,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:22,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31915617] [2021-06-05 14:15:22,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31915617] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:22,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002410541] [2021-06-05 14:15:22,023 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 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:15:22,074 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:22,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:22,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:22,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:22,187 INFO L134 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:15:22,188 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002410541] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:22,188 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:22,188 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-06-05 14:15:22,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312003390] [2021-06-05 14:15:22,188 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:22,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:22,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:22,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:22,189 INFO L87 Difference]: Start difference. First operand 159 states and 472 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:15:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:22,437 INFO L93 Difference]: Finished difference Result 251 states and 682 transitions. [2021-06-05 14:15:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:15:22,437 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 15 [2021-06-05 14:15:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:22,438 INFO L225 Difference]: With dead ends: 251 [2021-06-05 14:15:22,438 INFO L226 Difference]: Without dead ends: 229 [2021-06-05 14:15:22,438 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 200.7ms TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:15:22,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-06-05 14:15:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 155. [2021-06-05 14:15:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.9415584415584415) internal successors, (453), 154 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 453 transitions. [2021-06-05 14:15:22,443 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 453 transitions. Word has length 15 [2021-06-05 14:15:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:22,443 INFO L482 AbstractCegarLoop]: Abstraction has 155 states and 453 transitions. [2021-06-05 14:15:22,443 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:15:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 453 transitions. [2021-06-05 14:15:22,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:22,443 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:22,443 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:22,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:22,644 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:22,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:22,645 INFO L82 PathProgramCache]: Analyzing trace with hash -939111350, now seen corresponding path program 18 times [2021-06-05 14:15:22,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:22,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582458487] [2021-06-05 14:15:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:22,733 INFO L134 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:15:22,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:22,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582458487] [2021-06-05 14:15:22,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582458487] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:22,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703667212] [2021-06-05 14:15:22,734 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:22,764 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:15:22,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:22,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:22,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:22,910 INFO L134 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:15:22,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703667212] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:22,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:22,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:22,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343970112] [2021-06-05 14:15:22,912 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:22,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:22,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:22,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:22,912 INFO L87 Difference]: Start difference. First operand 155 states and 453 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:15:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:23,298 INFO L93 Difference]: Finished difference Result 284 states and 778 transitions. [2021-06-05 14:15:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:23,299 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 15 [2021-06-05 14:15:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:23,300 INFO L225 Difference]: With dead ends: 284 [2021-06-05 14:15:23,300 INFO L226 Difference]: Without dead ends: 278 [2021-06-05 14:15:23,301 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 314.1ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-05 14:15:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 151. [2021-06-05 14:15:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.9133333333333336) internal successors, (437), 150 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 437 transitions. [2021-06-05 14:15:23,305 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 437 transitions. Word has length 15 [2021-06-05 14:15:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:23,305 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 437 transitions. [2021-06-05 14:15:23,305 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:15:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 437 transitions. [2021-06-05 14:15:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:23,305 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:23,306 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:23,506 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2021-06-05 14:15:23,506 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:23,507 INFO L82 PathProgramCache]: Analyzing trace with hash 738121340, now seen corresponding path program 5 times [2021-06-05 14:15:23,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:23,507 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990991050] [2021-06-05 14:15:23,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:24,008 INFO L134 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:15:24,009 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:24,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990991050] [2021-06-05 14:15:24,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990991050] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:24,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494792954] [2021-06-05 14:15:24,009 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:15:24,105 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:24,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:24,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 14:15:24,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:24,172 INFO L134 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:15:24,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494792954] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:24,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:24,173 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:15:24,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321644314] [2021-06-05 14:15:24,173 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:15:24,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:24,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:15:24,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:15:24,174 INFO L87 Difference]: Start difference. First operand 151 states and 437 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:15:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:24,288 INFO L93 Difference]: Finished difference Result 221 states and 607 transitions. [2021-06-05 14:15:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:24,289 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 15 [2021-06-05 14:15:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:24,290 INFO L225 Difference]: With dead ends: 221 [2021-06-05 14:15:24,290 INFO L226 Difference]: Without dead ends: 203 [2021-06-05 14:15:24,291 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 491.8ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-06-05 14:15:24,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 133. [2021-06-05 14:15:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9393939393939394) internal successors, (388), 132 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 388 transitions. [2021-06-05 14:15:24,295 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 388 transitions. Word has length 15 [2021-06-05 14:15:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:24,296 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 388 transitions. [2021-06-05 14:15:24,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:15:24,296 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 388 transitions. [2021-06-05 14:15:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:24,296 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:24,296 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:24,519 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2021-06-05 14:15:24,519 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:24,520 INFO L82 PathProgramCache]: Analyzing trace with hash -338576526, now seen corresponding path program 6 times [2021-06-05 14:15:24,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:24,520 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93375876] [2021-06-05 14:15:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:24,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:15:24,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:24,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93375876] [2021-06-05 14:15:24,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93375876] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:24,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461680001] [2021-06-05 14:15:24,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 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:15:24,616 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:15:24,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:24,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:24,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:24,670 INFO L134 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:15:24,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461680001] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:24,670 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:24,670 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2021-06-05 14:15:24,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348825679] [2021-06-05 14:15:24,671 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:24,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:24,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:24,671 INFO L87 Difference]: Start difference. First operand 133 states and 388 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:15:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:24,901 INFO L93 Difference]: Finished difference Result 237 states and 658 transitions. [2021-06-05 14:15:24,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 14:15:24,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 15 [2021-06-05 14:15:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:24,903 INFO L225 Difference]: With dead ends: 237 [2021-06-05 14:15:24,903 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 14:15:24,904 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 177.8ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:15:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 14:15:24,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 135. [2021-06-05 14:15:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.955223880597015) internal successors, (396), 134 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 396 transitions. [2021-06-05 14:15:24,932 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 396 transitions. Word has length 15 [2021-06-05 14:15:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:24,932 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 396 transitions. [2021-06-05 14:15:24,932 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:15:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 396 transitions. [2021-06-05 14:15:24,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:24,932 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:24,932 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:25,152 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2021-06-05 14:15:25,153 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1210723178, now seen corresponding path program 19 times [2021-06-05 14:15:25,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:25,153 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920287745] [2021-06-05 14:15:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:25,255 INFO L134 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:15:25,255 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:25,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920287745] [2021-06-05 14:15:25,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920287745] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:25,256 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068520031] [2021-06-05 14:15:25,256 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:15:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:25,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:25,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:25,397 INFO L134 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:15:25,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068520031] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:25,397 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:25,397 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:25,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382814474] [2021-06-05 14:15:25,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:25,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:25,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:25,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:25,399 INFO L87 Difference]: Start difference. First operand 135 states and 396 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:15:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:25,668 INFO L93 Difference]: Finished difference Result 203 states and 539 transitions. [2021-06-05 14:15:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:25,668 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 15 [2021-06-05 14:15:25,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:25,669 INFO L225 Difference]: With dead ends: 203 [2021-06-05 14:15:25,669 INFO L226 Difference]: Without dead ends: 198 [2021-06-05 14:15:25,669 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 269.0ms TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-06-05 14:15:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 137. [2021-06-05 14:15:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.9411764705882355) internal successors, (400), 136 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 400 transitions. [2021-06-05 14:15:25,673 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 400 transitions. Word has length 15 [2021-06-05 14:15:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:25,673 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 400 transitions. [2021-06-05 14:15:25,673 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:15:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 400 transitions. [2021-06-05 14:15:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:25,673 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:25,673 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:25,881 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:25,881 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1962306986, now seen corresponding path program 20 times [2021-06-05 14:15:25,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:25,882 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220684208] [2021-06-05 14:15:25,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:25,991 INFO L134 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:15:25,992 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:25,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220684208] [2021-06-05 14:15:25,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220684208] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:25,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141898929] [2021-06-05 14:15:25,992 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:15:26,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:26,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:26,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:26,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:26,401 INFO L134 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:15:26,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141898929] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:26,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:26,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:26,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727544427] [2021-06-05 14:15:26,403 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:26,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:26,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:26,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:26,404 INFO L87 Difference]: Start difference. First operand 137 states and 400 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:15:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:26,675 INFO L93 Difference]: Finished difference Result 202 states and 540 transitions. [2021-06-05 14:15:26,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:26,675 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 15 [2021-06-05 14:15:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:26,676 INFO L225 Difference]: With dead ends: 202 [2021-06-05 14:15:26,676 INFO L226 Difference]: Without dead ends: 196 [2021-06-05 14:15:26,676 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 263.3ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:15:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-06-05 14:15:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 135. [2021-06-05 14:15:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.955223880597015) internal successors, (396), 134 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 396 transitions. [2021-06-05 14:15:26,679 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 396 transitions. Word has length 15 [2021-06-05 14:15:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:26,679 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 396 transitions. [2021-06-05 14:15:26,680 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:15:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 396 transitions. [2021-06-05 14:15:26,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:26,680 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:26,680 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:26,908 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2021-06-05 14:15:26,909 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:26,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1226951760, now seen corresponding path program 4 times [2021-06-05 14:15:26,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:26,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487161036] [2021-06-05 14:15:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:27,088 INFO L134 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:15:27,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:27,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487161036] [2021-06-05 14:15:27,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487161036] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:27,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739189902] [2021-06-05 14:15:27,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:27,123 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:27,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:27,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 14:15:27,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:27,211 INFO L134 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:15:27,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739189902] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:27,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:27,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:27,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965114604] [2021-06-05 14:15:27,212 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:27,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:27,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:27,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:27,213 INFO L87 Difference]: Start difference. First operand 135 states and 396 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:15:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:27,331 INFO L93 Difference]: Finished difference Result 205 states and 542 transitions. [2021-06-05 14:15:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:27,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 15 [2021-06-05 14:15:27,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:27,333 INFO L225 Difference]: With dead ends: 205 [2021-06-05 14:15:27,333 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 14:15:27,333 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 200.5ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 14:15:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2021-06-05 14:15:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.9357142857142855) internal successors, (411), 140 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 411 transitions. [2021-06-05 14:15:27,336 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 411 transitions. Word has length 15 [2021-06-05 14:15:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:27,336 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 411 transitions. [2021-06-05 14:15:27,336 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:15:27,337 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 411 transitions. [2021-06-05 14:15:27,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:27,337 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:27,337 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:27,559 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:27,559 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:27,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:27,560 INFO L82 PathProgramCache]: Analyzing trace with hash -886595830, now seen corresponding path program 21 times [2021-06-05 14:15:27,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:27,560 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053581439] [2021-06-05 14:15:27,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:27,628 INFO L134 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:15:27,628 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:27,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053581439] [2021-06-05 14:15:27,628 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053581439] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:27,628 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846768627] [2021-06-05 14:15:27,628 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 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:15:27,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:27,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:27,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:27,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:27,753 INFO L134 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:15:27,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846768627] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:27,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:27,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:27,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986767984] [2021-06-05 14:15:27,754 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:27,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:27,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:27,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:27,754 INFO L87 Difference]: Start difference. First operand 141 states and 411 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:15:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:27,965 INFO L93 Difference]: Finished difference Result 181 states and 502 transitions. [2021-06-05 14:15:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:27,965 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 15 [2021-06-05 14:15:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:27,966 INFO L225 Difference]: With dead ends: 181 [2021-06-05 14:15:27,966 INFO L226 Difference]: Without dead ends: 174 [2021-06-05 14:15:27,966 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 216.1ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:15:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-06-05 14:15:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 141. [2021-06-05 14:15:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.9285714285714284) internal successors, (410), 140 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:15:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 410 transitions. [2021-06-05 14:15:27,970 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 410 transitions. Word has length 15 [2021-06-05 14:15:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:27,970 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 410 transitions. [2021-06-05 14:15:27,970 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:15:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 410 transitions. [2021-06-05 14:15:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:27,971 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:27,971 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:28,184 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2021-06-05 14:15:28,185 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:28,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:28,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1651983020, now seen corresponding path program 5 times [2021-06-05 14:15:28,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:28,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96942779] [2021-06-05 14:15:28,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:28,250 INFO L134 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:15:28,250 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:28,251 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96942779] [2021-06-05 14:15:28,251 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96942779] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:28,251 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840683685] [2021-06-05 14:15:28,251 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:15:28,285 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:28,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:28,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 14:15:28,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:28,380 INFO L134 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:15:28,380 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840683685] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:28,380 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:28,380 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:28,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971071373] [2021-06-05 14:15:28,380 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:28,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:28,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:28,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:28,381 INFO L87 Difference]: Start difference. First operand 141 states and 410 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:15:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:28,569 INFO L93 Difference]: Finished difference Result 190 states and 512 transitions. [2021-06-05 14:15:28,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:28,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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 15 [2021-06-05 14:15:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:28,570 INFO L225 Difference]: With dead ends: 190 [2021-06-05 14:15:28,570 INFO L226 Difference]: Without dead ends: 183 [2021-06-05 14:15:28,570 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 101.4ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-06-05 14:15:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 136. [2021-06-05 14:15:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.948148148148148) internal successors, (398), 135 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 398 transitions. [2021-06-05 14:15:28,573 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 398 transitions. Word has length 15 [2021-06-05 14:15:28,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:28,574 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 398 transitions. [2021-06-05 14:15:28,574 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 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:15:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 398 transitions. [2021-06-05 14:15:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:28,574 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:28,574 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:28,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable131 [2021-06-05 14:15:28,789 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:28,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1441032960, now seen corresponding path program 6 times [2021-06-05 14:15:28,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:28,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277618580] [2021-06-05 14:15:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:28,933 INFO L134 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:15:28,933 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:28,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277618580] [2021-06-05 14:15:28,933 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277618580] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:28,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643933909] [2021-06-05 14:15:28,933 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:15:28,963 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:15:28,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:28,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:28,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:29,058 INFO L134 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:15:29,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643933909] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:29,059 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:29,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 14:15:29,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802857917] [2021-06-05 14:15:29,060 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:29,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:29,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:29,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:29,060 INFO L87 Difference]: Start difference. First operand 136 states and 398 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:15:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:29,427 INFO L93 Difference]: Finished difference Result 214 states and 572 transitions. [2021-06-05 14:15:29,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:15:29,427 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 15 [2021-06-05 14:15:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:29,429 INFO L225 Difference]: With dead ends: 214 [2021-06-05 14:15:29,429 INFO L226 Difference]: Without dead ends: 189 [2021-06-05 14:15:29,429 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 376.4ms TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:15:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-06-05 14:15:29,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 137. [2021-06-05 14:15:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.8970588235294117) internal successors, (394), 136 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 394 transitions. [2021-06-05 14:15:29,433 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 394 transitions. Word has length 15 [2021-06-05 14:15:29,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:29,433 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 394 transitions. [2021-06-05 14:15:29,433 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:15:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 394 transitions. [2021-06-05 14:15:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:29,434 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:29,434 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:29,652 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2021-06-05 14:15:29,653 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash 981607308, now seen corresponding path program 22 times [2021-06-05 14:15:29,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:29,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654497948] [2021-06-05 14:15:29,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:29,809 INFO L134 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:15:29,809 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:29,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654497948] [2021-06-05 14:15:29,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654497948] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:29,809 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605918137] [2021-06-05 14:15:29,809 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 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:15:29,839 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:29,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:29,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:29,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:29,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:15:29,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605918137] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:29,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:29,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:29,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881548478] [2021-06-05 14:15:29,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:29,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:29,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:29,942 INFO L87 Difference]: Start difference. First operand 137 states and 394 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:15:30,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:30,181 INFO L93 Difference]: Finished difference Result 214 states and 591 transitions. [2021-06-05 14:15:30,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:30,182 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 15 [2021-06-05 14:15:30,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:30,183 INFO L225 Difference]: With dead ends: 214 [2021-06-05 14:15:30,183 INFO L226 Difference]: Without dead ends: 209 [2021-06-05 14:15:30,183 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 315.0ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:15:30,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-06-05 14:15:30,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 141. [2021-06-05 14:15:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.9285714285714284) internal successors, (410), 140 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:15:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 410 transitions. [2021-06-05 14:15:30,186 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 410 transitions. Word has length 15 [2021-06-05 14:15:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:30,186 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 410 transitions. [2021-06-05 14:15:30,186 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:15:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 410 transitions. [2021-06-05 14:15:30,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:30,187 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:30,187 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:30,412 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2021-06-05 14:15:30,412 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:30,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1951803882, now seen corresponding path program 23 times [2021-06-05 14:15:30,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:30,413 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164790522] [2021-06-05 14:15:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:30,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:30,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164790522] [2021-06-05 14:15:30,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164790522] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:30,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817401727] [2021-06-05 14:15:30,575 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 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:15:30,605 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:30,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:30,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:30,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:30,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817401727] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:30,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:30,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:30,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108281002] [2021-06-05 14:15:30,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:30,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:30,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:30,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:30,817 INFO L87 Difference]: Start difference. First operand 141 states and 410 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:15:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:31,062 INFO L93 Difference]: Finished difference Result 223 states and 605 transitions. [2021-06-05 14:15:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:31,062 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 15 [2021-06-05 14:15:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:31,063 INFO L225 Difference]: With dead ends: 223 [2021-06-05 14:15:31,063 INFO L226 Difference]: Without dead ends: 217 [2021-06-05 14:15:31,064 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 318.5ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:15:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-06-05 14:15:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 140. [2021-06-05 14:15:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.9280575539568345) internal successors, (407), 139 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 407 transitions. [2021-06-05 14:15:31,078 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 407 transitions. Word has length 15 [2021-06-05 14:15:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:31,078 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 407 transitions. [2021-06-05 14:15:31,078 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:15:31,078 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 407 transitions. [2021-06-05 14:15:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:31,079 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:31,079 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:31,290 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:31,290 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:31,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:31,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1273184878, now seen corresponding path program 7 times [2021-06-05 14:15:31,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:31,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641610182] [2021-06-05 14:15:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:31,349 INFO L134 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:15:31,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:31,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641610182] [2021-06-05 14:15:31,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641610182] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:31,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047682387] [2021-06-05 14:15:31,350 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 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:15:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:31,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:31,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:31,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047682387] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:31,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:31,515 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 14:15:31,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480633680] [2021-06-05 14:15:31,515 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:31,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:31,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:31,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:31,515 INFO L87 Difference]: Start difference. First operand 140 states and 407 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:15:31,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:31,896 INFO L93 Difference]: Finished difference Result 227 states and 607 transitions. [2021-06-05 14:15:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:15:31,897 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 15 [2021-06-05 14:15:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:31,897 INFO L225 Difference]: With dead ends: 227 [2021-06-05 14:15:31,898 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 14:15:31,898 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 286.1ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:15:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 14:15:31,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2021-06-05 14:15:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.8805970149253732) internal successors, (386), 134 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 386 transitions. [2021-06-05 14:15:31,901 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 386 transitions. Word has length 15 [2021-06-05 14:15:31,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:31,901 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 386 transitions. [2021-06-05 14:15:31,901 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:15:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 386 transitions. [2021-06-05 14:15:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:31,901 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:31,901 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:32,108 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2021-06-05 14:15:32,109 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:32,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:32,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1807933612, now seen corresponding path program 24 times [2021-06-05 14:15:32,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:32,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863273257] [2021-06-05 14:15:32,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:32,175 INFO L134 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:15:32,176 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:32,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863273257] [2021-06-05 14:15:32,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863273257] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:32,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24594887] [2021-06-05 14:15:32,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 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:15:32,258 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:15:32,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:32,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:32,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:32,411 INFO L134 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:15:32,411 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24594887] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:32,411 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:32,411 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:32,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376163964] [2021-06-05 14:15:32,411 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:32,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:32,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:32,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:32,412 INFO L87 Difference]: Start difference. First operand 135 states and 386 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:15:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:32,644 INFO L93 Difference]: Finished difference Result 190 states and 521 transitions. [2021-06-05 14:15:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:32,644 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 15 [2021-06-05 14:15:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:32,645 INFO L225 Difference]: With dead ends: 190 [2021-06-05 14:15:32,645 INFO L226 Difference]: Without dead ends: 183 [2021-06-05 14:15:32,645 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 265.1ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:15:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-06-05 14:15:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 136. [2021-06-05 14:15:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.8666666666666667) internal successors, (387), 135 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 387 transitions. [2021-06-05 14:15:32,648 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 387 transitions. Word has length 15 [2021-06-05 14:15:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:32,648 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 387 transitions. [2021-06-05 14:15:32,648 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:15:32,648 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 387 transitions. [2021-06-05 14:15:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:32,649 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:32,649 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:32,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:32,857 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:32,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1042546422, now seen corresponding path program 8 times [2021-06-05 14:15:32,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:32,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485676054] [2021-06-05 14:15:32,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:33,008 INFO L134 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:15:33,008 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:33,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485676054] [2021-06-05 14:15:33,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485676054] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:33,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759382864] [2021-06-05 14:15:33,009 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 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:15:33,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:33,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:33,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:33,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:33,113 INFO L134 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:15:33,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759382864] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:33,113 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:33,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 14:15:33,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679231718] [2021-06-05 14:15:33,114 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:33,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:33,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:33,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:33,115 INFO L87 Difference]: Start difference. First operand 136 states and 387 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:15:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:33,497 INFO L93 Difference]: Finished difference Result 269 states and 705 transitions. [2021-06-05 14:15:33,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:15:33,498 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 15 [2021-06-05 14:15:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:33,499 INFO L225 Difference]: With dead ends: 269 [2021-06-05 14:15:33,499 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 14:15:33,499 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 383.0ms TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:15:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 14:15:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 111. [2021-06-05 14:15:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.8727272727272726) internal successors, (316), 110 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:33,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 316 transitions. [2021-06-05 14:15:33,502 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 316 transitions. Word has length 15 [2021-06-05 14:15:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:33,502 INFO L482 AbstractCegarLoop]: Abstraction has 111 states and 316 transitions. [2021-06-05 14:15:33,502 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:15:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 316 transitions. [2021-06-05 14:15:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:33,502 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:33,503 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:33,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2021-06-05 14:15:33,725 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:33,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1544487814, now seen corresponding path program 25 times [2021-06-05 14:15:33,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:33,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684209062] [2021-06-05 14:15:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:34,073 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2021-06-05 14:15:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:34,202 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:34,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684209062] [2021-06-05 14:15:34,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684209062] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:34,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350652904] [2021-06-05 14:15:34,203 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 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:15:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:34,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:34,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:34,324 INFO L134 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:15:34,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350652904] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:34,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:34,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:34,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479466373] [2021-06-05 14:15:34,325 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:34,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:34,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:34,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:34,326 INFO L87 Difference]: Start difference. First operand 111 states and 316 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:15:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:34,483 INFO L93 Difference]: Finished difference Result 195 states and 547 transitions. [2021-06-05 14:15:34,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:34,483 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 15 [2021-06-05 14:15:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:34,484 INFO L225 Difference]: With dead ends: 195 [2021-06-05 14:15:34,484 INFO L226 Difference]: Without dead ends: 190 [2021-06-05 14:15:34,484 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 499.7ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:15:34,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2021-06-05 14:15:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 115. [2021-06-05 14:15:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.8771929824561404) internal successors, (328), 114 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 328 transitions. [2021-06-05 14:15:34,502 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 328 transitions. Word has length 15 [2021-06-05 14:15:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:34,502 INFO L482 AbstractCegarLoop]: Abstraction has 115 states and 328 transitions. [2021-06-05 14:15:34,502 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:15:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 328 transitions. [2021-06-05 14:15:34,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:34,502 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:34,502 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:34,712 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:34,713 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:34,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1323878784, now seen corresponding path program 26 times [2021-06-05 14:15:34,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:34,713 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670749358] [2021-06-05 14:15:34,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:34,783 INFO L134 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:15:34,783 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:34,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670749358] [2021-06-05 14:15:34,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670749358] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:34,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269582299] [2021-06-05 14:15:34,783 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 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:15:34,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:34,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:34,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:34,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:34,925 INFO L134 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:15:34,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269582299] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:34,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:34,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:34,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026808159] [2021-06-05 14:15:34,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:34,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:34,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:34,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:34,927 INFO L87 Difference]: Start difference. First operand 115 states and 328 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:15:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:35,253 INFO L93 Difference]: Finished difference Result 234 states and 644 transitions. [2021-06-05 14:15:35,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:35,254 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 15 [2021-06-05 14:15:35,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:35,255 INFO L225 Difference]: With dead ends: 234 [2021-06-05 14:15:35,255 INFO L226 Difference]: Without dead ends: 229 [2021-06-05 14:15:35,255 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 197.1ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:15:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-06-05 14:15:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 117. [2021-06-05 14:15:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.896551724137931) internal successors, (336), 116 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 336 transitions. [2021-06-05 14:15:35,264 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 336 transitions. Word has length 15 [2021-06-05 14:15:35,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:35,264 INFO L482 AbstractCegarLoop]: Abstraction has 117 states and 336 transitions. [2021-06-05 14:15:35,264 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:15:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 336 transitions. [2021-06-05 14:15:35,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:35,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:35,264 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:35,475 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:35,475 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:35,475 INFO L82 PathProgramCache]: Analyzing trace with hash 37677322, now seen corresponding path program 27 times [2021-06-05 14:15:35,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:35,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867268450] [2021-06-05 14:15:35,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:35,549 INFO L134 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:15:35,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:35,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867268450] [2021-06-05 14:15:35,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867268450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:35,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381622655] [2021-06-05 14:15:35,550 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 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:15:35,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:35,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:35,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:35,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:35,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:15:35,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381622655] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:35,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:35,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:35,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252910116] [2021-06-05 14:15:35,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:35,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:35,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:35,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:35,686 INFO L87 Difference]: Start difference. First operand 117 states and 336 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:15:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:35,961 INFO L93 Difference]: Finished difference Result 207 states and 572 transitions. [2021-06-05 14:15:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:35,962 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 15 [2021-06-05 14:15:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:35,963 INFO L225 Difference]: With dead ends: 207 [2021-06-05 14:15:35,963 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 14:15:35,963 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 232.4ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:15:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 14:15:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 113. [2021-06-05 14:15:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.875) internal successors, (322), 112 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 322 transitions. [2021-06-05 14:15:35,966 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 322 transitions. Word has length 15 [2021-06-05 14:15:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:35,966 INFO L482 AbstractCegarLoop]: Abstraction has 113 states and 322 transitions. [2021-06-05 14:15:35,966 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:15:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 322 transitions. [2021-06-05 14:15:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:35,966 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:35,966 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:36,184 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable168 [2021-06-05 14:15:36,185 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:36,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:36,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1830225050, now seen corresponding path program 28 times [2021-06-05 14:15:36,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:36,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298648489] [2021-06-05 14:15:36,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:36,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:36,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298648489] [2021-06-05 14:15:36,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298648489] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:36,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997890078] [2021-06-05 14:15:36,285 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 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:15:36,434 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:36,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:36,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:36,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:36,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:15:36,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997890078] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:36,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:36,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:36,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795030104] [2021-06-05 14:15:36,608 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:36,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:36,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:36,609 INFO L87 Difference]: Start difference. First operand 113 states and 322 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:15:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:36,855 INFO L93 Difference]: Finished difference Result 185 states and 511 transitions. [2021-06-05 14:15:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:36,855 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 15 [2021-06-05 14:15:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:36,856 INFO L225 Difference]: With dead ends: 185 [2021-06-05 14:15:36,856 INFO L226 Difference]: Without dead ends: 180 [2021-06-05 14:15:36,857 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 257.8ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:15:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-06-05 14:15:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 117. [2021-06-05 14:15:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.913793103448276) internal successors, (338), 116 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 338 transitions. [2021-06-05 14:15:36,859 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 338 transitions. Word has length 15 [2021-06-05 14:15:36,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:36,859 INFO L482 AbstractCegarLoop]: Abstraction has 117 states and 338 transitions. [2021-06-05 14:15:36,859 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:15:36,860 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 338 transitions. [2021-06-05 14:15:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:36,860 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:36,860 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:37,080 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:37,081 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:37,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:37,081 INFO L82 PathProgramCache]: Analyzing trace with hash -468668944, now seen corresponding path program 29 times [2021-06-05 14:15:37,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:37,081 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772839253] [2021-06-05 14:15:37,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:37,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:37,309 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:37,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772839253] [2021-06-05 14:15:37,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772839253] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:37,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813732768] [2021-06-05 14:15:37,309 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:37,338 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:37,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:37,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:37,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:37,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:15:37,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813732768] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:37,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:37,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:37,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360633300] [2021-06-05 14:15:37,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:37,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:37,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:37,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:37,429 INFO L87 Difference]: Start difference. First operand 117 states and 338 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:15:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:37,687 INFO L93 Difference]: Finished difference Result 195 states and 528 transitions. [2021-06-05 14:15:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:37,687 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 15 [2021-06-05 14:15:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:37,688 INFO L225 Difference]: With dead ends: 195 [2021-06-05 14:15:37,688 INFO L226 Difference]: Without dead ends: 189 [2021-06-05 14:15:37,688 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 354.2ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:15:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-06-05 14:15:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 115. [2021-06-05 14:15:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.8947368421052633) internal successors, (330), 114 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:15:37,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 330 transitions. [2021-06-05 14:15:37,691 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 330 transitions. Word has length 15 [2021-06-05 14:15:37,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:37,691 INFO L482 AbstractCegarLoop]: Abstraction has 115 states and 330 transitions. [2021-06-05 14:15:37,691 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:15:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 330 transitions. [2021-06-05 14:15:37,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-06-05 14:15:37,691 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:37,692 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:15:37,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable177 [2021-06-05 14:15:37,909 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:37,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1003898746, now seen corresponding path program 30 times [2021-06-05 14:15:37,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:37,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003786955] [2021-06-05 14:15:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:38,004 INFO L134 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:15:38,004 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:38,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003786955] [2021-06-05 14:15:38,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003786955] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:38,004 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702301393] [2021-06-05 14:15:38,004 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:38,033 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:15:38,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:38,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2021-06-05 14:15:38,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:38,107 INFO L134 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:15:38,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702301393] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:38,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:38,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:38,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078390306] [2021-06-05 14:15:38,108 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:38,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:38,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:38,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:38,109 INFO L87 Difference]: Start difference. First operand 115 states and 330 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:15:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:38,292 INFO L93 Difference]: Finished difference Result 166 states and 460 transitions. [2021-06-05 14:15:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:38,293 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 15 [2021-06-05 14:15:38,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:38,294 INFO L225 Difference]: With dead ends: 166 [2021-06-05 14:15:38,294 INFO L226 Difference]: Without dead ends: 159 [2021-06-05 14:15:38,294 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 143.9ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-06-05 14:15:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 113. [2021-06-05 14:15:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.875) internal successors, (322), 112 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 322 transitions. [2021-06-05 14:15:38,296 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 322 transitions. Word has length 15 [2021-06-05 14:15:38,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:38,296 INFO L482 AbstractCegarLoop]: Abstraction has 113 states and 322 transitions. [2021-06-05 14:15:38,296 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:15:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 322 transitions. [2021-06-05 14:15:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:38,296 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:38,296 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:15:38,497 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable182 [2021-06-05 14:15:38,497 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:38,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:38,497 INFO L82 PathProgramCache]: Analyzing trace with hash -639898996, now seen corresponding path program 1 times [2021-06-05 14:15:38,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:38,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708075530] [2021-06-05 14:15:38,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15: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:15:38,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:38,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708075530] [2021-06-05 14:15:38,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708075530] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:38,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041932834] [2021-06-05 14:15:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:15:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:38,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:38,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:38,680 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:15:38,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041932834] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:38,681 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:38,681 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:15:38,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575249380] [2021-06-05 14:15:38,681 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:15:38,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:15:38,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:15:38,682 INFO L87 Difference]: Start difference. First operand 113 states and 322 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:15:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:38,760 INFO L93 Difference]: Finished difference Result 186 states and 521 transitions. [2021-06-05 14:15:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:38,762 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 16 [2021-06-05 14:15:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:38,763 INFO L225 Difference]: With dead ends: 186 [2021-06-05 14:15:38,763 INFO L226 Difference]: Without dead ends: 186 [2021-06-05 14:15:38,763 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 74.4ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-06-05 14:15:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 126. [2021-06-05 14:15:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.992) internal successors, (374), 125 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 374 transitions. [2021-06-05 14:15:38,766 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 374 transitions. Word has length 16 [2021-06-05 14:15:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:38,766 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 374 transitions. [2021-06-05 14:15:38,766 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:15:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 374 transitions. [2021-06-05 14:15:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:38,766 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:38,767 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:15:38,989 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:38,990 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:38,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:38,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1991072770, now seen corresponding path program 1 times [2021-06-05 14:15:38,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:38,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920700006] [2021-06-05 14:15:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:39,017 INFO L134 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:15:39,017 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:39,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920700006] [2021-06-05 14:15:39,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920700006] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:39,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132190136] [2021-06-05 14:15:39,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:15:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:39,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:39,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:39,085 INFO L134 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:15:39,085 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132190136] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:39,085 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:39,085 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:39,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073023590] [2021-06-05 14:15:39,085 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:39,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:39,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:39,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:39,086 INFO L87 Difference]: Start difference. First operand 126 states and 374 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:39,172 INFO L93 Difference]: Finished difference Result 163 states and 462 transitions. [2021-06-05 14:15:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:39,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:15:39,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:39,173 INFO L225 Difference]: With dead ends: 163 [2021-06-05 14:15:39,173 INFO L226 Difference]: Without dead ends: 153 [2021-06-05 14:15:39,173 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 65.1ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-06-05 14:15:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 126. [2021-06-05 14:15:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.952) internal successors, (369), 125 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 369 transitions. [2021-06-05 14:15:39,175 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 369 transitions. Word has length 16 [2021-06-05 14:15:39,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:39,175 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 369 transitions. [2021-06-05 14:15:39,175 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:39,175 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 369 transitions. [2021-06-05 14:15:39,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:39,176 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:39,176 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:15:39,376 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable188 [2021-06-05 14:15:39,376 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:39,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1652532542, now seen corresponding path program 2 times [2021-06-05 14:15:39,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:39,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42154113] [2021-06-05 14:15:39,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:39,423 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:15:39,423 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:39,423 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42154113] [2021-06-05 14:15:39,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42154113] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:39,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044615362] [2021-06-05 14:15:39,424 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 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:15:39,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:39,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:39,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:39,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:39,509 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:15:39,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044615362] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:39,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:39,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:39,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872370317] [2021-06-05 14:15:39,510 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:39,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:39,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:39,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:39,511 INFO L87 Difference]: Start difference. First operand 126 states and 369 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:15:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:39,606 INFO L93 Difference]: Finished difference Result 193 states and 538 transitions. [2021-06-05 14:15:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:39,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 16 [2021-06-05 14:15:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:39,607 INFO L225 Difference]: With dead ends: 193 [2021-06-05 14:15:39,607 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 14:15:39,607 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 75.0ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 14:15:39,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 129. [2021-06-05 14:15:39,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 3.0) internal successors, (384), 128 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 384 transitions. [2021-06-05 14:15:39,609 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 384 transitions. Word has length 16 [2021-06-05 14:15:39,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:39,609 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 384 transitions. [2021-06-05 14:15:39,609 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:15:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 384 transitions. [2021-06-05 14:15:39,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:39,610 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:39,610 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:15:39,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:39,810 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1447398580, now seen corresponding path program 2 times [2021-06-05 14:15:39,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:39,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051164017] [2021-06-05 14:15:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:39,838 INFO L134 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:15:39,838 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:39,838 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051164017] [2021-06-05 14:15:39,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051164017] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:39,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799496352] [2021-06-05 14:15:39,839 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:15:39,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:39,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:39,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:39,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:39,911 INFO L134 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:15:39,911 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799496352] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:39,912 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:39,912 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:39,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681950224] [2021-06-05 14:15:39,912 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:39,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:39,912 INFO L87 Difference]: Start difference. First operand 129 states and 384 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:15:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:39,993 INFO L93 Difference]: Finished difference Result 180 states and 505 transitions. [2021-06-05 14:15:39,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:39,993 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 16 [2021-06-05 14:15:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:39,994 INFO L225 Difference]: With dead ends: 180 [2021-06-05 14:15:39,994 INFO L226 Difference]: Without dead ends: 176 [2021-06-05 14:15:39,994 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 68.5ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:15:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-06-05 14:15:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 136. [2021-06-05 14:15:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.9925925925925925) internal successors, (404), 135 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 404 transitions. [2021-06-05 14:15:39,997 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 404 transitions. Word has length 16 [2021-06-05 14:15:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:39,997 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 404 transitions. [2021-06-05 14:15:39,997 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:15:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 404 transitions. [2021-06-05 14:15:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:39,997 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:39,997 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:15:40,212 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192,49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:40,213 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:40,213 INFO L82 PathProgramCache]: Analyzing trace with hash -18443474, now seen corresponding path program 3 times [2021-06-05 14:15:40,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:40,213 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716923354] [2021-06-05 14:15:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:40,239 INFO L134 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:15:40,239 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:40,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716923354] [2021-06-05 14:15:40,239 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716923354] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:40,239 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304843269] [2021-06-05 14:15:40,239 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:15:40,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:40,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:40,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:40,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:40,318 INFO L134 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:15:40,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304843269] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:40,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:40,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:40,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281833456] [2021-06-05 14:15:40,319 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:40,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:40,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:40,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:40,320 INFO L87 Difference]: Start difference. First operand 136 states and 404 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:40,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:40,406 INFO L93 Difference]: Finished difference Result 176 states and 499 transitions. [2021-06-05 14:15:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:40,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:15:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:40,407 INFO L225 Difference]: With dead ends: 176 [2021-06-05 14:15:40,407 INFO L226 Difference]: Without dead ends: 173 [2021-06-05 14:15:40,407 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 58.0ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:40,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-06-05 14:15:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2021-06-05 14:15:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.9703703703703703) internal successors, (401), 135 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 401 transitions. [2021-06-05 14:15:40,409 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 401 transitions. Word has length 16 [2021-06-05 14:15:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:40,409 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 401 transitions. [2021-06-05 14:15:40,409 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 401 transitions. [2021-06-05 14:15:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:40,410 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:40,410 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:15:40,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195,50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:40,613 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:40,613 INFO L82 PathProgramCache]: Analyzing trace with hash 907579970, now seen corresponding path program 3 times [2021-06-05 14:15:40,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:40,613 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278668444] [2021-06-05 14:15:40,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:40,646 INFO L134 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:15:40,646 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:40,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278668444] [2021-06-05 14:15:40,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278668444] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:40,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177021881] [2021-06-05 14:15:40,647 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 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:15:40,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:40,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:40,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:40,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:40,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:15:40,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177021881] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:40,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:40,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:40,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45318770] [2021-06-05 14:15:40,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:40,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:40,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:40,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:40,745 INFO L87 Difference]: Start difference. First operand 136 states and 401 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:40,839 INFO L93 Difference]: Finished difference Result 162 states and 468 transitions. [2021-06-05 14:15:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:40,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:15:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:40,840 INFO L225 Difference]: With dead ends: 162 [2021-06-05 14:15:40,840 INFO L226 Difference]: Without dead ends: 162 [2021-06-05 14:15:40,841 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 80.0ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:15:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-06-05 14:15:40,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 132. [2021-06-05 14:15:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.9770992366412212) internal successors, (390), 131 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:15:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 390 transitions. [2021-06-05 14:15:40,845 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 390 transitions. Word has length 16 [2021-06-05 14:15:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:40,845 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 390 transitions. [2021-06-05 14:15:40,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 390 transitions. [2021-06-05 14:15:40,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:40,846 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:40,846 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:15:41,056 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:41,057 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:41,057 INFO L82 PathProgramCache]: Analyzing trace with hash -408327260, now seen corresponding path program 4 times [2021-06-05 14:15:41,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:41,057 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120325610] [2021-06-05 14:15:41,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:41,091 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:15:41,091 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:41,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120325610] [2021-06-05 14:15:41,091 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120325610] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:41,091 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942505947] [2021-06-05 14:15:41,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 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:15:41,133 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:41,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:41,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:41,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:41,185 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:15:41,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942505947] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:41,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:41,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:41,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707355022] [2021-06-05 14:15:41,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:41,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:41,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:41,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:41,187 INFO L87 Difference]: Start difference. First operand 132 states and 390 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:15:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:41,289 INFO L93 Difference]: Finished difference Result 192 states and 545 transitions. [2021-06-05 14:15:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:41,289 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 16 [2021-06-05 14:15:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:41,290 INFO L225 Difference]: With dead ends: 192 [2021-06-05 14:15:41,290 INFO L226 Difference]: Without dead ends: 192 [2021-06-05 14:15:41,290 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 82.7ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:15:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-06-05 14:15:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 138. [2021-06-05 14:15:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0437956204379564) internal successors, (417), 137 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 417 transitions. [2021-06-05 14:15:41,293 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 417 transitions. Word has length 16 [2021-06-05 14:15:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:41,293 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 417 transitions. [2021-06-05 14:15:41,294 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:15:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 417 transitions. [2021-06-05 14:15:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:41,294 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:41,294 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:15:41,512 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable199 [2021-06-05 14:15:41,513 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:41,513 INFO L82 PathProgramCache]: Analyzing trace with hash 786708914, now seen corresponding path program 4 times [2021-06-05 14:15:41,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:41,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035550331] [2021-06-05 14:15:41,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:41,542 INFO L134 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:15:41,542 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:41,542 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035550331] [2021-06-05 14:15:41,543 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035550331] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:41,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025495194] [2021-06-05 14:15:41,543 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 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:15:41,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:41,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:41,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:41,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:41,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025495194] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:41,629 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:41,629 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:41,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074644088] [2021-06-05 14:15:41,629 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:41,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:41,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:41,630 INFO L87 Difference]: Start difference. First operand 138 states and 417 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:41,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:41,734 INFO L93 Difference]: Finished difference Result 198 states and 562 transitions. [2021-06-05 14:15:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:41,734 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:15:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:41,735 INFO L225 Difference]: With dead ends: 198 [2021-06-05 14:15:41,735 INFO L226 Difference]: Without dead ends: 194 [2021-06-05 14:15:41,736 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 61.4ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:41,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-06-05 14:15:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 148. [2021-06-05 14:15:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.054421768707483) internal successors, (449), 147 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 449 transitions. [2021-06-05 14:15:41,738 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 449 transitions. Word has length 16 [2021-06-05 14:15:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:41,739 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 449 transitions. [2021-06-05 14:15:41,739 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 449 transitions. [2021-06-05 14:15:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:41,740 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:41,740 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:15:41,961 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable200 [2021-06-05 14:15:41,962 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:41,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:41,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2079303276, now seen corresponding path program 5 times [2021-06-05 14:15:41,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:41,962 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600362049] [2021-06-05 14:15:41,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:41,995 INFO L134 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:15:41,995 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:41,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600362049] [2021-06-05 14:15:41,995 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600362049] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:41,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592956331] [2021-06-05 14:15:41,995 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 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:15:42,020 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:42,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:42,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:42,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:42,067 INFO L134 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:15:42,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592956331] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:42,067 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:42,067 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:42,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109321941] [2021-06-05 14:15:42,068 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:42,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:42,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:42,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:42,068 INFO L87 Difference]: Start difference. First operand 148 states and 449 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:42,156 INFO L93 Difference]: Finished difference Result 201 states and 572 transitions. [2021-06-05 14:15:42,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:42,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:15:42,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:42,157 INFO L225 Difference]: With dead ends: 201 [2021-06-05 14:15:42,157 INFO L226 Difference]: Without dead ends: 198 [2021-06-05 14:15:42,157 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 81.7ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:15:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-06-05 14:15:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 148. [2021-06-05 14:15:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.0340136054421767) internal successors, (446), 147 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 446 transitions. [2021-06-05 14:15:42,159 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 446 transitions. Word has length 16 [2021-06-05 14:15:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:42,159 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 446 transitions. [2021-06-05 14:15:42,159 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 446 transitions. [2021-06-05 14:15:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:42,160 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:42,160 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:15:42,372 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable203 [2021-06-05 14:15:42,373 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1153279832, now seen corresponding path program 5 times [2021-06-05 14:15:42,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:42,373 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710910234] [2021-06-05 14:15:42,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:42,418 INFO L134 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:15:42,418 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:42,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710910234] [2021-06-05 14:15:42,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710910234] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:42,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11740926] [2021-06-05 14:15:42,418 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 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:15:42,454 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:42,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:42,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:42,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:42,495 INFO L134 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:15:42,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11740926] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:42,495 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:42,495 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:42,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536190430] [2021-06-05 14:15:42,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:42,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:42,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:42,496 INFO L87 Difference]: Start difference. First operand 148 states and 446 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:42,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:42,591 INFO L93 Difference]: Finished difference Result 200 states and 570 transitions. [2021-06-05 14:15:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:42,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:15:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:42,592 INFO L225 Difference]: With dead ends: 200 [2021-06-05 14:15:42,592 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 14:15:42,592 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 66.4ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 14:15:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 145. [2021-06-05 14:15:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0347222222222223) internal successors, (437), 144 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 437 transitions. [2021-06-05 14:15:42,594 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 437 transitions. Word has length 16 [2021-06-05 14:15:42,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:42,595 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 437 transitions. [2021-06-05 14:15:42,595 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 437 transitions. [2021-06-05 14:15:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:42,595 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:42,595 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:15:42,795 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable206 [2021-06-05 14:15:42,796 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:42,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:42,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1341923340, now seen corresponding path program 6 times [2021-06-05 14:15:42,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:42,796 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146047584] [2021-06-05 14:15:42,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:42,826 INFO L134 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:15:42,826 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:42,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146047584] [2021-06-05 14:15:42,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146047584] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:42,826 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338842915] [2021-06-05 14:15:42,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 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:15:42,856 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:15:42,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:42,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:42,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:42,896 INFO L134 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:15:42,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338842915] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:42,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:42,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:42,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045529533] [2021-06-05 14:15:42,897 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:42,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:42,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:42,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:42,897 INFO L87 Difference]: Start difference. First operand 145 states and 437 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:42,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:42,972 INFO L93 Difference]: Finished difference Result 178 states and 518 transitions. [2021-06-05 14:15:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:42,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:15:42,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:42,973 INFO L225 Difference]: With dead ends: 178 [2021-06-05 14:15:42,973 INFO L226 Difference]: Without dead ends: 172 [2021-06-05 14:15:42,973 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 58.7ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-05 14:15:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 145. [2021-06-05 14:15:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.013888888888889) internal successors, (434), 144 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 434 transitions. [2021-06-05 14:15:42,975 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 434 transitions. Word has length 16 [2021-06-05 14:15:42,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:42,975 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 434 transitions. [2021-06-05 14:15:42,975 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 434 transitions. [2021-06-05 14:15:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:42,975 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:42,975 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:15:43,176 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:43,176 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:43,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:43,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1171713858, now seen corresponding path program 6 times [2021-06-05 14:15:43,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:43,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951293613] [2021-06-05 14:15:43,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:43,206 INFO L134 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:15:43,206 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:43,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951293613] [2021-06-05 14:15:43,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951293613] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:43,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882666303] [2021-06-05 14:15:43,207 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 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:15:43,237 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:15:43,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:43,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:43,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:43,275 INFO L134 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:15:43,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882666303] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:43,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:43,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:15:43,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183728447] [2021-06-05 14:15:43,276 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:15:43,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:43,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:15:43,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:15:43,276 INFO L87 Difference]: Start difference. First operand 145 states and 434 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:15:43,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:43,368 INFO L93 Difference]: Finished difference Result 200 states and 574 transitions. [2021-06-05 14:15:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:43,368 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 16 [2021-06-05 14:15:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:43,369 INFO L225 Difference]: With dead ends: 200 [2021-06-05 14:15:43,369 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 14:15:43,369 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 64.7ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 14:15:43,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 138. [2021-06-05 14:15:43,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0) internal successors, (411), 137 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 411 transitions. [2021-06-05 14:15:43,372 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 411 transitions. Word has length 16 [2021-06-05 14:15:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:43,372 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 411 transitions. [2021-06-05 14:15:43,372 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:15:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 411 transitions. [2021-06-05 14:15:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:43,373 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:43,373 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:15:43,592 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable210 [2021-06-05 14:15:43,593 INFO L430 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:43,593 INFO L82 PathProgramCache]: Analyzing trace with hash 228804358, now seen corresponding path program 7 times [2021-06-05 14:15:43,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:43,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048174784] [2021-06-05 14:15:43,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:43,632 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:15:43,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:43,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048174784] [2021-06-05 14:15:43,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048174784] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:43,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683625700] [2021-06-05 14:15:43,633 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 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:15:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:43,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:43,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:43,712 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:15:43,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683625700] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:43,712 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:43,712 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:15:43,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077513334] [2021-06-05 14:15:43,713 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:15:43,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:43,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:15:43,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:15:43,713 INFO L87 Difference]: Start difference. First operand 138 states and 411 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:15:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:43,791 INFO L93 Difference]: Finished difference Result 314 states and 911 transitions. [2021-06-05 14:15:43,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:43,792 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 16 [2021-06-05 14:15:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:43,793 INFO L225 Difference]: With dead ends: 314 [2021-06-05 14:15:43,793 INFO L226 Difference]: Without dead ends: 314 [2021-06-05 14:15:43,793 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 57.6ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-06-05 14:15:43,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 152. [2021-06-05 14:15:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0927152317880795) internal successors, (467), 151 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 467 transitions. [2021-06-05 14:15:43,796 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 467 transitions. Word has length 16 [2021-06-05 14:15:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:43,796 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 467 transitions. [2021-06-05 14:15:43,796 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:15:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 467 transitions. [2021-06-05 14:15:43,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:43,797 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:43,797 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:15:44,016 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:44,017 INFO L430 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:44,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1435191172, now seen corresponding path program 7 times [2021-06-05 14:15:44,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:44,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388609473] [2021-06-05 14:15:44,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:44,046 INFO L134 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:15:44,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:44,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388609473] [2021-06-05 14:15:44,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388609473] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:44,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584473279] [2021-06-05 14:15:44,047 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 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:15:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:44,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:44,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:44,136 INFO L134 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:15:44,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584473279] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:44,136 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:44,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:44,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967080546] [2021-06-05 14:15:44,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:44,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:44,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:44,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:44,137 INFO L87 Difference]: Start difference. First operand 152 states and 467 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:15:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:44,219 INFO L93 Difference]: Finished difference Result 257 states and 727 transitions. [2021-06-05 14:15:44,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:44,219 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 16 [2021-06-05 14:15:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:44,220 INFO L225 Difference]: With dead ends: 257 [2021-06-05 14:15:44,220 INFO L226 Difference]: Without dead ends: 247 [2021-06-05 14:15:44,220 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-06-05 14:15:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 152. [2021-06-05 14:15:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0596026490066226) internal successors, (462), 151 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 462 transitions. [2021-06-05 14:15:44,223 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 462 transitions. Word has length 16 [2021-06-05 14:15:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:44,223 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 462 transitions. [2021-06-05 14:15:44,223 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:15:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 462 transitions. [2021-06-05 14:15:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:44,224 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:44,224 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:15:44,428 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable212 [2021-06-05 14:15:44,428 INFO L430 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1773731400, now seen corresponding path program 8 times [2021-06-05 14:15:44,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:44,429 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339807249] [2021-06-05 14:15:44,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:44,625 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:15:44,625 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:44,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339807249] [2021-06-05 14:15:44,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339807249] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:44,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762052225] [2021-06-05 14:15:44,625 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 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:15:44,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:44,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:44,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:44,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:44,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762052225] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:44,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:44,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:44,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061669060] [2021-06-05 14:15:44,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:44,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:44,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:44,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:44,704 INFO L87 Difference]: Start difference. First operand 152 states and 462 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:15:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:44,859 INFO L93 Difference]: Finished difference Result 311 states and 888 transitions. [2021-06-05 14:15:44,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:44,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 16 [2021-06-05 14:15:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:44,861 INFO L225 Difference]: With dead ends: 311 [2021-06-05 14:15:44,861 INFO L226 Difference]: Without dead ends: 311 [2021-06-05 14:15:44,861 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 202.6ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-06-05 14:15:44,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 158. [2021-06-05 14:15:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.1337579617834397) internal successors, (492), 157 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 492 transitions. [2021-06-05 14:15:44,865 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 492 transitions. Word has length 16 [2021-06-05 14:15:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:44,865 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 492 transitions. [2021-06-05 14:15:44,865 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:15:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 492 transitions. [2021-06-05 14:15:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:44,865 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:44,865 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:15:45,084 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215,60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:45,085 INFO L430 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:45,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:45,085 INFO L82 PathProgramCache]: Analyzing trace with hash -578695226, now seen corresponding path program 8 times [2021-06-05 14:15:45,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:45,085 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246923552] [2021-06-05 14:15:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:45,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:45,175 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:45,175 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246923552] [2021-06-05 14:15:45,175 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246923552] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:45,176 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251496602] [2021-06-05 14:15:45,176 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 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:15:45,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:45,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:45,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:45,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:45,297 INFO L134 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:15:45,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251496602] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:45,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:45,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:45,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376223574] [2021-06-05 14:15:45,297 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:45,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:45,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:45,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:45,298 INFO L87 Difference]: Start difference. First operand 158 states and 492 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:15:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:45,393 INFO L93 Difference]: Finished difference Result 283 states and 806 transitions. [2021-06-05 14:15:45,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:45,393 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 16 [2021-06-05 14:15:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:45,394 INFO L225 Difference]: With dead ends: 283 [2021-06-05 14:15:45,394 INFO L226 Difference]: Without dead ends: 279 [2021-06-05 14:15:45,394 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 120.0ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:15:45,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-06-05 14:15:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 165. [2021-06-05 14:15:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.1219512195121952) internal successors, (512), 164 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:15:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 512 transitions. [2021-06-05 14:15:45,398 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 512 transitions. Word has length 16 [2021-06-05 14:15:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:45,398 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 512 transitions. [2021-06-05 14:15:45,398 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:15:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 512 transitions. [2021-06-05 14:15:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:45,399 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:45,399 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:15:45,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable216 [2021-06-05 14:15:45,613 INFO L430 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:45,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:45,613 INFO L82 PathProgramCache]: Analyzing trace with hash 850259880, now seen corresponding path program 9 times [2021-06-05 14:15:45,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:45,613 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278585541] [2021-06-05 14:15:45,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:45,659 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:45,659 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278585541] [2021-06-05 14:15:45,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278585541] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:45,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514067465] [2021-06-05 14:15:45,673 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 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:15:45,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:45,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:45,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:45,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:45,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:15:45,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514067465] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:45,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:45,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:45,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831101913] [2021-06-05 14:15:45,753 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:45,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:45,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:45,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:45,754 INFO L87 Difference]: Start difference. First operand 165 states and 512 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:45,855 INFO L93 Difference]: Finished difference Result 294 states and 846 transitions. [2021-06-05 14:15:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:45,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:15:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:45,857 INFO L225 Difference]: With dead ends: 294 [2021-06-05 14:15:45,857 INFO L226 Difference]: Without dead ends: 291 [2021-06-05 14:15:45,857 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 62.0ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-06-05 14:15:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 168. [2021-06-05 14:15:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 3.0838323353293413) internal successors, (515), 167 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 515 transitions. [2021-06-05 14:15:45,863 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 515 transitions. Word has length 16 [2021-06-05 14:15:45,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:45,863 INFO L482 AbstractCegarLoop]: Abstraction has 168 states and 515 transitions. [2021-06-05 14:15:45,863 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:45,863 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 515 transitions. [2021-06-05 14:15:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:45,864 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:45,864 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:15:46,086 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219,62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:46,087 INFO L430 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:46,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:46,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1776283324, now seen corresponding path program 9 times [2021-06-05 14:15:46,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:46,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806293975] [2021-06-05 14:15:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:46,146 INFO L134 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:15:46,146 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:46,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806293975] [2021-06-05 14:15:46,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806293975] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:46,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141613648] [2021-06-05 14:15:46,147 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 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:15:46,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:46,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:46,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:46,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:46,257 INFO L134 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:15:46,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141613648] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:46,257 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:46,257 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:46,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853896585] [2021-06-05 14:15:46,258 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:46,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:46,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:46,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:46,258 INFO L87 Difference]: Start difference. First operand 168 states and 515 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:15:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:46,379 INFO L93 Difference]: Finished difference Result 271 states and 781 transitions. [2021-06-05 14:15:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:46,379 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 16 [2021-06-05 14:15:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:46,381 INFO L225 Difference]: With dead ends: 271 [2021-06-05 14:15:46,381 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 14:15:46,381 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 98.9ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:15:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 14:15:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2021-06-05 14:15:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.0789473684210527) internal successors, (468), 152 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 468 transitions. [2021-06-05 14:15:46,384 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 468 transitions. Word has length 16 [2021-06-05 14:15:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:46,384 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 468 transitions. [2021-06-05 14:15:46,384 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:15:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 468 transitions. [2021-06-05 14:15:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:46,384 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:46,385 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:15:46,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable222 [2021-06-05 14:15:46,608 INFO L430 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:46,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2036008658, now seen corresponding path program 10 times [2021-06-05 14:15:46,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:46,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370614702] [2021-06-05 14:15:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:15:46,688 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:46,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370614702] [2021-06-05 14:15:46,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370614702] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:46,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260040733] [2021-06-05 14:15:46,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 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:15:46,722 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:46,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:46,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:46,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:46,824 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:15:46,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260040733] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:46,824 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:46,824 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:15:46,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919232029] [2021-06-05 14:15:46,824 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:15:46,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:46,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:15:46,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:46,825 INFO L87 Difference]: Start difference. First operand 153 states and 468 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:15:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:47,189 INFO L93 Difference]: Finished difference Result 308 states and 874 transitions. [2021-06-05 14:15:47,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:15:47,189 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 16 [2021-06-05 14:15:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:47,190 INFO L225 Difference]: With dead ends: 308 [2021-06-05 14:15:47,190 INFO L226 Difference]: Without dead ends: 298 [2021-06-05 14:15:47,190 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 315.6ms TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:15:47,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-06-05 14:15:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 143. [2021-06-05 14:15:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.035211267605634) internal successors, (431), 142 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 431 transitions. [2021-06-05 14:15:47,192 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 431 transitions. Word has length 16 [2021-06-05 14:15:47,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:47,193 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 431 transitions. [2021-06-05 14:15:47,193 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:15:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 431 transitions. [2021-06-05 14:15:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:47,193 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:47,193 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:15:47,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:47,394 INFO L430 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:47,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:47,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1350168710, now seen corresponding path program 10 times [2021-06-05 14:15:47,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:47,394 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531088281] [2021-06-05 14:15:47,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:47,428 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:15:47,428 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:47,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531088281] [2021-06-05 14:15:47,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531088281] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:47,429 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:47,429 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:47,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958378566] [2021-06-05 14:15:47,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:47,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:47,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:47,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:47,430 INFO L87 Difference]: Start difference. First operand 143 states and 431 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:47,527 INFO L93 Difference]: Finished difference Result 204 states and 571 transitions. [2021-06-05 14:15:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:47,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:47,528 INFO L225 Difference]: With dead ends: 204 [2021-06-05 14:15:47,528 INFO L226 Difference]: Without dead ends: 194 [2021-06-05 14:15:47,528 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 71.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:47,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-06-05 14:15:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 145. [2021-06-05 14:15:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0069444444444446) internal successors, (433), 144 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 433 transitions. [2021-06-05 14:15:47,530 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 433 transitions. Word has length 16 [2021-06-05 14:15:47,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:47,530 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 433 transitions. [2021-06-05 14:15:47,530 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:47,530 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 433 transitions. [2021-06-05 14:15:47,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:47,531 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:47,531 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:15:47,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2021-06-05 14:15:47,532 INFO L430 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:47,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:47,532 INFO L82 PathProgramCache]: Analyzing trace with hash -474092858, now seen corresponding path program 11 times [2021-06-05 14:15:47,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:47,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455411479] [2021-06-05 14:15:47,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:47,560 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:15:47,561 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:47,561 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455411479] [2021-06-05 14:15:47,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455411479] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:47,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:47,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:47,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512642644] [2021-06-05 14:15:47,561 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:47,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:47,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:47,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:47,562 INFO L87 Difference]: Start difference. First operand 145 states and 433 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:47,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:47,700 INFO L93 Difference]: Finished difference Result 197 states and 551 transitions. [2021-06-05 14:15:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:47,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:47,701 INFO L225 Difference]: With dead ends: 197 [2021-06-05 14:15:47,701 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 14:15:47,701 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 107.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 14:15:47,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 151. [2021-06-05 14:15:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.966666666666667) internal successors, (445), 150 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 445 transitions. [2021-06-05 14:15:47,704 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 445 transitions. Word has length 16 [2021-06-05 14:15:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:47,704 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 445 transitions. [2021-06-05 14:15:47,704 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 445 transitions. [2021-06-05 14:15:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:47,704 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:47,704 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:15:47,704 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2021-06-05 14:15:47,704 INFO L430 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash -547465338, now seen corresponding path program 12 times [2021-06-05 14:15:47,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:47,705 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456878537] [2021-06-05 14:15:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:47,737 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:15:47,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:47,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456878537] [2021-06-05 14:15:47,738 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456878537] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:47,738 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:47,738 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:47,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420102090] [2021-06-05 14:15:47,738 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:47,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:47,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:47,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:47,739 INFO L87 Difference]: Start difference. First operand 151 states and 445 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:47,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:47,846 INFO L93 Difference]: Finished difference Result 182 states and 529 transitions. [2021-06-05 14:15:47,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:47,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:47,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:47,848 INFO L225 Difference]: With dead ends: 182 [2021-06-05 14:15:47,848 INFO L226 Difference]: Without dead ends: 177 [2021-06-05 14:15:47,848 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 89.2ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-06-05 14:15:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 143. [2021-06-05 14:15:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.0211267605633805) internal successors, (429), 142 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 429 transitions. [2021-06-05 14:15:47,850 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 429 transitions. Word has length 16 [2021-06-05 14:15:47,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:47,851 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 429 transitions. [2021-06-05 14:15:47,851 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:47,851 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 429 transitions. [2021-06-05 14:15:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:47,852 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:47,852 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:15:47,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2021-06-05 14:15:47,852 INFO L430 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:47,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:47,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1766834084, now seen corresponding path program 11 times [2021-06-05 14:15:47,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:47,852 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906870294] [2021-06-05 14:15:47,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:47,906 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:15:47,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:47,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906870294] [2021-06-05 14:15:47,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906870294] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:47,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460124694] [2021-06-05 14:15:47,907 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 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:15:47,942 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:47,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:47,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:47,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:48,018 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:15:48,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460124694] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:48,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:48,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 14:15:48,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947251029] [2021-06-05 14:15:48,019 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:15:48,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:48,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:15:48,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:48,020 INFO L87 Difference]: Start difference. First operand 143 states and 429 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:15:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:48,232 INFO L93 Difference]: Finished difference Result 259 states and 737 transitions. [2021-06-05 14:15:48,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:48,233 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 16 [2021-06-05 14:15:48,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:48,234 INFO L225 Difference]: With dead ends: 259 [2021-06-05 14:15:48,234 INFO L226 Difference]: Without dead ends: 259 [2021-06-05 14:15:48,234 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 188.0ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:15:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-06-05 14:15:48,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 151. [2021-06-05 14:15:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 3.1266666666666665) internal successors, (469), 150 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 469 transitions. [2021-06-05 14:15:48,237 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 469 transitions. Word has length 16 [2021-06-05 14:15:48,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:48,238 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 469 transitions. [2021-06-05 14:15:48,238 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:15:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 469 transitions. [2021-06-05 14:15:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:48,238 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:48,238 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:15:48,440 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable227 [2021-06-05 14:15:48,440 INFO L430 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:48,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1333097038, now seen corresponding path program 13 times [2021-06-05 14:15:48,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:48,441 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011613298] [2021-06-05 14:15:48,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:48,542 INFO L134 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:15:48,543 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:48,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011613298] [2021-06-05 14:15:48,543 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011613298] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:48,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302735372] [2021-06-05 14:15:48,543 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 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:15:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:48,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:48,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:48,644 INFO L134 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:15:48,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302735372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:48,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:48,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:48,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417173539] [2021-06-05 14:15:48,644 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:48,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:48,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:48,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:48,646 INFO L87 Difference]: Start difference. First operand 151 states and 469 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:15:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:48,752 INFO L93 Difference]: Finished difference Result 245 states and 702 transitions. [2021-06-05 14:15:48,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:48,752 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 16 [2021-06-05 14:15:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:48,766 INFO L225 Difference]: With dead ends: 245 [2021-06-05 14:15:48,766 INFO L226 Difference]: Without dead ends: 241 [2021-06-05 14:15:48,766 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 95.6ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-06-05 14:15:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 159. [2021-06-05 14:15:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.1265822784810124) internal successors, (494), 158 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 494 transitions. [2021-06-05 14:15:48,770 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 494 transitions. Word has length 16 [2021-06-05 14:15:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:48,770 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 494 transitions. [2021-06-05 14:15:48,770 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:15:48,770 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 494 transitions. [2021-06-05 14:15:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:48,771 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:48,771 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:15:48,994 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable228 [2021-06-05 14:15:48,994 INFO L430 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:48,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:48,994 INFO L82 PathProgramCache]: Analyzing trace with hash 95858068, now seen corresponding path program 12 times [2021-06-05 14:15:48,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:48,995 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242917487] [2021-06-05 14:15:48,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:49,070 INFO L134 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:15:49,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:49,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242917487] [2021-06-05 14:15:49,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242917487] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:49,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454806730] [2021-06-05 14:15:49,071 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 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:15:49,127 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:15:49,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:49,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:49,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:49,215 INFO L134 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:15:49,215 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454806730] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:49,215 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:49,215 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 14:15:49,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774184404] [2021-06-05 14:15:49,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:15:49,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:49,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:15:49,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:49,216 INFO L87 Difference]: Start difference. First operand 159 states and 494 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:15:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:49,482 INFO L93 Difference]: Finished difference Result 256 states and 722 transitions. [2021-06-05 14:15:49,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:49,482 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 16 [2021-06-05 14:15:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:49,483 INFO L225 Difference]: With dead ends: 256 [2021-06-05 14:15:49,483 INFO L226 Difference]: Without dead ends: 253 [2021-06-05 14:15:49,483 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 206.8ms TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:15:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-06-05 14:15:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 162. [2021-06-05 14:15:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 3.0869565217391304) internal successors, (497), 161 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 497 transitions. [2021-06-05 14:15:49,486 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 497 transitions. Word has length 16 [2021-06-05 14:15:49,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:49,487 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 497 transitions. [2021-06-05 14:15:49,487 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:15:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 497 transitions. [2021-06-05 14:15:49,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:49,487 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:49,487 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:15:49,696 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231,67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:49,697 INFO L430 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:49,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1021881512, now seen corresponding path program 14 times [2021-06-05 14:15:49,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:49,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329436552] [2021-06-05 14:15:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:49,742 INFO L134 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:15:49,742 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:49,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329436552] [2021-06-05 14:15:49,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329436552] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:49,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511580265] [2021-06-05 14:15:49,742 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 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:15:49,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:49,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:49,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:49,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:49,860 INFO L134 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:15:49,860 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511580265] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:49,860 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:49,860 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:49,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113345060] [2021-06-05 14:15:49,861 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:49,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:49,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:49,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:49,861 INFO L87 Difference]: Start difference. First operand 162 states and 497 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:15:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:49,944 INFO L93 Difference]: Finished difference Result 260 states and 746 transitions. [2021-06-05 14:15:49,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:49,944 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 16 [2021-06-05 14:15:49,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:49,945 INFO L225 Difference]: With dead ends: 260 [2021-06-05 14:15:49,945 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 14:15:49,945 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 102.7ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:49,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 14:15:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 159. [2021-06-05 14:15:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.088607594936709) internal successors, (488), 158 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 488 transitions. [2021-06-05 14:15:49,948 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 488 transitions. Word has length 16 [2021-06-05 14:15:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:49,948 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 488 transitions. [2021-06-05 14:15:49,948 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:15:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 488 transitions. [2021-06-05 14:15:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:49,948 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:49,948 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:15:50,149 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable234 [2021-06-05 14:15:50,149 INFO L430 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:50,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:50,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2109417596, now seen corresponding path program 13 times [2021-06-05 14:15:50,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:50,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373134629] [2021-06-05 14:15:50,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:50,212 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:15:50,212 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:50,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373134629] [2021-06-05 14:15:50,213 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373134629] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:50,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710816831] [2021-06-05 14:15:50,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 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:15:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:50,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:50,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:50,285 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:15:50,285 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710816831] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:50,285 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:50,285 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:50,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591145403] [2021-06-05 14:15:50,285 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:50,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:50,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:50,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:50,286 INFO L87 Difference]: Start difference. First operand 159 states and 488 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:15:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:50,370 INFO L93 Difference]: Finished difference Result 256 states and 720 transitions. [2021-06-05 14:15:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:50,370 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 16 [2021-06-05 14:15:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:50,371 INFO L225 Difference]: With dead ends: 256 [2021-06-05 14:15:50,371 INFO L226 Difference]: Without dead ends: 256 [2021-06-05 14:15:50,371 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 64.1ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-06-05 14:15:50,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 154. [2021-06-05 14:15:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.0718954248366015) internal successors, (470), 153 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:15:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 470 transitions. [2021-06-05 14:15:50,374 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 470 transitions. Word has length 16 [2021-06-05 14:15:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:50,374 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 470 transitions. [2021-06-05 14:15:50,374 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:15:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 470 transitions. [2021-06-05 14:15:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:50,374 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:50,374 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:15:50,575 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable235 [2021-06-05 14:15:50,575 INFO L430 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:50,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:50,575 INFO L82 PathProgramCache]: Analyzing trace with hash -213836346, now seen corresponding path program 14 times [2021-06-05 14:15:50,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:50,575 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776477538] [2021-06-05 14:15:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:50,620 INFO L134 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:15:50,620 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:50,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776477538] [2021-06-05 14:15:50,621 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776477538] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:50,621 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115878591] [2021-06-05 14:15:50,621 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 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:15:50,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:50,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:50,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:50,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:50,709 INFO L134 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:15:50,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115878591] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:50,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:50,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:50,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488285434] [2021-06-05 14:15:50,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:50,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:50,710 INFO L87 Difference]: Start difference. First operand 154 states and 470 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:15:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:50,793 INFO L93 Difference]: Finished difference Result 234 states and 666 transitions. [2021-06-05 14:15:50,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:50,793 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 16 [2021-06-05 14:15:50,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:50,794 INFO L225 Difference]: With dead ends: 234 [2021-06-05 14:15:50,794 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 14:15:50,794 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 68.5ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 14:15:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2021-06-05 14:15:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0596026490066226) internal successors, (462), 151 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 462 transitions. [2021-06-05 14:15:50,796 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 462 transitions. Word has length 16 [2021-06-05 14:15:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:50,796 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 462 transitions. [2021-06-05 14:15:50,796 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:15:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 462 transitions. [2021-06-05 14:15:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:50,797 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:50,797 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:15:50,997 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236,70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:50,997 INFO L430 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:50,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2074530712, now seen corresponding path program 15 times [2021-06-05 14:15:50,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:50,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540621449] [2021-06-05 14:15:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:51,055 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:15:51,055 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:51,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540621449] [2021-06-05 14:15:51,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540621449] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:51,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:51,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:51,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441916400] [2021-06-05 14:15:51,056 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:51,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:51,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:51,056 INFO L87 Difference]: Start difference. First operand 152 states and 462 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:51,166 INFO L93 Difference]: Finished difference Result 229 states and 636 transitions. [2021-06-05 14:15:51,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:51,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:51,167 INFO L225 Difference]: With dead ends: 229 [2021-06-05 14:15:51,168 INFO L226 Difference]: Without dead ends: 225 [2021-06-05 14:15:51,168 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 100.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-06-05 14:15:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 154. [2021-06-05 14:15:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.045751633986928) internal successors, (466), 153 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:15:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 466 transitions. [2021-06-05 14:15:51,171 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 466 transitions. Word has length 16 [2021-06-05 14:15:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:51,171 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 466 transitions. [2021-06-05 14:15:51,171 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 466 transitions. [2021-06-05 14:15:51,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:51,172 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:51,172 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:15:51,172 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2021-06-05 14:15:51,172 INFO L430 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:51,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:51,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2147064104, now seen corresponding path program 16 times [2021-06-05 14:15:51,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:51,172 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951720659] [2021-06-05 14:15:51,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:51,207 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:15:51,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:51,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951720659] [2021-06-05 14:15:51,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951720659] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:51,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:51,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:51,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145439651] [2021-06-05 14:15:51,208 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:51,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:51,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:51,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:51,208 INFO L87 Difference]: Start difference. First operand 154 states and 466 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:51,324 INFO L93 Difference]: Finished difference Result 212 states and 610 transitions. [2021-06-05 14:15:51,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:51,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:51,325 INFO L225 Difference]: With dead ends: 212 [2021-06-05 14:15:51,325 INFO L226 Difference]: Without dead ends: 209 [2021-06-05 14:15:51,325 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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:15:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-06-05 14:15:51,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2021-06-05 14:15:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.0460526315789473) internal successors, (463), 152 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 463 transitions. [2021-06-05 14:15:51,328 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 463 transitions. Word has length 16 [2021-06-05 14:15:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:51,328 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 463 transitions. [2021-06-05 14:15:51,328 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 463 transitions. [2021-06-05 14:15:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:51,329 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:51,329 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:15:51,329 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2021-06-05 14:15:51,329 INFO L430 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:51,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1481357318, now seen corresponding path program 15 times [2021-06-05 14:15:51,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:51,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935045560] [2021-06-05 14:15:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:51,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:15:51,361 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:51,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935045560] [2021-06-05 14:15:51,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935045560] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:51,362 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:51,362 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:51,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410719745] [2021-06-05 14:15:51,362 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:51,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:51,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:51,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:51,362 INFO L87 Difference]: Start difference. First operand 153 states and 463 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:51,450 INFO L93 Difference]: Finished difference Result 222 states and 625 transitions. [2021-06-05 14:15:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:51,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:51,451 INFO L225 Difference]: With dead ends: 222 [2021-06-05 14:15:51,451 INFO L226 Difference]: Without dead ends: 219 [2021-06-05 14:15:51,451 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 56.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-06-05 14:15:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 158. [2021-06-05 14:15:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.0127388535031847) internal successors, (473), 157 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 473 transitions. [2021-06-05 14:15:51,454 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 473 transitions. Word has length 16 [2021-06-05 14:15:51,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:51,455 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 473 transitions. [2021-06-05 14:15:51,455 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 473 transitions. [2021-06-05 14:15:51,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:51,455 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:51,455 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:15:51,455 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2021-06-05 14:15:51,455 INFO L430 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:51,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:51,456 INFO L82 PathProgramCache]: Analyzing trace with hash 384029742, now seen corresponding path program 16 times [2021-06-05 14:15:51,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:51,456 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79973879] [2021-06-05 14:15:51,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:51,484 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:15:51,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:51,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79973879] [2021-06-05 14:15:51,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79973879] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:51,485 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:51,485 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:51,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036302124] [2021-06-05 14:15:51,485 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:51,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:51,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:51,486 INFO L87 Difference]: Start difference. First operand 158 states and 473 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:51,566 INFO L93 Difference]: Finished difference Result 209 states and 606 transitions. [2021-06-05 14:15:51,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:51,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:51,567 INFO L225 Difference]: With dead ends: 209 [2021-06-05 14:15:51,567 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 14:15:51,567 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 50.1ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 14:15:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 153. [2021-06-05 14:15:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.039473684210526) internal successors, (462), 152 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 462 transitions. [2021-06-05 14:15:51,569 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 462 transitions. Word has length 16 [2021-06-05 14:15:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:51,569 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 462 transitions. [2021-06-05 14:15:51,569 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 462 transitions. [2021-06-05 14:15:51,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:51,569 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:51,570 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:15:51,570 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2021-06-05 14:15:51,570 INFO L430 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:51,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:51,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1323363576, now seen corresponding path program 17 times [2021-06-05 14:15:51,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:51,570 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464648373] [2021-06-05 14:15:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:51,602 INFO L134 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:15:51,603 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:51,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464648373] [2021-06-05 14:15:51,603 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464648373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:51,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744244126] [2021-06-05 14:15:51,603 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 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:15:51,628 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:15:51,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:51,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:51,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:51,686 INFO L134 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:15:51,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744244126] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:51,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:51,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:51,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725187854] [2021-06-05 14:15:51,687 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:51,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:51,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:51,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:51,687 INFO L87 Difference]: Start difference. First operand 153 states and 462 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:15:51,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:51,771 INFO L93 Difference]: Finished difference Result 214 states and 614 transitions. [2021-06-05 14:15:51,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:51,776 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 16 [2021-06-05 14:15:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:51,777 INFO L225 Difference]: With dead ends: 214 [2021-06-05 14:15:51,777 INFO L226 Difference]: Without dead ends: 214 [2021-06-05 14:15:51,777 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 76.4ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-06-05 14:15:51,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 151. [2021-06-05 14:15:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 3.0) internal successors, (450), 150 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 450 transitions. [2021-06-05 14:15:51,779 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 450 transitions. Word has length 16 [2021-06-05 14:15:51,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:51,779 INFO L482 AbstractCegarLoop]: Abstraction has 151 states and 450 transitions. [2021-06-05 14:15:51,779 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:15:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 450 transitions. [2021-06-05 14:15:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:51,779 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:51,779 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:15:51,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable243 [2021-06-05 14:15:51,980 INFO L430 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:51,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:51,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1610047614, now seen corresponding path program 18 times [2021-06-05 14:15:51,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:51,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538757701] [2021-06-05 14:15:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:52,042 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:15:52,042 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:52,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538757701] [2021-06-05 14:15:52,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538757701] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:52,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:52,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:52,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077416873] [2021-06-05 14:15:52,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:52,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:52,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:52,043 INFO L87 Difference]: Start difference. First operand 151 states and 450 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:52,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:52,165 INFO L93 Difference]: Finished difference Result 191 states and 561 transitions. [2021-06-05 14:15:52,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:52,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:52,166 INFO L225 Difference]: With dead ends: 191 [2021-06-05 14:15:52,166 INFO L226 Difference]: Without dead ends: 189 [2021-06-05 14:15:52,166 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 88.3ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:52,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-06-05 14:15:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 145. [2021-06-05 14:15:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0277777777777777) internal successors, (436), 144 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 436 transitions. [2021-06-05 14:15:52,168 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 436 transitions. Word has length 16 [2021-06-05 14:15:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:52,169 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 436 transitions. [2021-06-05 14:15:52,169 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 436 transitions. [2021-06-05 14:15:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:52,169 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:52,169 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:15:52,169 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2021-06-05 14:15:52,170 INFO L430 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:52,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1975020344, now seen corresponding path program 17 times [2021-06-05 14:15:52,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:52,170 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469639474] [2021-06-05 14:15:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:52,219 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:15:52,219 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:52,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469639474] [2021-06-05 14:15:52,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469639474] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:52,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480524935] [2021-06-05 14:15:52,219 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 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:15:52,251 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:52,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:52,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:52,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:52,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480524935] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:52,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:52,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:52,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211434720] [2021-06-05 14:15:52,319 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:52,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:52,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:52,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:52,324 INFO L87 Difference]: Start difference. First operand 145 states and 436 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:15:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:52,433 INFO L93 Difference]: Finished difference Result 260 states and 749 transitions. [2021-06-05 14:15:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:52,433 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 16 [2021-06-05 14:15:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:52,434 INFO L225 Difference]: With dead ends: 260 [2021-06-05 14:15:52,434 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 14:15:52,434 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 101.1ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:15:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 14:15:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 152. [2021-06-05 14:15:52,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.0927152317880795) internal successors, (467), 151 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 467 transitions. [2021-06-05 14:15:52,440 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 467 transitions. Word has length 16 [2021-06-05 14:15:52,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:52,440 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 467 transitions. [2021-06-05 14:15:52,440 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:15:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 467 transitions. [2021-06-05 14:15:52,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:52,441 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:52,441 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:15:52,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable245 [2021-06-05 14:15:52,665 INFO L430 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:52,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1124910778, now seen corresponding path program 19 times [2021-06-05 14:15:52,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:52,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690131300] [2021-06-05 14:15:52,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:52,715 INFO L134 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:15:52,715 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:52,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690131300] [2021-06-05 14:15:52,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690131300] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:52,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421755467] [2021-06-05 14:15:52,715 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 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:15:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:52,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:52,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:52,801 INFO L134 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:15:52,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421755467] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:52,802 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:52,802 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:52,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791023497] [2021-06-05 14:15:52,802 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:52,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:52,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:52,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:52,802 INFO L87 Difference]: Start difference. First operand 152 states and 467 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:52,890 INFO L93 Difference]: Finished difference Result 273 states and 794 transitions. [2021-06-05 14:15:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:52,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:15:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:52,891 INFO L225 Difference]: With dead ends: 273 [2021-06-05 14:15:52,891 INFO L226 Difference]: Without dead ends: 269 [2021-06-05 14:15:52,892 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 66.9ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-06-05 14:15:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 163. [2021-06-05 14:15:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.1049382716049383) internal successors, (503), 162 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 503 transitions. [2021-06-05 14:15:52,894 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 503 transitions. Word has length 16 [2021-06-05 14:15:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:52,895 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 503 transitions. [2021-06-05 14:15:52,895 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 503 transitions. [2021-06-05 14:15:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:52,895 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:52,895 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:15:53,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable246 [2021-06-05 14:15:53,096 INFO L430 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:53,096 INFO L82 PathProgramCache]: Analyzing trace with hash 304044328, now seen corresponding path program 18 times [2021-06-05 14:15:53,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:53,096 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951941183] [2021-06-05 14:15:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:53,134 INFO L134 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:15:53,135 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:53,135 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951941183] [2021-06-05 14:15:53,135 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951941183] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:53,135 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417576484] [2021-06-05 14:15:53,135 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 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:15:53,160 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:15:53,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:53,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:53,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:53,214 INFO L134 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:15:53,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417576484] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:53,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:53,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:53,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82616357] [2021-06-05 14:15:53,214 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:53,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:53,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:53,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:53,215 INFO L87 Difference]: Start difference. First operand 163 states and 503 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:15:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:53,291 INFO L93 Difference]: Finished difference Result 263 states and 760 transitions. [2021-06-05 14:15:53,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:53,291 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 16 [2021-06-05 14:15:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:53,292 INFO L225 Difference]: With dead ends: 263 [2021-06-05 14:15:53,292 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 14:15:53,292 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 78.1ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:15:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 14:15:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 163. [2021-06-05 14:15:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0864197530864197) internal successors, (500), 162 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 500 transitions. [2021-06-05 14:15:53,295 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 500 transitions. Word has length 16 [2021-06-05 14:15:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:53,295 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 500 transitions. [2021-06-05 14:15:53,295 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:15:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 500 transitions. [2021-06-05 14:15:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:53,295 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:53,295 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:15:53,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249,74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:53,501 INFO L430 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:53,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:53,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1230067772, now seen corresponding path program 20 times [2021-06-05 14:15:53,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:53,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999874592] [2021-06-05 14:15:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:53,529 INFO L134 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:15:53,530 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:53,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999874592] [2021-06-05 14:15:53,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999874592] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:53,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987847106] [2021-06-05 14:15:53,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 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:15:53,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:53,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:53,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:53,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:53,590 INFO L134 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:15:53,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987847106] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:53,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:53,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:15:53,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552271308] [2021-06-05 14:15:53,591 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:15:53,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:53,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:15:53,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:15:53,591 INFO L87 Difference]: Start difference. First operand 163 states and 500 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:53,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:53,674 INFO L93 Difference]: Finished difference Result 281 states and 820 transitions. [2021-06-05 14:15:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:53,674 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:15:53,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:53,675 INFO L225 Difference]: With dead ends: 281 [2021-06-05 14:15:53,675 INFO L226 Difference]: Without dead ends: 281 [2021-06-05 14:15:53,675 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 60.8ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-06-05 14:15:53,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 160. [2021-06-05 14:15:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.088050314465409) internal successors, (491), 159 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:53,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 491 transitions. [2021-06-05 14:15:53,677 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 491 transitions. Word has length 16 [2021-06-05 14:15:53,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:53,677 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 491 transitions. [2021-06-05 14:15:53,678 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:53,678 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 491 transitions. [2021-06-05 14:15:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:53,678 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:53,678 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:15:53,892 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252,75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:53,893 INFO L430 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:53,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:53,893 INFO L82 PathProgramCache]: Analyzing trace with hash -569696352, now seen corresponding path program 19 times [2021-06-05 14:15:53,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:53,893 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396344731] [2021-06-05 14:15:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:53,923 INFO L134 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:15:53,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:53,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396344731] [2021-06-05 14:15:53,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396344731] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:53,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537695420] [2021-06-05 14:15:53,924 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 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:15:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:53,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:53,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:54,011 INFO L134 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:15:54,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537695420] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:54,011 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:54,011 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:54,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489595805] [2021-06-05 14:15:54,011 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:54,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:54,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:54,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:54,012 INFO L87 Difference]: Start difference. First operand 160 states and 491 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:15:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:54,085 INFO L93 Difference]: Finished difference Result 253 states and 725 transitions. [2021-06-05 14:15:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:54,085 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 16 [2021-06-05 14:15:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:54,086 INFO L225 Difference]: With dead ends: 253 [2021-06-05 14:15:54,086 INFO L226 Difference]: Without dead ends: 247 [2021-06-05 14:15:54,086 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 66.6ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:54,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-06-05 14:15:54,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2021-06-05 14:15:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.069182389937107) internal successors, (488), 159 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 488 transitions. [2021-06-05 14:15:54,090 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 488 transitions. Word has length 16 [2021-06-05 14:15:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:54,090 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 488 transitions. [2021-06-05 14:15:54,090 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:15:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 488 transitions. [2021-06-05 14:15:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:54,090 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:54,090 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:15:54,313 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253,76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:54,313 INFO L430 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:54,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1211633746, now seen corresponding path program 21 times [2021-06-05 14:15:54,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:54,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899392119] [2021-06-05 14:15:54,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:54,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:54,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899392119] [2021-06-05 14:15:54,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899392119] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:54,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930835998] [2021-06-05 14:15:54,352 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 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:15:54,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:54,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:54,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:54,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:54,425 INFO L134 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:15:54,425 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930835998] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:54,425 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:54,425 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:15:54,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420382377] [2021-06-05 14:15:54,426 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:15:54,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:54,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:15:54,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:15:54,426 INFO L87 Difference]: Start difference. First operand 160 states and 488 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:15:54,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:54,502 INFO L93 Difference]: Finished difference Result 294 states and 862 transitions. [2021-06-05 14:15:54,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:54,503 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 16 [2021-06-05 14:15:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:54,503 INFO L225 Difference]: With dead ends: 294 [2021-06-05 14:15:54,503 INFO L226 Difference]: Without dead ends: 294 [2021-06-05 14:15:54,504 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 60.7ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-06-05 14:15:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 157. [2021-06-05 14:15:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 3.0705128205128207) internal successors, (479), 156 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 479 transitions. [2021-06-05 14:15:54,506 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 479 transitions. Word has length 16 [2021-06-05 14:15:54,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:54,506 INFO L482 AbstractCegarLoop]: Abstraction has 157 states and 479 transitions. [2021-06-05 14:15:54,506 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:15:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 479 transitions. [2021-06-05 14:15:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:54,507 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:54,507 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:15:54,707 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable256 [2021-06-05 14:15:54,707 INFO L430 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:54,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:54,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1044998274, now seen corresponding path program 20 times [2021-06-05 14:15:54,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:54,708 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038936352] [2021-06-05 14:15:54,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:54,786 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:54,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038936352] [2021-06-05 14:15:54,786 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038936352] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:54,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779708855] [2021-06-05 14:15:54,786 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:15:54,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:54,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:54,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:54,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:54,894 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:15:54,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779708855] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:54,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:54,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 14:15:54,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266089754] [2021-06-05 14:15:54,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:15:54,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:54,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:15:54,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:54,895 INFO L87 Difference]: Start difference. First operand 157 states and 479 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:15:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:55,125 INFO L93 Difference]: Finished difference Result 282 states and 801 transitions. [2021-06-05 14:15:55,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:55,125 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 16 [2021-06-05 14:15:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:55,126 INFO L225 Difference]: With dead ends: 282 [2021-06-05 14:15:55,126 INFO L226 Difference]: Without dead ends: 282 [2021-06-05 14:15:55,126 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 188.7ms TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:15:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-06-05 14:15:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 165. [2021-06-05 14:15:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.1646341463414633) internal successors, (519), 164 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:15:55,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 519 transitions. [2021-06-05 14:15:55,128 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 519 transitions. Word has length 16 [2021-06-05 14:15:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:55,129 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 519 transitions. [2021-06-05 14:15:55,129 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:15:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 519 transitions. [2021-06-05 14:15:55,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:55,129 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:55,129 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:15:55,329 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable257 [2021-06-05 14:15:55,330 INFO L430 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:55,330 INFO L82 PathProgramCache]: Analyzing trace with hash 150037900, now seen corresponding path program 22 times [2021-06-05 14:15:55,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:55,330 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355341162] [2021-06-05 14:15:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:55,362 INFO L134 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:15:55,362 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:55,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355341162] [2021-06-05 14:15:55,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355341162] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:55,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766149865] [2021-06-05 14:15:55,362 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 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:15:55,387 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:55,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:55,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:55,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:55,443 INFO L134 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:15:55,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766149865] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:55,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:55,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:55,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283570908] [2021-06-05 14:15:55,444 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:55,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:55,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:55,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:55,444 INFO L87 Difference]: Start difference. First operand 165 states and 519 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:15:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:55,528 INFO L93 Difference]: Finished difference Result 288 states and 815 transitions. [2021-06-05 14:15:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:55,529 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 16 [2021-06-05 14:15:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:55,529 INFO L225 Difference]: With dead ends: 288 [2021-06-05 14:15:55,529 INFO L226 Difference]: Without dead ends: 284 [2021-06-05 14:15:55,529 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 59.7ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-06-05 14:15:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 169. [2021-06-05 14:15:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 3.1904761904761907) internal successors, (536), 168 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 536 transitions. [2021-06-05 14:15:55,532 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 536 transitions. Word has length 16 [2021-06-05 14:15:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:55,532 INFO L482 AbstractCegarLoop]: Abstraction has 169 states and 536 transitions. [2021-06-05 14:15:55,532 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:15:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 536 transitions. [2021-06-05 14:15:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:55,533 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:55,533 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:15:55,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258,79 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:55,734 INFO L430 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:55,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:55,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1578993006, now seen corresponding path program 21 times [2021-06-05 14:15:55,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:55,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940448454] [2021-06-05 14:15:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:55,801 INFO L134 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:15:55,802 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:55,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940448454] [2021-06-05 14:15:55,802 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940448454] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:55,802 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425267061] [2021-06-05 14:15:55,802 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 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:15:55,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:15:55,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:55,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:55,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:55,923 INFO L134 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:15:55,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425267061] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:55,923 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:55,923 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-06-05 14:15:55,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688002643] [2021-06-05 14:15:55,923 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:15:55,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:55,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:15:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:55,924 INFO L87 Difference]: Start difference. First operand 169 states and 536 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:15:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:56,119 INFO L93 Difference]: Finished difference Result 275 states and 778 transitions. [2021-06-05 14:15:56,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:56,119 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 16 [2021-06-05 14:15:56,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:56,119 INFO L225 Difference]: With dead ends: 275 [2021-06-05 14:15:56,119 INFO L226 Difference]: Without dead ends: 272 [2021-06-05 14:15:56,120 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 205.2ms TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:15:56,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-06-05 14:15:56,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 172. [2021-06-05 14:15:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 3.152046783625731) internal successors, (539), 171 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:56,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 539 transitions. [2021-06-05 14:15:56,122 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 539 transitions. Word has length 16 [2021-06-05 14:15:56,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:56,122 INFO L482 AbstractCegarLoop]: Abstraction has 172 states and 539 transitions. [2021-06-05 14:15:56,122 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:15:56,122 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 539 transitions. [2021-06-05 14:15:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:56,123 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:56,123 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:15:56,323 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261,80 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:56,323 INFO L430 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1789950846, now seen corresponding path program 23 times [2021-06-05 14:15:56,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:56,324 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467302937] [2021-06-05 14:15:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:56,357 INFO L134 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:15:56,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:56,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467302937] [2021-06-05 14:15:56,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467302937] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:56,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349463477] [2021-06-05 14:15:56,357 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:15:56,383 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:56,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:56,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:56,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:56,426 INFO L134 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:15:56,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349463477] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:56,427 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:56,427 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:56,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763952658] [2021-06-05 14:15:56,427 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:56,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:56,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:56,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:56,427 INFO L87 Difference]: Start difference. First operand 172 states and 539 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:15:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:56,514 INFO L93 Difference]: Finished difference Result 295 states and 843 transitions. [2021-06-05 14:15:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:56,514 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 16 [2021-06-05 14:15:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:56,515 INFO L225 Difference]: With dead ends: 295 [2021-06-05 14:15:56,515 INFO L226 Difference]: Without dead ends: 295 [2021-06-05 14:15:56,515 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 77.9ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:56,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-06-05 14:15:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 166. [2021-06-05 14:15:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.121212121212121) internal successors, (515), 165 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 515 transitions. [2021-06-05 14:15:56,518 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 515 transitions. Word has length 16 [2021-06-05 14:15:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:56,518 INFO L482 AbstractCegarLoop]: Abstraction has 166 states and 515 transitions. [2021-06-05 14:15:56,518 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:15:56,518 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 515 transitions. [2021-06-05 14:15:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:56,518 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:56,518 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:15:56,718 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264,81 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:56,719 INFO L430 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:56,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash -702414762, now seen corresponding path program 22 times [2021-06-05 14:15:56,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:56,719 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371444776] [2021-06-05 14:15:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:56,756 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:15:56,756 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:56,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371444776] [2021-06-05 14:15:56,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371444776] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:56,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558443139] [2021-06-05 14:15:56,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:56,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:15:56,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:56,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:56,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:15:56,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558443139] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:56,869 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:56,869 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:56,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641209535] [2021-06-05 14:15:56,869 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:56,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:56,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:56,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:56,870 INFO L87 Difference]: Start difference. First operand 166 states and 515 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:15:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:56,968 INFO L93 Difference]: Finished difference Result 254 states and 721 transitions. [2021-06-05 14:15:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:56,968 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 16 [2021-06-05 14:15:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:56,969 INFO L225 Difference]: With dead ends: 254 [2021-06-05 14:15:56,969 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 14:15:56,969 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 84.5ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 14:15:56,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 161. [2021-06-05 14:15:56,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.10625) internal successors, (497), 160 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 497 transitions. [2021-06-05 14:15:56,973 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 497 transitions. Word has length 16 [2021-06-05 14:15:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:56,974 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 497 transitions. [2021-06-05 14:15:56,974 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:15:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 497 transitions. [2021-06-05 14:15:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:56,974 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:56,974 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:15:57,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265,82 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:57,199 INFO L430 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:57,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:57,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1269298592, now seen corresponding path program 23 times [2021-06-05 14:15:57,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:57,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544482815] [2021-06-05 14:15:57,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:57,237 INFO L134 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:15:57,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:57,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544482815] [2021-06-05 14:15:57,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544482815] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:57,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745122678] [2021-06-05 14:15:57,237 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 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:15:57,287 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:57,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:57,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:57,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:57,346 INFO L134 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:15:57,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745122678] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:57,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:57,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:15:57,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238712591] [2021-06-05 14:15:57,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:15:57,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:57,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:15:57,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:57,348 INFO L87 Difference]: Start difference. First operand 161 states and 497 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:15:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:57,449 INFO L93 Difference]: Finished difference Result 232 states and 667 transitions. [2021-06-05 14:15:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:57,449 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 16 [2021-06-05 14:15:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:57,450 INFO L225 Difference]: With dead ends: 232 [2021-06-05 14:15:57,450 INFO L226 Difference]: Without dead ends: 230 [2021-06-05 14:15:57,450 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 83.3ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:15:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-06-05 14:15:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 159. [2021-06-05 14:15:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0949367088607596) internal successors, (489), 158 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:57,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 489 transitions. [2021-06-05 14:15:57,453 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 489 transitions. Word has length 16 [2021-06-05 14:15:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:57,453 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 489 transitions. [2021-06-05 14:15:57,453 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:15:57,453 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 489 transitions. [2021-06-05 14:15:57,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:57,454 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:57,454 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:15:57,676 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable266 [2021-06-05 14:15:57,677 INFO L430 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash -591395774, now seen corresponding path program 24 times [2021-06-05 14:15:57,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:57,677 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169139055] [2021-06-05 14:15:57,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:57,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:15:57,986 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:57,986 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169139055] [2021-06-05 14:15:57,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169139055] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:57,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:57,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:57,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447208308] [2021-06-05 14:15:57,986 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:57,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:57,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:57,987 INFO L87 Difference]: Start difference. First operand 159 states and 489 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:58,060 INFO L93 Difference]: Finished difference Result 244 states and 679 transitions. [2021-06-05 14:15:58,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:58,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:58,061 INFO L225 Difference]: With dead ends: 244 [2021-06-05 14:15:58,061 INFO L226 Difference]: Without dead ends: 240 [2021-06-05 14:15:58,061 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 280.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-06-05 14:15:58,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 161. [2021-06-05 14:15:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.08125) internal successors, (493), 160 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 493 transitions. [2021-06-05 14:15:58,065 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 493 transitions. Word has length 16 [2021-06-05 14:15:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:58,065 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 493 transitions. [2021-06-05 14:15:58,065 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 493 transitions. [2021-06-05 14:15:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:58,065 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:58,065 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:15:58,065 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2021-06-05 14:15:58,065 INFO L430 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash -664768254, now seen corresponding path program 25 times [2021-06-05 14:15:58,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:58,066 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015629185] [2021-06-05 14:15:58,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:58,092 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:15:58,092 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:58,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015629185] [2021-06-05 14:15:58,092 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015629185] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:58,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:58,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:58,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464158030] [2021-06-05 14:15:58,093 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:58,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:58,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:58,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:58,093 INFO L87 Difference]: Start difference. First operand 161 states and 493 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:58,174 INFO L93 Difference]: Finished difference Result 227 states and 653 transitions. [2021-06-05 14:15:58,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:58,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:58,175 INFO L225 Difference]: With dead ends: 227 [2021-06-05 14:15:58,175 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 14:15:58,175 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 50.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 14:15:58,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 160. [2021-06-05 14:15:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0817610062893084) internal successors, (490), 159 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 490 transitions. [2021-06-05 14:15:58,177 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 490 transitions. Word has length 16 [2021-06-05 14:15:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:58,177 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 490 transitions. [2021-06-05 14:15:58,178 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,178 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 490 transitions. [2021-06-05 14:15:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:58,178 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:58,178 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:15:58,178 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2021-06-05 14:15:58,178 INFO L430 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:58,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1330475040, now seen corresponding path program 24 times [2021-06-05 14:15:58,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:58,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482468101] [2021-06-05 14:15:58,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:58,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:15:58,452 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:58,452 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482468101] [2021-06-05 14:15:58,452 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482468101] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:58,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:58,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:58,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772599761] [2021-06-05 14:15:58,453 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:58,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:58,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:58,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:58,453 INFO L87 Difference]: Start difference. First operand 160 states and 490 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:58,558 INFO L93 Difference]: Finished difference Result 242 states and 676 transitions. [2021-06-05 14:15:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:58,559 INFO L225 Difference]: With dead ends: 242 [2021-06-05 14:15:58,559 INFO L226 Difference]: Without dead ends: 239 [2021-06-05 14:15:58,559 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 280.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-06-05 14:15:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 165. [2021-06-05 14:15:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.048780487804878) internal successors, (500), 164 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 500 transitions. [2021-06-05 14:15:58,562 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 500 transitions. Word has length 16 [2021-06-05 14:15:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:58,562 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 500 transitions. [2021-06-05 14:15:58,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,562 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 500 transitions. [2021-06-05 14:15:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:58,563 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:58,563 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:15:58,563 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2021-06-05 14:15:58,563 INFO L430 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:58,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:58,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1867164680, now seen corresponding path program 25 times [2021-06-05 14:15:58,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:58,563 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767361306] [2021-06-05 14:15:58,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:58,842 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:15:58,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:58,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767361306] [2021-06-05 14:15:58,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767361306] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:58,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:58,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:58,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414810155] [2021-06-05 14:15:58,843 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:58,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:58,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:58,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:58,843 INFO L87 Difference]: Start difference. First operand 165 states and 500 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:58,945 INFO L93 Difference]: Finished difference Result 229 states and 657 transitions. [2021-06-05 14:15:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:58,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:58,946 INFO L225 Difference]: With dead ends: 229 [2021-06-05 14:15:58,946 INFO L226 Difference]: Without dead ends: 226 [2021-06-05 14:15:58,946 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 261.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-06-05 14:15:58,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 160. [2021-06-05 14:15:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0754716981132075) internal successors, (489), 159 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 489 transitions. [2021-06-05 14:15:58,949 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 489 transitions. Word has length 16 [2021-06-05 14:15:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:58,949 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 489 transitions. [2021-06-05 14:15:58,950 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 489 transitions. [2021-06-05 14:15:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:58,950 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:58,950 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:15:58,950 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2021-06-05 14:15:58,950 INFO L430 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:58,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1488468782, now seen corresponding path program 26 times [2021-06-05 14:15:58,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:58,951 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995996741] [2021-06-05 14:15:58,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:58,985 INFO L134 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:15:58,985 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:58,985 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995996741] [2021-06-05 14:15:58,985 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995996741] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:58,985 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897470001] [2021-06-05 14:15:58,985 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:15:59,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:15:59,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:15:59,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:15:59,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:15:59,068 INFO L134 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:15:59,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897470001] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:15:59,068 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:15:59,068 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:15:59,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70572175] [2021-06-05 14:15:59,068 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:15:59,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:59,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:15:59,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:59,069 INFO L87 Difference]: Start difference. First operand 160 states and 489 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:15:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:59,180 INFO L93 Difference]: Finished difference Result 257 states and 727 transitions. [2021-06-05 14:15:59,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:59,180 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 16 [2021-06-05 14:15:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:59,181 INFO L225 Difference]: With dead ends: 257 [2021-06-05 14:15:59,181 INFO L226 Difference]: Without dead ends: 257 [2021-06-05 14:15:59,181 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 75.6ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:15:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-06-05 14:15:59,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 162. [2021-06-05 14:15:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 3.0869565217391304) internal successors, (497), 161 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 497 transitions. [2021-06-05 14:15:59,184 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 497 transitions. Word has length 16 [2021-06-05 14:15:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:59,184 INFO L482 AbstractCegarLoop]: Abstraction has 162 states and 497 transitions. [2021-06-05 14:15:59,185 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:15:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 497 transitions. [2021-06-05 14:15:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:59,185 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:59,185 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:15:59,406 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273,84 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:15:59,407 INFO L430 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:59,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:59,407 INFO L82 PathProgramCache]: Analyzing trace with hash -126912676, now seen corresponding path program 27 times [2021-06-05 14:15:59,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:59,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648404915] [2021-06-05 14:15:59,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:59,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:15:59,452 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:59,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648404915] [2021-06-05 14:15:59,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648404915] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:59,453 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:59,453 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:59,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861709456] [2021-06-05 14:15:59,453 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:59,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:59,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:59,454 INFO L87 Difference]: Start difference. First operand 162 states and 497 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:59,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:59,564 INFO L93 Difference]: Finished difference Result 234 states and 674 transitions. [2021-06-05 14:15:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:59,565 INFO L225 Difference]: With dead ends: 234 [2021-06-05 14:15:59,565 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 14:15:59,565 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 71.9ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:15:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 14:15:59,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 159. [2021-06-05 14:15:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0759493670886076) internal successors, (486), 158 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 486 transitions. [2021-06-05 14:15:59,568 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 486 transitions. Word has length 16 [2021-06-05 14:15:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:59,568 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 486 transitions. [2021-06-05 14:15:59,568 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 486 transitions. [2021-06-05 14:15:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:59,569 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:59,569 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:15:59,569 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2021-06-05 14:15:59,569 INFO L430 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash -568892562, now seen corresponding path program 26 times [2021-06-05 14:15:59,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:59,570 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014008961] [2021-06-05 14:15:59,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:59,597 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:15:59,597 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:59,597 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014008961] [2021-06-05 14:15:59,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014008961] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:59,598 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:59,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:59,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577120395] [2021-06-05 14:15:59,598 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:59,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:59,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:59,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:59,598 INFO L87 Difference]: Start difference. First operand 159 states and 486 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:59,711 INFO L93 Difference]: Finished difference Result 213 states and 612 transitions. [2021-06-05 14:15:59,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:59,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:59,712 INFO L225 Difference]: With dead ends: 213 [2021-06-05 14:15:59,712 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 14:15:59,712 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 79.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:59,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 14:15:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 160. [2021-06-05 14:15:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0628930817610063) internal successors, (487), 159 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 487 transitions. [2021-06-05 14:15:59,715 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 487 transitions. Word has length 16 [2021-06-05 14:15:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:59,715 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 487 transitions. [2021-06-05 14:15:59,715 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 487 transitions. [2021-06-05 14:15:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:59,716 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:59,716 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:15:59,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2021-06-05 14:15:59,716 INFO L430 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:59,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:59,716 INFO L82 PathProgramCache]: Analyzing trace with hash 857708136, now seen corresponding path program 27 times [2021-06-05 14:15:59,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:59,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77034093] [2021-06-05 14:15:59,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:59,746 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:15:59,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:59,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77034093] [2021-06-05 14:15:59,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77034093] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:59,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:59,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:59,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643262688] [2021-06-05 14:15:59,749 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:59,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:59,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:59,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:59,750 INFO L87 Difference]: Start difference. First operand 160 states and 487 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:15:59,877 INFO L93 Difference]: Finished difference Result 210 states and 602 transitions. [2021-06-05 14:15:59,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:15:59,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:15:59,878 INFO L225 Difference]: With dead ends: 210 [2021-06-05 14:15:59,878 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 14:15:59,878 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 98.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:15:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 14:15:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 165. [2021-06-05 14:15:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 3.0304878048780486) internal successors, (497), 164 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:15:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 497 transitions. [2021-06-05 14:15:59,881 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 497 transitions. Word has length 16 [2021-06-05 14:15:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:15:59,881 INFO L482 AbstractCegarLoop]: Abstraction has 165 states and 497 transitions. [2021-06-05 14:15:59,881 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:15:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 497 transitions. [2021-06-05 14:15:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:15:59,881 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:15:59,881 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:15:59,881 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2021-06-05 14:15:59,881 INFO L430 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:15:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:15:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash -239619440, now seen corresponding path program 28 times [2021-06-05 14:15:59,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:15:59,882 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455378789] [2021-06-05 14:15:59,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:15:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:15:59,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:15:59,938 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:15:59,938 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455378789] [2021-06-05 14:15:59,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455378789] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:15:59,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:15:59,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:15:59,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686091488] [2021-06-05 14:15:59,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:15:59,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:15:59,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:15:59,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:15:59,939 INFO L87 Difference]: Start difference. First operand 165 states and 497 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:00,060 INFO L93 Difference]: Finished difference Result 197 states and 583 transitions. [2021-06-05 14:16:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:00,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:00,061 INFO L225 Difference]: With dead ends: 197 [2021-06-05 14:16:00,061 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 14:16:00,061 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 103.3ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 14:16:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 159. [2021-06-05 14:16:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.069620253164557) internal successors, (485), 158 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 485 transitions. [2021-06-05 14:16:00,063 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 485 transitions. Word has length 16 [2021-06-05 14:16:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:00,063 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 485 transitions. [2021-06-05 14:16:00,064 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 485 transitions. [2021-06-05 14:16:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:00,064 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:00,064 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:16:00,064 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2021-06-05 14:16:00,064 INFO L430 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:00,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:00,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1967643138, now seen corresponding path program 28 times [2021-06-05 14:16:00,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:00,066 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147325999] [2021-06-05 14:16:00,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:16:00,129 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:00,129 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147325999] [2021-06-05 14:16:00,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147325999] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:00,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083421129] [2021-06-05 14:16:00,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 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:16:00,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:16:00,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:00,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:00,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:00,227 INFO L134 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:16:00,227 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083421129] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:00,228 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:00,228 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-06-05 14:16:00,228 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354434627] [2021-06-05 14:16:00,228 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:16:00,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:00,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:16:00,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:00,228 INFO L87 Difference]: Start difference. First operand 159 states and 485 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:16:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:00,604 INFO L93 Difference]: Finished difference Result 288 states and 829 transitions. [2021-06-05 14:16:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:16:00,604 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 16 [2021-06-05 14:16:00,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:00,605 INFO L225 Difference]: With dead ends: 288 [2021-06-05 14:16:00,605 INFO L226 Difference]: Without dead ends: 277 [2021-06-05 14:16:00,605 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 310.9ms TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:16:00,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-06-05 14:16:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 147. [2021-06-05 14:16:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.0342465753424657) internal successors, (443), 146 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 443 transitions. [2021-06-05 14:16:00,608 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 443 transitions. Word has length 16 [2021-06-05 14:16:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:00,608 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 443 transitions. [2021-06-05 14:16:00,608 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:16:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 443 transitions. [2021-06-05 14:16:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:00,608 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:00,608 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:16:00,816 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable278 [2021-06-05 14:16:00,817 INFO L430 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:00,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1038652820, now seen corresponding path program 29 times [2021-06-05 14:16:00,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:00,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571590064] [2021-06-05 14:16:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:00,854 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:16:00,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:00,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571590064] [2021-06-05 14:16:00,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571590064] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:00,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874161766] [2021-06-05 14:16:00,855 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 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:16:00,899 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:00,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:00,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:00,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:00,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874161766] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:00,942 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:00,942 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:16:00,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628778966] [2021-06-05 14:16:00,943 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:16:00,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:00,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:16:00,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:16:00,948 INFO L87 Difference]: Start difference. First operand 147 states and 443 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:16:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:01,035 INFO L93 Difference]: Finished difference Result 224 states and 647 transitions. [2021-06-05 14:16:01,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:01,036 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 16 [2021-06-05 14:16:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:01,036 INFO L225 Difference]: With dead ends: 224 [2021-06-05 14:16:01,037 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 14:16:01,037 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 60.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 14:16:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 147. [2021-06-05 14:16:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.0342465753424657) internal successors, (443), 146 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 443 transitions. [2021-06-05 14:16:01,054 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 443 transitions. Word has length 16 [2021-06-05 14:16:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:01,055 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 443 transitions. [2021-06-05 14:16:01,055 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:16:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 443 transitions. [2021-06-05 14:16:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:01,055 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:01,055 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:16:01,278 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable279 [2021-06-05 14:16:01,278 INFO L430 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:01,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:01,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1592318946, now seen corresponding path program 29 times [2021-06-05 14:16:01,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:01,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333868662] [2021-06-05 14:16:01,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:01,308 INFO L134 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:16:01,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:01,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333868662] [2021-06-05 14:16:01,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333868662] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:01,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081009363] [2021-06-05 14:16:01,309 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:01,340 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:01,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:01,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:01,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:01,392 INFO L134 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:16:01,392 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081009363] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:01,392 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:01,392 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:16:01,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108070993] [2021-06-05 14:16:01,392 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:16:01,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:01,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:16:01,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:01,393 INFO L87 Difference]: Start difference. First operand 147 states and 443 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:16:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:01,469 INFO L93 Difference]: Finished difference Result 244 states and 672 transitions. [2021-06-05 14:16:01,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:01,469 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 16 [2021-06-05 14:16:01,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:01,470 INFO L225 Difference]: With dead ends: 244 [2021-06-05 14:16:01,470 INFO L226 Difference]: Without dead ends: 234 [2021-06-05 14:16:01,470 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 70.4ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-06-05 14:16:01,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 147. [2021-06-05 14:16:01,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.0) internal successors, (438), 146 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:01,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 438 transitions. [2021-06-05 14:16:01,473 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 438 transitions. Word has length 16 [2021-06-05 14:16:01,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:01,473 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 438 transitions. [2021-06-05 14:16:01,473 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:16:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 438 transitions. [2021-06-05 14:16:01,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:01,474 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:01,474 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:16:01,697 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable280 [2021-06-05 14:16:01,697 INFO L430 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:01,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1253778718, now seen corresponding path program 30 times [2021-06-05 14:16:01,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:01,698 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058972181] [2021-06-05 14:16:01,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:01,744 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:16:01,744 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:01,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058972181] [2021-06-05 14:16:01,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058972181] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:01,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520501922] [2021-06-05 14:16:01,745 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:16:01,775 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:01,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:01,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:01,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:01,825 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:16:01,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520501922] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:01,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:01,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:16:01,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895240214] [2021-06-05 14:16:01,826 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:16:01,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:01,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:16:01,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:16:01,826 INFO L87 Difference]: Start difference. First operand 147 states and 438 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:16:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:01,933 INFO L93 Difference]: Finished difference Result 248 states and 707 transitions. [2021-06-05 14:16:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:01,933 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 16 [2021-06-05 14:16:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:01,934 INFO L225 Difference]: With dead ends: 248 [2021-06-05 14:16:01,934 INFO L226 Difference]: Without dead ends: 248 [2021-06-05 14:16:01,934 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 83.2ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-06-05 14:16:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 153. [2021-06-05 14:16:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.0789473684210527) internal successors, (468), 152 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:01,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 468 transitions. [2021-06-05 14:16:01,937 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 468 transitions. Word has length 16 [2021-06-05 14:16:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:01,938 INFO L482 AbstractCegarLoop]: Abstraction has 153 states and 468 transitions. [2021-06-05 14:16:01,938 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:16:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 468 transitions. [2021-06-05 14:16:01,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:01,938 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:01,938 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:16:02,139 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283,88 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:02,139 INFO L430 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:02,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:02,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1846152404, now seen corresponding path program 30 times [2021-06-05 14:16:02,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:02,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303333785] [2021-06-05 14:16:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:02,196 INFO L134 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:16:02,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:02,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303333785] [2021-06-05 14:16:02,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303333785] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:02,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344417128] [2021-06-05 14:16:02,197 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 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:16:02,290 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:02,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:02,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:02,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:02,363 INFO L134 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:16:02,364 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344417128] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:02,364 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:02,364 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:02,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121446044] [2021-06-05 14:16:02,364 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:02,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:02,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:02,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:02,365 INFO L87 Difference]: Start difference. First operand 153 states and 468 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:16:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:02,501 INFO L93 Difference]: Finished difference Result 264 states and 730 transitions. [2021-06-05 14:16:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:02,501 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 16 [2021-06-05 14:16:02,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:02,502 INFO L225 Difference]: With dead ends: 264 [2021-06-05 14:16:02,502 INFO L226 Difference]: Without dead ends: 260 [2021-06-05 14:16:02,502 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 121.2ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-06-05 14:16:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 160. [2021-06-05 14:16:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.069182389937107) internal successors, (488), 159 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 488 transitions. [2021-06-05 14:16:02,505 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 488 transitions. Word has length 16 [2021-06-05 14:16:02,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:02,505 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 488 transitions. [2021-06-05 14:16:02,505 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:16:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 488 transitions. [2021-06-05 14:16:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:02,506 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:02,506 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:16:02,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284,89 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:02,725 INFO L430 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:02,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:02,725 INFO L82 PathProgramCache]: Analyzing trace with hash -417197298, now seen corresponding path program 31 times [2021-06-05 14:16:02,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:02,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143687204] [2021-06-05 14:16:02,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:02,755 INFO L134 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:16:02,755 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:02,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143687204] [2021-06-05 14:16:02,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143687204] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:02,756 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588253267] [2021-06-05 14:16:02,756 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 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:16:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:02,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:02,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:02,833 INFO L134 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:16:02,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588253267] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:02,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:02,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:16:02,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905311982] [2021-06-05 14:16:02,833 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:16:02,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:02,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:16:02,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:16:02,834 INFO L87 Difference]: Start difference. First operand 160 states and 488 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:02,919 INFO L93 Difference]: Finished difference Result 231 states and 665 transitions. [2021-06-05 14:16:02,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:02,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:16:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:02,921 INFO L225 Difference]: With dead ends: 231 [2021-06-05 14:16:02,921 INFO L226 Difference]: Without dead ends: 228 [2021-06-05 14:16:02,921 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 62.7ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:02,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-06-05 14:16:02,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 163. [2021-06-05 14:16:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 3.0308641975308643) internal successors, (491), 162 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 491 transitions. [2021-06-05 14:16:02,924 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 491 transitions. Word has length 16 [2021-06-05 14:16:02,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:02,924 INFO L482 AbstractCegarLoop]: Abstraction has 163 states and 491 transitions. [2021-06-05 14:16:02,924 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 491 transitions. [2021-06-05 14:16:02,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:02,925 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:02,925 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:16:03,140 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287,90 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:03,141 INFO L430 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:03,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:03,141 INFO L82 PathProgramCache]: Analyzing trace with hash 508826146, now seen corresponding path program 31 times [2021-06-05 14:16:03,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:03,141 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613070702] [2021-06-05 14:16:03,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:03,182 INFO L134 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:16:03,182 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:03,182 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613070702] [2021-06-05 14:16:03,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613070702] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:03,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500088778] [2021-06-05 14:16:03,183 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 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:16:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:03,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:03,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:03,293 INFO L134 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:16:03,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500088778] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:03,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:03,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:03,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628172419] [2021-06-05 14:16:03,294 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:03,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:03,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:03,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:03,294 INFO L87 Difference]: Start difference. First operand 163 states and 491 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:16:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:03,379 INFO L93 Difference]: Finished difference Result 249 states and 699 transitions. [2021-06-05 14:16:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:03,379 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 16 [2021-06-05 14:16:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:03,380 INFO L225 Difference]: With dead ends: 249 [2021-06-05 14:16:03,380 INFO L226 Difference]: Without dead ends: 249 [2021-06-05 14:16:03,380 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 90.5ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-06-05 14:16:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 148. [2021-06-05 14:16:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.020408163265306) internal successors, (444), 147 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 444 transitions. [2021-06-05 14:16:03,383 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 444 transitions. Word has length 16 [2021-06-05 14:16:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:03,383 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 444 transitions. [2021-06-05 14:16:03,383 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:16:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 444 transitions. [2021-06-05 14:16:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:03,383 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:03,383 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:16:03,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290,91 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:03,584 INFO L430 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:03,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:03,585 INFO L82 PathProgramCache]: Analyzing trace with hash 991501460, now seen corresponding path program 32 times [2021-06-05 14:16:03,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:03,585 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075215688] [2021-06-05 14:16:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:03,614 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:03,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075215688] [2021-06-05 14:16:03,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075215688] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:03,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351013587] [2021-06-05 14:16:03,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:03,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:03,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:03,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:03,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:03,685 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:16:03,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351013587] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:03,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:03,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:16:03,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545986697] [2021-06-05 14:16:03,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:16:03,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:03,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:16:03,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:16:03,686 INFO L87 Difference]: Start difference. First operand 148 states and 444 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:16:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:03,804 INFO L93 Difference]: Finished difference Result 304 states and 875 transitions. [2021-06-05 14:16:03,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:03,805 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 16 [2021-06-05 14:16:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:03,806 INFO L225 Difference]: With dead ends: 304 [2021-06-05 14:16:03,806 INFO L226 Difference]: Without dead ends: 304 [2021-06-05 14:16:03,806 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 64.5ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:03,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-06-05 14:16:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 152. [2021-06-05 14:16:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.019867549668874) internal successors, (456), 151 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:16:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 456 transitions. [2021-06-05 14:16:03,809 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 456 transitions. Word has length 16 [2021-06-05 14:16:03,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:03,809 INFO L482 AbstractCegarLoop]: Abstraction has 152 states and 456 transitions. [2021-06-05 14:16:03,809 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:16:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 456 transitions. [2021-06-05 14:16:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:03,809 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:03,809 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:16:04,029 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable291 [2021-06-05 14:16:04,029 INFO L430 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:04,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash -501516022, now seen corresponding path program 33 times [2021-06-05 14:16:04,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:04,030 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891115450] [2021-06-05 14:16:04,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:04,078 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:16:04,078 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:04,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891115450] [2021-06-05 14:16:04,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891115450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:04,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167460131] [2021-06-05 14:16:04,078 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 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:16:04,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:16:04,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:04,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:04,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:04,216 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:16:04,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167460131] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:04,217 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:04,217 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:16:04,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765493866] [2021-06-05 14:16:04,217 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:16:04,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:04,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:16:04,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:16:04,218 INFO L87 Difference]: Start difference. First operand 152 states and 456 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:16:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:04,393 INFO L93 Difference]: Finished difference Result 279 states and 796 transitions. [2021-06-05 14:16:04,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:04,394 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 16 [2021-06-05 14:16:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:04,395 INFO L225 Difference]: With dead ends: 279 [2021-06-05 14:16:04,395 INFO L226 Difference]: Without dead ends: 279 [2021-06-05 14:16:04,395 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 81.1ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:04,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-06-05 14:16:04,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 154. [2021-06-05 14:16:04,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.0326797385620914) internal successors, (464), 153 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 464 transitions. [2021-06-05 14:16:04,398 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 464 transitions. Word has length 16 [2021-06-05 14:16:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:04,398 INFO L482 AbstractCegarLoop]: Abstraction has 154 states and 464 transitions. [2021-06-05 14:16:04,398 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:16:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 464 transitions. [2021-06-05 14:16:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:04,399 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:04,399 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:16:04,621 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292,93 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:04,621 INFO L430 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:04,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:04,621 INFO L82 PathProgramCache]: Analyzing trace with hash 108641226, now seen corresponding path program 34 times [2021-06-05 14:16:04,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:04,622 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238330097] [2021-06-05 14:16:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:04,667 INFO L134 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:16:04,667 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:04,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238330097] [2021-06-05 14:16:04,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238330097] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:04,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473698337] [2021-06-05 14:16:04,668 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 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:16:04,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:16:04,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:04,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:04,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:04,814 INFO L134 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:16:04,814 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473698337] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:04,814 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:04,815 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:16:04,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790645398] [2021-06-05 14:16:04,815 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:16:04,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:04,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:16:04,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:16:04,815 INFO L87 Difference]: Start difference. First operand 154 states and 464 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:04,922 INFO L93 Difference]: Finished difference Result 255 states and 738 transitions. [2021-06-05 14:16:04,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:04,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:16:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:04,923 INFO L225 Difference]: With dead ends: 255 [2021-06-05 14:16:04,923 INFO L226 Difference]: Without dead ends: 253 [2021-06-05 14:16:04,923 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 79.8ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-06-05 14:16:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 148. [2021-06-05 14:16:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.020408163265306) internal successors, (444), 147 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 444 transitions. [2021-06-05 14:16:04,925 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 444 transitions. Word has length 16 [2021-06-05 14:16:04,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:04,925 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 444 transitions. [2021-06-05 14:16:04,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 444 transitions. [2021-06-05 14:16:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:04,926 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:04,926 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:16:05,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable293 [2021-06-05 14:16:05,127 INFO L430 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:05,127 INFO L82 PathProgramCache]: Analyzing trace with hash 82711532, now seen corresponding path program 32 times [2021-06-05 14:16:05,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:05,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8265009] [2021-06-05 14:16:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:05,177 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:16:05,177 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:05,177 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8265009] [2021-06-05 14:16:05,177 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8265009] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:05,177 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:05,177 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:05,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975645222] [2021-06-05 14:16:05,178 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:05,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:05,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:05,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:05,178 INFO L87 Difference]: Start difference. First operand 148 states and 444 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:05,279 INFO L93 Difference]: Finished difference Result 276 states and 746 transitions. [2021-06-05 14:16:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:05,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:05,281 INFO L225 Difference]: With dead ends: 276 [2021-06-05 14:16:05,281 INFO L226 Difference]: Without dead ends: 266 [2021-06-05 14:16:05,281 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 56.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-06-05 14:16:05,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 150. [2021-06-05 14:16:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.9932885906040267) internal successors, (446), 149 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 446 transitions. [2021-06-05 14:16:05,284 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 446 transitions. Word has length 16 [2021-06-05 14:16:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:05,284 INFO L482 AbstractCegarLoop]: Abstraction has 150 states and 446 transitions. [2021-06-05 14:16:05,284 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 446 transitions. [2021-06-05 14:16:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:05,285 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:05,285 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:16:05,285 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2021-06-05 14:16:05,285 INFO L430 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:05,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:05,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1741550036, now seen corresponding path program 33 times [2021-06-05 14:16:05,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:05,286 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296280598] [2021-06-05 14:16:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:05,321 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:16:05,321 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:05,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296280598] [2021-06-05 14:16:05,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296280598] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:05,322 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:05,322 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:05,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711938549] [2021-06-05 14:16:05,322 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:05,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:05,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:05,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:05,322 INFO L87 Difference]: Start difference. First operand 150 states and 446 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:05,416 INFO L93 Difference]: Finished difference Result 269 states and 726 transitions. [2021-06-05 14:16:05,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:05,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:05,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:05,417 INFO L225 Difference]: With dead ends: 269 [2021-06-05 14:16:05,417 INFO L226 Difference]: Without dead ends: 265 [2021-06-05 14:16:05,417 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 60.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-06-05 14:16:05,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 156. [2021-06-05 14:16:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.9548387096774196) internal successors, (458), 155 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 458 transitions. [2021-06-05 14:16:05,420 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 458 transitions. Word has length 16 [2021-06-05 14:16:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:05,420 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 458 transitions. [2021-06-05 14:16:05,420 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 458 transitions. [2021-06-05 14:16:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:05,421 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:05,421 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:16:05,421 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2021-06-05 14:16:05,421 INFO L430 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:05,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:05,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1814922516, now seen corresponding path program 34 times [2021-06-05 14:16:05,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:05,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064456037] [2021-06-05 14:16:05,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:05,452 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:05,452 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064456037] [2021-06-05 14:16:05,452 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064456037] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:05,452 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:05,452 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:05,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797809078] [2021-06-05 14:16:05,452 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:05,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:05,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:05,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:05,453 INFO L87 Difference]: Start difference. First operand 156 states and 458 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:05,540 INFO L93 Difference]: Finished difference Result 254 states and 704 transitions. [2021-06-05 14:16:05,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:05,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:05,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:05,541 INFO L225 Difference]: With dead ends: 254 [2021-06-05 14:16:05,541 INFO L226 Difference]: Without dead ends: 249 [2021-06-05 14:16:05,541 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 53.3ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-06-05 14:16:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 148. [2021-06-05 14:16:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.006802721088435) internal successors, (442), 147 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:16:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 442 transitions. [2021-06-05 14:16:05,544 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 442 transitions. Word has length 16 [2021-06-05 14:16:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:05,544 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 442 transitions. [2021-06-05 14:16:05,544 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 442 transitions. [2021-06-05 14:16:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:05,545 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:05,545 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:16:05,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2021-06-05 14:16:05,545 INFO L430 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:05,545 INFO L82 PathProgramCache]: Analyzing trace with hash 499376906, now seen corresponding path program 35 times [2021-06-05 14:16:05,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:05,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562422788] [2021-06-05 14:16:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:05,597 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:16:05,598 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:05,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562422788] [2021-06-05 14:16:05,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562422788] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:05,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785015982] [2021-06-05 14:16:05,598 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 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:16:05,631 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:05,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:05,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:05,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:05,707 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:16:05,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785015982] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:05,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:05,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 14:16:05,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309939260] [2021-06-05 14:16:05,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:16:05,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:16:05,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:05,709 INFO L87 Difference]: Start difference. First operand 148 states and 442 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:16:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:05,919 INFO L93 Difference]: Finished difference Result 297 states and 849 transitions. [2021-06-05 14:16:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:05,919 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 16 [2021-06-05 14:16:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:05,920 INFO L225 Difference]: With dead ends: 297 [2021-06-05 14:16:05,920 INFO L226 Difference]: Without dead ends: 297 [2021-06-05 14:16:05,920 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 181.0ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:16:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-06-05 14:16:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 156. [2021-06-05 14:16:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 3.109677419354839) internal successors, (482), 155 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 482 transitions. [2021-06-05 14:16:05,923 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 482 transitions. Word has length 16 [2021-06-05 14:16:05,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:05,924 INFO L482 AbstractCegarLoop]: Abstraction has 156 states and 482 transitions. [2021-06-05 14:16:05,924 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:16:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 482 transitions. [2021-06-05 14:16:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:05,924 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:05,924 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:16:06,136 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable299 [2021-06-05 14:16:06,137 INFO L430 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1694413080, now seen corresponding path program 35 times [2021-06-05 14:16:06,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:06,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069008348] [2021-06-05 14:16:06,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:06,178 INFO L134 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:16:06,179 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:06,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069008348] [2021-06-05 14:16:06,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069008348] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:06,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196612941] [2021-06-05 14:16:06,179 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 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:16:06,219 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:06,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:06,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:06,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:06,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:16:06,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196612941] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:06,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:06,287 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:06,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262445987] [2021-06-05 14:16:06,287 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:06,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:06,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:06,288 INFO L87 Difference]: Start difference. First operand 156 states and 482 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:16:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:06,405 INFO L93 Difference]: Finished difference Result 308 states and 850 transitions. [2021-06-05 14:16:06,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:06,405 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 16 [2021-06-05 14:16:06,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:06,406 INFO L225 Difference]: With dead ends: 308 [2021-06-05 14:16:06,406 INFO L226 Difference]: Without dead ends: 304 [2021-06-05 14:16:06,406 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 85.7ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:06,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-06-05 14:16:06,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 164. [2021-06-05 14:16:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 3.1104294478527605) internal successors, (507), 163 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:16:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 507 transitions. [2021-06-05 14:16:06,409 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 507 transitions. Word has length 16 [2021-06-05 14:16:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:06,409 INFO L482 AbstractCegarLoop]: Abstraction has 164 states and 507 transitions. [2021-06-05 14:16:06,409 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:16:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 507 transitions. [2021-06-05 14:16:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:06,410 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:06,410 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:16:06,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable300 [2021-06-05 14:16:06,632 INFO L430 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:06,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1171599110, now seen corresponding path program 36 times [2021-06-05 14:16:06,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:06,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737383025] [2021-06-05 14:16:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:06,707 INFO L134 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:16:06,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:06,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737383025] [2021-06-05 14:16:06,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737383025] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:06,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508172163] [2021-06-05 14:16:06,707 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 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:16:06,807 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:06,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:06,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:06,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:06,897 INFO L134 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:16:06,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508172163] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:06,897 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:06,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 14:16:06,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840160072] [2021-06-05 14:16:06,897 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:16:06,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:06,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:16:06,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:06,898 INFO L87 Difference]: Start difference. First operand 164 states and 507 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:16:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:07,073 INFO L93 Difference]: Finished difference Result 297 states and 840 transitions. [2021-06-05 14:16:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:07,074 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 16 [2021-06-05 14:16:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:07,074 INFO L225 Difference]: With dead ends: 297 [2021-06-05 14:16:07,074 INFO L226 Difference]: Without dead ends: 294 [2021-06-05 14:16:07,075 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 176.7ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:16:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-06-05 14:16:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 161. [2021-06-05 14:16:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.05625) internal successors, (489), 160 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 489 transitions. [2021-06-05 14:16:07,077 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 489 transitions. Word has length 16 [2021-06-05 14:16:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:07,077 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 489 transitions. [2021-06-05 14:16:07,077 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:16:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 489 transitions. [2021-06-05 14:16:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:07,077 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:07,077 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:16:07,278 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable303 [2021-06-05 14:16:07,278 INFO L430 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:07,278 INFO L82 PathProgramCache]: Analyzing trace with hash -245575666, now seen corresponding path program 36 times [2021-06-05 14:16:07,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:07,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20386334] [2021-06-05 14:16:07,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:07,360 INFO L134 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:16:07,361 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:07,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20386334] [2021-06-05 14:16:07,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20386334] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:07,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73597656] [2021-06-05 14:16:07,361 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 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:16:07,395 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:07,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:07,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:07,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:07,467 INFO L134 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:16:07,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73597656] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:07,468 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:07,468 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:07,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51868459] [2021-06-05 14:16:07,468 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:07,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:07,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:07,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:07,468 INFO L87 Difference]: Start difference. First operand 161 states and 489 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:16:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:07,574 INFO L93 Difference]: Finished difference Result 317 states and 873 transitions. [2021-06-05 14:16:07,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:07,575 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 16 [2021-06-05 14:16:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:07,576 INFO L225 Difference]: With dead ends: 317 [2021-06-05 14:16:07,576 INFO L226 Difference]: Without dead ends: 317 [2021-06-05 14:16:07,576 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 110.0ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-06-05 14:16:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 158. [2021-06-05 14:16:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.0573248407643314) internal successors, (480), 157 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 480 transitions. [2021-06-05 14:16:07,579 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 480 transitions. Word has length 16 [2021-06-05 14:16:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:07,579 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 480 transitions. [2021-06-05 14:16:07,579 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:16:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 480 transitions. [2021-06-05 14:16:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:07,579 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:07,580 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:16:07,789 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306,98 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:07,789 INFO L430 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:07,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:07,789 INFO L82 PathProgramCache]: Analyzing trace with hash 841960418, now seen corresponding path program 37 times [2021-06-05 14:16:07,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:07,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100874616] [2021-06-05 14:16:07,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:07,835 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:16:07,836 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:07,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100874616] [2021-06-05 14:16:07,836 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100874616] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:07,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562875338] [2021-06-05 14:16:07,836 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 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:16:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:07,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:07,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:07,920 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:16:07,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562875338] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:07,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:07,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:16:07,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428746902] [2021-06-05 14:16:07,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:16:07,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:07,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:16:07,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:07,922 INFO L87 Difference]: Start difference. First operand 158 states and 480 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:16:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:08,032 INFO L93 Difference]: Finished difference Result 295 states and 832 transitions. [2021-06-05 14:16:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:08,032 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 16 [2021-06-05 14:16:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:08,033 INFO L225 Difference]: With dead ends: 295 [2021-06-05 14:16:08,033 INFO L226 Difference]: Without dead ends: 295 [2021-06-05 14:16:08,033 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 79.0ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-06-05 14:16:08,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2021-06-05 14:16:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.069182389937107) internal successors, (488), 159 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 488 transitions. [2021-06-05 14:16:08,036 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 488 transitions. Word has length 16 [2021-06-05 14:16:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:08,036 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 488 transitions. [2021-06-05 14:16:08,036 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:16:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 488 transitions. [2021-06-05 14:16:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:08,037 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:08,037 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:16:08,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307,99 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:08,251 INFO L430 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:08,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:08,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1481293524, now seen corresponding path program 38 times [2021-06-05 14:16:08,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:08,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967193442] [2021-06-05 14:16:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:08,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:16:08,282 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:08,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967193442] [2021-06-05 14:16:08,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967193442] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:08,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524666159] [2021-06-05 14:16:08,282 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 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:16:08,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:08,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:08,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:08,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:08,378 INFO L134 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:16:08,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524666159] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:08,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:08,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:16:08,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851881427] [2021-06-05 14:16:08,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:16:08,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:16:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:08,379 INFO L87 Difference]: Start difference. First operand 160 states and 488 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:16:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:08,492 INFO L93 Difference]: Finished difference Result 273 states and 778 transitions. [2021-06-05 14:16:08,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:08,492 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 16 [2021-06-05 14:16:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:08,508 INFO L225 Difference]: With dead ends: 273 [2021-06-05 14:16:08,508 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 14:16:08,508 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 72.5ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:08,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 14:16:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 158. [2021-06-05 14:16:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 3.0573248407643314) internal successors, (480), 157 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 480 transitions. [2021-06-05 14:16:08,511 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 480 transitions. Word has length 16 [2021-06-05 14:16:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:08,511 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 480 transitions. [2021-06-05 14:16:08,511 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:16:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 480 transitions. [2021-06-05 14:16:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:08,512 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:08,512 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:16:08,740 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable308 [2021-06-05 14:16:08,741 INFO L430 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:08,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:08,741 INFO L82 PathProgramCache]: Analyzing trace with hash 952979406, now seen corresponding path program 37 times [2021-06-05 14:16:08,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:08,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389590554] [2021-06-05 14:16:08,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:08,787 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:16:08,787 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:08,787 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389590554] [2021-06-05 14:16:08,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389590554] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:08,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:08,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:08,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040963631] [2021-06-05 14:16:08,788 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:08,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:08,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:08,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:08,788 INFO L87 Difference]: Start difference. First operand 158 states and 480 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:08,907 INFO L93 Difference]: Finished difference Result 296 states and 795 transitions. [2021-06-05 14:16:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:08,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:08,908 INFO L225 Difference]: With dead ends: 296 [2021-06-05 14:16:08,908 INFO L226 Difference]: Without dead ends: 292 [2021-06-05 14:16:08,908 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 83.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-06-05 14:16:08,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 160. [2021-06-05 14:16:08,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0440251572327046) internal successors, (484), 159 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:16:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 484 transitions. [2021-06-05 14:16:08,911 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 484 transitions. Word has length 16 [2021-06-05 14:16:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:08,912 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 484 transitions. [2021-06-05 14:16:08,912 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 484 transitions. [2021-06-05 14:16:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:08,912 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:08,912 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:16:08,912 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2021-06-05 14:16:08,912 INFO L430 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:08,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:08,913 INFO L82 PathProgramCache]: Analyzing trace with hash 879606926, now seen corresponding path program 38 times [2021-06-05 14:16:08,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:08,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505062744] [2021-06-05 14:16:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:09,033 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:16:09,034 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:09,034 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505062744] [2021-06-05 14:16:09,034 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505062744] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:09,034 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:09,034 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:09,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959272112] [2021-06-05 14:16:09,034 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:09,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:09,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:09,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:09,035 INFO L87 Difference]: Start difference. First operand 160 states and 484 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:09,120 INFO L93 Difference]: Finished difference Result 279 states and 769 transitions. [2021-06-05 14:16:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:09,121 INFO L225 Difference]: With dead ends: 279 [2021-06-05 14:16:09,121 INFO L226 Difference]: Without dead ends: 276 [2021-06-05 14:16:09,121 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 110.5ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-06-05 14:16:09,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 159. [2021-06-05 14:16:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 3.0443037974683542) internal successors, (481), 158 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 481 transitions. [2021-06-05 14:16:09,124 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 481 transitions. Word has length 16 [2021-06-05 14:16:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:09,124 INFO L482 AbstractCegarLoop]: Abstraction has 159 states and 481 transitions. [2021-06-05 14:16:09,124 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 481 transitions. [2021-06-05 14:16:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:09,125 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:09,125 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:16:09,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2021-06-05 14:16:09,125 INFO L430 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:09,125 INFO L82 PathProgramCache]: Analyzing trace with hash 213900140, now seen corresponding path program 39 times [2021-06-05 14:16:09,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:09,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190305388] [2021-06-05 14:16:09,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:09,155 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:16:09,156 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:09,156 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190305388] [2021-06-05 14:16:09,156 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190305388] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:09,156 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:09,156 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:09,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97190098] [2021-06-05 14:16:09,156 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:09,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:09,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:09,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:09,157 INFO L87 Difference]: Start difference. First operand 159 states and 481 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:09,243 INFO L93 Difference]: Finished difference Result 259 states and 730 transitions. [2021-06-05 14:16:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:09,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:09,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:09,244 INFO L225 Difference]: With dead ends: 259 [2021-06-05 14:16:09,244 INFO L226 Difference]: Without dead ends: 256 [2021-06-05 14:16:09,244 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 50.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-06-05 14:16:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 161. [2021-06-05 14:16:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 3.03125) internal successors, (485), 160 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 485 transitions. [2021-06-05 14:16:09,247 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 485 transitions. Word has length 16 [2021-06-05 14:16:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:09,247 INFO L482 AbstractCegarLoop]: Abstraction has 161 states and 485 transitions. [2021-06-05 14:16:09,247 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 485 transitions. [2021-06-05 14:16:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:09,248 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:09,249 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:16:09,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2021-06-05 14:16:09,251 INFO L430 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:09,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:09,251 INFO L82 PathProgramCache]: Analyzing trace with hash -883427436, now seen corresponding path program 40 times [2021-06-05 14:16:09,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:09,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304243847] [2021-06-05 14:16:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:09,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:16:09,290 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:09,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304243847] [2021-06-05 14:16:09,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304243847] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:09,292 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:09,292 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:09,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364197233] [2021-06-05 14:16:09,293 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:09,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:09,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:09,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:09,295 INFO L87 Difference]: Start difference. First operand 161 states and 485 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:09,396 INFO L93 Difference]: Finished difference Result 245 states and 709 transitions. [2021-06-05 14:16:09,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:09,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:09,397 INFO L225 Difference]: With dead ends: 245 [2021-06-05 14:16:09,397 INFO L226 Difference]: Without dead ends: 242 [2021-06-05 14:16:09,399 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 60.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-06-05 14:16:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 160. [2021-06-05 14:16:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 3.0314465408805034) internal successors, (482), 159 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 482 transitions. [2021-06-05 14:16:09,405 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 482 transitions. Word has length 16 [2021-06-05 14:16:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:09,405 INFO L482 AbstractCegarLoop]: Abstraction has 160 states and 482 transitions. [2021-06-05 14:16:09,405 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:09,405 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 482 transitions. [2021-06-05 14:16:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:09,405 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:09,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:16:09,406 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2021-06-05 14:16:09,406 INFO L430 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:09,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:09,407 INFO L82 PathProgramCache]: Analyzing trace with hash 55906398, now seen corresponding path program 39 times [2021-06-05 14:16:09,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:09,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113530055] [2021-06-05 14:16:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:09,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:09,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113530055] [2021-06-05 14:16:09,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113530055] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:09,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888386005] [2021-06-05 14:16:09,447 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 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:16:09,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:16:09,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:09,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:09,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:09,549 INFO L134 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:16:09,549 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888386005] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:09,549 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:09,549 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:09,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840636419] [2021-06-05 14:16:09,550 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:09,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:09,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:09,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:09,550 INFO L87 Difference]: Start difference. First operand 160 states and 482 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:16:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:09,674 INFO L93 Difference]: Finished difference Result 285 states and 786 transitions. [2021-06-05 14:16:09,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:09,675 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 16 [2021-06-05 14:16:09,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:09,675 INFO L225 Difference]: With dead ends: 285 [2021-06-05 14:16:09,675 INFO L226 Difference]: Without dead ends: 285 [2021-06-05 14:16:09,675 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 95.7ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-06-05 14:16:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 158. [2021-06-05 14:16:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.9936305732484074) internal successors, (470), 157 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:16:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 470 transitions. [2021-06-05 14:16:09,678 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 470 transitions. Word has length 16 [2021-06-05 14:16:09,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:09,678 INFO L482 AbstractCegarLoop]: Abstraction has 158 states and 470 transitions. [2021-06-05 14:16:09,678 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:16:09,678 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 470 transitions. [2021-06-05 14:16:09,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:09,679 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:09,679 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:16:09,879 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315,101 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:09,879 INFO L430 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:09,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1417462504, now seen corresponding path program 40 times [2021-06-05 14:16:09,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:09,880 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330399657] [2021-06-05 14:16:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:09,919 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:16:09,919 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:09,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330399657] [2021-06-05 14:16:09,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330399657] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:09,919 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:09,919 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:09,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267871238] [2021-06-05 14:16:09,920 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:09,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:09,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:09,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:09,920 INFO L87 Difference]: Start difference. First operand 158 states and 470 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:10,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:10,013 INFO L93 Difference]: Finished difference Result 259 states and 722 transitions. [2021-06-05 14:16:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:10,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:10,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:10,014 INFO L225 Difference]: With dead ends: 259 [2021-06-05 14:16:10,014 INFO L226 Difference]: Without dead ends: 257 [2021-06-05 14:16:10,014 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.5ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-06-05 14:16:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 148. [2021-06-05 14:16:10,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.0136054421768708) internal successors, (443), 147 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:10,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 443 transitions. [2021-06-05 14:16:10,016 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 443 transitions. Word has length 16 [2021-06-05 14:16:10,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:10,016 INFO L482 AbstractCegarLoop]: Abstraction has 148 states and 443 transitions. [2021-06-05 14:16:10,016 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 443 transitions. [2021-06-05 14:16:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:10,017 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:10,017 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:16:10,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2021-06-05 14:16:10,017 INFO L430 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:10,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:10,017 INFO L82 PathProgramCache]: Analyzing trace with hash 105703180, now seen corresponding path program 41 times [2021-06-05 14:16:10,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:10,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600281635] [2021-06-05 14:16:10,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:10,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:10,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600281635] [2021-06-05 14:16:10,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600281635] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:10,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582423665] [2021-06-05 14:16:10,047 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:10,081 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:16:10,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:10,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:10,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:10,119 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:16:10,119 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582423665] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:10,119 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:10,119 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:16:10,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930596288] [2021-06-05 14:16:10,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:16:10,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:10,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:16:10,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:16:10,120 INFO L87 Difference]: Start difference. First operand 148 states and 443 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:16:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:10,214 INFO L93 Difference]: Finished difference Result 245 states and 701 transitions. [2021-06-05 14:16:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:10,215 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 16 [2021-06-05 14:16:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:10,215 INFO L225 Difference]: With dead ends: 245 [2021-06-05 14:16:10,215 INFO L226 Difference]: Without dead ends: 245 [2021-06-05 14:16:10,216 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 67.9ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-06-05 14:16:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 137. [2021-06-05 14:16:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.0220588235294117) internal successors, (411), 136 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 411 transitions. [2021-06-05 14:16:10,218 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 411 transitions. Word has length 16 [2021-06-05 14:16:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:10,218 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 411 transitions. [2021-06-05 14:16:10,218 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:16:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 411 transitions. [2021-06-05 14:16:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:10,219 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:10,219 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:16:10,442 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable317 [2021-06-05 14:16:10,442 INFO L430 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:10,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:10,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1387314302, now seen corresponding path program 42 times [2021-06-05 14:16:10,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:10,443 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911562708] [2021-06-05 14:16:10,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:10,485 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:16:10,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:10,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911562708] [2021-06-05 14:16:10,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911562708] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:10,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988683256] [2021-06-05 14:16:10,485 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 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:16:10,576 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:10,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:10,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:10,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:10,626 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:16:10,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988683256] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:10,627 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:10,627 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:16:10,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359404560] [2021-06-05 14:16:10,627 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:16:10,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:16:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:16:10,627 INFO L87 Difference]: Start difference. First operand 137 states and 411 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:16:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:10,776 INFO L93 Difference]: Finished difference Result 240 states and 665 transitions. [2021-06-05 14:16:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:10,776 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 16 [2021-06-05 14:16:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:10,776 INFO L225 Difference]: With dead ends: 240 [2021-06-05 14:16:10,776 INFO L226 Difference]: Without dead ends: 240 [2021-06-05 14:16:10,776 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 101.0ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-06-05 14:16:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 135. [2021-06-05 14:16:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.9776119402985075) internal successors, (399), 134 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 399 transitions. [2021-06-05 14:16:10,778 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 399 transitions. Word has length 16 [2021-06-05 14:16:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:10,778 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 399 transitions. [2021-06-05 14:16:10,778 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:16:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 399 transitions. [2021-06-05 14:16:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:10,779 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:10,779 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:16:10,979 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318,103 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:10,979 INFO L430 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:10,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:10,980 INFO L82 PathProgramCache]: Analyzing trace with hash -777157054, now seen corresponding path program 43 times [2021-06-05 14:16:10,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:10,980 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700680343] [2021-06-05 14:16:10,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:11,018 INFO L134 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:16:11,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:11,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700680343] [2021-06-05 14:16:11,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700680343] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:11,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666957003] [2021-06-05 14:16:11,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 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:16:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:11,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:11,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:11,237 INFO L134 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:16:11,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666957003] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:11,237 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:11,237 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:16:11,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269494306] [2021-06-05 14:16:11,238 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:16:11,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:11,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:16:11,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:16:11,238 INFO L87 Difference]: Start difference. First operand 135 states and 399 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:11,371 INFO L93 Difference]: Finished difference Result 216 states and 610 transitions. [2021-06-05 14:16:11,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:11,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:16:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:11,371 INFO L225 Difference]: With dead ends: 216 [2021-06-05 14:16:11,372 INFO L226 Difference]: Without dead ends: 214 [2021-06-05 14:16:11,372 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 75.7ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2021-06-05 14:16:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 125. [2021-06-05 14:16:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.9919354838709675) internal successors, (371), 124 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 371 transitions. [2021-06-05 14:16:11,374 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 371 transitions. Word has length 16 [2021-06-05 14:16:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:11,374 INFO L482 AbstractCegarLoop]: Abstraction has 125 states and 371 transitions. [2021-06-05 14:16:11,374 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 371 transitions. [2021-06-05 14:16:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:11,375 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:11,375 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:16:11,575 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable319 [2021-06-05 14:16:11,576 INFO L430 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:11,576 INFO L82 PathProgramCache]: Analyzing trace with hash 276142176, now seen corresponding path program 44 times [2021-06-05 14:16:11,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:11,576 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683595991] [2021-06-05 14:16:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:11,633 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:16:11,633 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:11,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683595991] [2021-06-05 14:16:11,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683595991] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:11,633 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612223892] [2021-06-05 14:16:11,633 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 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:16:11,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:11,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:11,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:11,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:11,720 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:16:11,720 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612223892] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:11,720 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:11,720 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:16:11,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670828291] [2021-06-05 14:16:11,720 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:16:11,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:16:11,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:11,721 INFO L87 Difference]: Start difference. First operand 125 states and 371 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:16:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:11,830 INFO L93 Difference]: Finished difference Result 197 states and 550 transitions. [2021-06-05 14:16:11,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:11,830 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 16 [2021-06-05 14:16:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:11,831 INFO L225 Difference]: With dead ends: 197 [2021-06-05 14:16:11,831 INFO L226 Difference]: Without dead ends: 197 [2021-06-05 14:16:11,831 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 91.3ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-06-05 14:16:11,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 129. [2021-06-05 14:16:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 3.0234375) internal successors, (387), 128 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 387 transitions. [2021-06-05 14:16:11,833 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 387 transitions. Word has length 16 [2021-06-05 14:16:11,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:11,833 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 387 transitions. [2021-06-05 14:16:11,833 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:16:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 387 transitions. [2021-06-05 14:16:11,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:11,833 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:11,834 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:16:12,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable322 [2021-06-05 14:16:12,058 INFO L430 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:12,058 INFO L82 PathProgramCache]: Analyzing trace with hash 886299424, now seen corresponding path program 45 times [2021-06-05 14:16:12,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:12,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474110843] [2021-06-05 14:16:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:12,087 INFO L134 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:16:12,088 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:12,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474110843] [2021-06-05 14:16:12,101 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474110843] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:12,101 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052529844] [2021-06-05 14:16:12,101 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:16:12,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:16:12,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:12,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:12,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:12,220 INFO L134 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:16:12,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052529844] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:12,220 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:12,220 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:16:12,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815457438] [2021-06-05 14:16:12,220 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:16:12,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:12,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:16:12,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:12,221 INFO L87 Difference]: Start difference. First operand 129 states and 387 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:12,367 INFO L93 Difference]: Finished difference Result 199 states and 552 transitions. [2021-06-05 14:16:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:12,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:16:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:12,368 INFO L225 Difference]: With dead ends: 199 [2021-06-05 14:16:12,368 INFO L226 Difference]: Without dead ends: 197 [2021-06-05 14:16:12,368 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 100.5ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-06-05 14:16:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 127. [2021-06-05 14:16:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 3.007936507936508) internal successors, (379), 126 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 379 transitions. [2021-06-05 14:16:12,370 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 379 transitions. Word has length 16 [2021-06-05 14:16:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:12,370 INFO L482 AbstractCegarLoop]: Abstraction has 127 states and 379 transitions. [2021-06-05 14:16:12,370 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 379 transitions. [2021-06-05 14:16:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:12,371 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:12,371 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:16:12,571 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable323 [2021-06-05 14:16:12,571 INFO L430 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1804249614, now seen corresponding path program 46 times [2021-06-05 14:16:12,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:12,572 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249874949] [2021-06-05 14:16:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:12,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:16:12,596 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:12,596 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249874949] [2021-06-05 14:16:12,596 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249874949] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:12,596 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022249451] [2021-06-05 14:16:12,596 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:16:12,622 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:16:12,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:12,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:12,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:12,663 INFO L134 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:16:12,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022249451] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:12,663 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:12,663 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:16:12,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296838423] [2021-06-05 14:16:12,663 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:16:12,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:12,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:16:12,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:16:12,664 INFO L87 Difference]: Start difference. First operand 127 states and 379 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:12,747 INFO L93 Difference]: Finished difference Result 178 states and 504 transitions. [2021-06-05 14:16:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:12,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:16:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:12,748 INFO L225 Difference]: With dead ends: 178 [2021-06-05 14:16:12,748 INFO L226 Difference]: Without dead ends: 174 [2021-06-05 14:16:12,748 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 59.1ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-06-05 14:16:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 124. [2021-06-05 14:16:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 3.016260162601626) internal successors, (371), 123 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 371 transitions. [2021-06-05 14:16:12,750 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 371 transitions. Word has length 16 [2021-06-05 14:16:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:12,750 INFO L482 AbstractCegarLoop]: Abstraction has 124 states and 371 transitions. [2021-06-05 14:16:12,750 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 371 transitions. [2021-06-05 14:16:12,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:12,750 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:12,751 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:16:12,953 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326,107 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:12,953 INFO L430 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:12,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:12,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1122947330, now seen corresponding path program 41 times [2021-06-05 14:16:12,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:12,954 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354159130] [2021-06-05 14:16:12,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:12,982 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:16:12,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:12,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354159130] [2021-06-05 14:16:12,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354159130] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:12,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:12,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:12,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786597670] [2021-06-05 14:16:12,983 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:12,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:12,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:12,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:12,983 INFO L87 Difference]: Start difference. First operand 124 states and 371 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:13,076 INFO L93 Difference]: Finished difference Result 187 states and 507 transitions. [2021-06-05 14:16:13,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:13,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:13,076 INFO L225 Difference]: With dead ends: 187 [2021-06-05 14:16:13,076 INFO L226 Difference]: Without dead ends: 177 [2021-06-05 14:16:13,077 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 56.6ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-06-05 14:16:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 128. [2021-06-05 14:16:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.968503937007874) internal successors, (377), 127 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 377 transitions. [2021-06-05 14:16:13,079 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 377 transitions. Word has length 16 [2021-06-05 14:16:13,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:13,079 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 377 transitions. [2021-06-05 14:16:13,079 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 377 transitions. [2021-06-05 14:16:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:13,079 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:13,079 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:16:13,079 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2021-06-05 14:16:13,079 INFO L430 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:13,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:13,080 INFO L82 PathProgramCache]: Analyzing trace with hash -701314238, now seen corresponding path program 42 times [2021-06-05 14:16:13,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:13,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747949824] [2021-06-05 14:16:13,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:13,136 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:16:13,137 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:13,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747949824] [2021-06-05 14:16:13,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747949824] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:13,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:13,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:13,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759129666] [2021-06-05 14:16:13,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:13,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:13,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:13,138 INFO L87 Difference]: Start difference. First operand 128 states and 377 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:13,248 INFO L93 Difference]: Finished difference Result 195 states and 514 transitions. [2021-06-05 14:16:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:13,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:13,249 INFO L225 Difference]: With dead ends: 195 [2021-06-05 14:16:13,249 INFO L226 Difference]: Without dead ends: 191 [2021-06-05 14:16:13,249 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 71.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-06-05 14:16:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 134. [2021-06-05 14:16:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.924812030075188) internal successors, (389), 133 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 389 transitions. [2021-06-05 14:16:13,256 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 389 transitions. Word has length 16 [2021-06-05 14:16:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:13,256 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 389 transitions. [2021-06-05 14:16:13,256 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,256 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 389 transitions. [2021-06-05 14:16:13,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:13,257 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:13,257 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:16:13,257 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2021-06-05 14:16:13,257 INFO L430 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:13,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:13,257 INFO L82 PathProgramCache]: Analyzing trace with hash -774686718, now seen corresponding path program 43 times [2021-06-05 14:16:13,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:13,257 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476929171] [2021-06-05 14:16:13,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:13,303 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:16:13,304 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:13,304 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476929171] [2021-06-05 14:16:13,304 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476929171] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:13,304 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:13,304 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:13,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904573943] [2021-06-05 14:16:13,304 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:13,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:13,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:13,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:13,305 INFO L87 Difference]: Start difference. First operand 134 states and 389 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:13,390 INFO L93 Difference]: Finished difference Result 180 states and 492 transitions. [2021-06-05 14:16:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:13,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:13,391 INFO L225 Difference]: With dead ends: 180 [2021-06-05 14:16:13,391 INFO L226 Difference]: Without dead ends: 175 [2021-06-05 14:16:13,391 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 62.3ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-06-05 14:16:13,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 126. [2021-06-05 14:16:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.984) internal successors, (373), 125 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 373 transitions. [2021-06-05 14:16:13,393 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 373 transitions. Word has length 16 [2021-06-05 14:16:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:13,393 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 373 transitions. [2021-06-05 14:16:13,393 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 373 transitions. [2021-06-05 14:16:13,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:13,393 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:13,393 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:16:13,393 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2021-06-05 14:16:13,394 INFO L430 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:13,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:13,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1714006770, now seen corresponding path program 44 times [2021-06-05 14:16:13,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:13,398 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444043498] [2021-06-05 14:16:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:13,446 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:16:13,446 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:13,446 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444043498] [2021-06-05 14:16:13,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444043498] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:13,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:13,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:13,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688816310] [2021-06-05 14:16:13,447 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:13,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:13,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:13,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:13,447 INFO L87 Difference]: Start difference. First operand 126 states and 373 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:13,525 INFO L93 Difference]: Finished difference Result 178 states and 483 transitions. [2021-06-05 14:16:13,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:13,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:13,526 INFO L225 Difference]: With dead ends: 178 [2021-06-05 14:16:13,526 INFO L226 Difference]: Without dead ends: 174 [2021-06-05 14:16:13,526 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 66.0ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-06-05 14:16:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 134. [2021-06-05 14:16:13,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.9323308270676693) internal successors, (390), 133 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:16:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 390 transitions. [2021-06-05 14:16:13,528 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 390 transitions. Word has length 16 [2021-06-05 14:16:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:13,528 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 390 transitions. [2021-06-05 14:16:13,528 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,528 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 390 transitions. [2021-06-05 14:16:13,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:13,528 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:13,528 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:16:13,528 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2021-06-05 14:16:13,528 INFO L430 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:13,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:13,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1787379250, now seen corresponding path program 45 times [2021-06-05 14:16:13,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:13,529 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860165128] [2021-06-05 14:16:13,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:13,556 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:16:13,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:13,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860165128] [2021-06-05 14:16:13,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860165128] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:13,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:13,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:13,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298609240] [2021-06-05 14:16:13,557 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:13,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:13,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:13,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:13,557 INFO L87 Difference]: Start difference. First operand 134 states and 390 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:13,660 INFO L93 Difference]: Finished difference Result 176 states and 480 transitions. [2021-06-05 14:16:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:13,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:13,661 INFO L225 Difference]: With dead ends: 176 [2021-06-05 14:16:13,661 INFO L226 Difference]: Without dead ends: 173 [2021-06-05 14:16:13,661 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 59.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-06-05 14:16:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 133. [2021-06-05 14:16:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9318181818181817) internal successors, (387), 132 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 387 transitions. [2021-06-05 14:16:13,663 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 387 transitions. Word has length 16 [2021-06-05 14:16:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:13,663 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 387 transitions. [2021-06-05 14:16:13,663 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 387 transitions. [2021-06-05 14:16:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:13,663 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:13,663 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:16:13,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2021-06-05 14:16:13,664 INFO L430 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:13,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1784753474, now seen corresponding path program 46 times [2021-06-05 14:16:13,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:13,664 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828380577] [2021-06-05 14:16:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:13,692 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:16:13,692 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:13,692 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828380577] [2021-06-05 14:16:13,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828380577] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:13,692 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:13,692 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:13,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74760112] [2021-06-05 14:16:13,693 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:13,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:13,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:13,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:13,693 INFO L87 Difference]: Start difference. First operand 133 states and 387 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:13,769 INFO L93 Difference]: Finished difference Result 162 states and 458 transitions. [2021-06-05 14:16:13,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:13,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:13,770 INFO L225 Difference]: With dead ends: 162 [2021-06-05 14:16:13,770 INFO L226 Difference]: Without dead ends: 155 [2021-06-05 14:16:13,770 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 55.4ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-06-05 14:16:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 124. [2021-06-05 14:16:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 3.0) internal successors, (369), 123 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 369 transitions. [2021-06-05 14:16:13,772 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 369 transitions. Word has length 16 [2021-06-05 14:16:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:13,797 INFO L482 AbstractCegarLoop]: Abstraction has 124 states and 369 transitions. [2021-06-05 14:16:13,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 369 transitions. [2021-06-05 14:16:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:13,797 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:13,797 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:16:13,797 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2021-06-05 14:16:13,797 INFO L430 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash -829320514, now seen corresponding path program 47 times [2021-06-05 14:16:13,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:13,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308062809] [2021-06-05 14:16:13,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:13,861 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:16:13,861 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:13,861 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308062809] [2021-06-05 14:16:13,861 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308062809] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:13,862 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345605876] [2021-06-05 14:16:13,862 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 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:16:13,928 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:13,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:13,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:13,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:14,020 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:16:14,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345605876] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:14,021 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:14,021 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 14:16:14,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571910902] [2021-06-05 14:16:14,021 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:16:14,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:14,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:16:14,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:14,021 INFO L87 Difference]: Start difference. First operand 124 states and 369 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:16:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:14,191 INFO L93 Difference]: Finished difference Result 206 states and 593 transitions. [2021-06-05 14:16:14,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:14,191 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 16 [2021-06-05 14:16:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:14,192 INFO L225 Difference]: With dead ends: 206 [2021-06-05 14:16:14,192 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 14:16:14,192 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 178.1ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:16:14,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 14:16:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 134. [2021-06-05 14:16:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1503759398496243) internal successors, (419), 133 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 419 transitions. [2021-06-05 14:16:14,195 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 419 transitions. Word has length 16 [2021-06-05 14:16:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:14,195 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 419 transitions. [2021-06-05 14:16:14,195 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:16:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 419 transitions. [2021-06-05 14:16:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:14,195 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:14,195 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:16:14,404 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable335 [2021-06-05 14:16:14,405 INFO L430 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:14,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:14,405 INFO L82 PathProgramCache]: Analyzing trace with hash 365715660, now seen corresponding path program 47 times [2021-06-05 14:16:14,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:14,405 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561404449] [2021-06-05 14:16:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:14,443 INFO L134 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:16:14,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:14,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561404449] [2021-06-05 14:16:14,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561404449] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:14,444 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998184086] [2021-06-05 14:16:14,444 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:16:14,475 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:14,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:14,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:14,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:14,547 INFO L134 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:16:14,547 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998184086] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:14,547 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:14,547 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:14,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614916261] [2021-06-05 14:16:14,547 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:14,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:14,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:14,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:14,548 INFO L87 Difference]: Start difference. First operand 134 states and 419 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:16:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:14,664 INFO L93 Difference]: Finished difference Result 228 states and 642 transitions. [2021-06-05 14:16:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:14,665 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 16 [2021-06-05 14:16:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:14,665 INFO L225 Difference]: With dead ends: 228 [2021-06-05 14:16:14,665 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 14:16:14,665 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 92.6ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 14:16:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 143. [2021-06-05 14:16:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.1619718309859155) internal successors, (449), 142 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 449 transitions. [2021-06-05 14:16:14,668 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 449 transitions. Word has length 16 [2021-06-05 14:16:14,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:14,668 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 449 transitions. [2021-06-05 14:16:14,668 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:16:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 449 transitions. [2021-06-05 14:16:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:14,669 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:14,669 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:16:14,869 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336,109 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:14,869 INFO L430 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:14,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1794670766, now seen corresponding path program 48 times [2021-06-05 14:16:14,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:14,870 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198922504] [2021-06-05 14:16:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:14,923 INFO L134 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:16:14,924 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:14,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198922504] [2021-06-05 14:16:14,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198922504] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:14,924 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037675827] [2021-06-05 14:16:14,924 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 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:16:14,957 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:14,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:14,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:14,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:15,048 INFO L134 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:16:15,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037675827] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:15,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:15,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 14:16:15,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657084829] [2021-06-05 14:16:15,049 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:16:15,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:15,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:16:15,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:15,049 INFO L87 Difference]: Start difference. First operand 143 states and 449 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:16:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:15,254 INFO L93 Difference]: Finished difference Result 204 states and 583 transitions. [2021-06-05 14:16:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:15,255 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 16 [2021-06-05 14:16:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:15,255 INFO L225 Difference]: With dead ends: 204 [2021-06-05 14:16:15,255 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 14:16:15,255 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 165.7ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:16:15,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 14:16:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 146. [2021-06-05 14:16:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 3.117241379310345) internal successors, (452), 145 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:16:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 452 transitions. [2021-06-05 14:16:15,258 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 452 transitions. Word has length 16 [2021-06-05 14:16:15,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:15,258 INFO L482 AbstractCegarLoop]: Abstraction has 146 states and 452 transitions. [2021-06-05 14:16:15,258 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:16:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 452 transitions. [2021-06-05 14:16:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:15,259 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:15,259 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:16:15,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable339 [2021-06-05 14:16:15,469 INFO L430 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:15,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:15,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1574273086, now seen corresponding path program 48 times [2021-06-05 14:16:15,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:15,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560836672] [2021-06-05 14:16:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:15,518 INFO L134 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:16:15,518 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:15,519 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560836672] [2021-06-05 14:16:15,519 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560836672] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:15,524 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380050165] [2021-06-05 14:16:15,525 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:16:15,564 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:15,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:15,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:15,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:15,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380050165] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:15,660 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:15,660 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:15,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563480095] [2021-06-05 14:16:15,677 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:15,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:15,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:15,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:15,678 INFO L87 Difference]: Start difference. First operand 146 states and 452 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:16:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:15,796 INFO L93 Difference]: Finished difference Result 237 states and 668 transitions. [2021-06-05 14:16:15,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:15,797 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 16 [2021-06-05 14:16:15,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:15,797 INFO L225 Difference]: With dead ends: 237 [2021-06-05 14:16:15,797 INFO L226 Difference]: Without dead ends: 237 [2021-06-05 14:16:15,798 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 97.5ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-06-05 14:16:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 143. [2021-06-05 14:16:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.119718309859155) internal successors, (443), 142 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 443 transitions. [2021-06-05 14:16:15,800 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 443 transitions. Word has length 16 [2021-06-05 14:16:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:15,801 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 443 transitions. [2021-06-05 14:16:15,801 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:16:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 443 transitions. [2021-06-05 14:16:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:15,801 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:15,801 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:16:16,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable342 [2021-06-05 14:16:16,024 INFO L430 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:16,025 INFO L82 PathProgramCache]: Analyzing trace with hash -486737002, now seen corresponding path program 49 times [2021-06-05 14:16:16,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:16,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082235767] [2021-06-05 14:16:16,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:16,066 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:16:16,066 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:16,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082235767] [2021-06-05 14:16:16,066 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082235767] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:16,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394341627] [2021-06-05 14:16:16,066 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 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:16:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:16,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:16,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:16,173 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:16:16,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394341627] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:16,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:16,173 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:16,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175964307] [2021-06-05 14:16:16,174 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:16,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:16,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:16,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:16,174 INFO L87 Difference]: Start difference. First operand 143 states and 443 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:16:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:16,248 INFO L93 Difference]: Finished difference Result 241 states and 680 transitions. [2021-06-05 14:16:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:16,248 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 16 [2021-06-05 14:16:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:16,249 INFO L225 Difference]: With dead ends: 241 [2021-06-05 14:16:16,249 INFO L226 Difference]: Without dead ends: 241 [2021-06-05 14:16:16,249 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 78.2ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:16,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-06-05 14:16:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 145. [2021-06-05 14:16:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.1319444444444446) internal successors, (451), 144 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 451 transitions. [2021-06-05 14:16:16,251 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 451 transitions. Word has length 16 [2021-06-05 14:16:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:16,251 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 451 transitions. [2021-06-05 14:16:16,251 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:16:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 451 transitions. [2021-06-05 14:16:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:16,251 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:16,251 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:16:16,475 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable343 [2021-06-05 14:16:16,475 INFO L430 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:16,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:16,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1484976352, now seen corresponding path program 50 times [2021-06-05 14:16:16,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:16,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087377592] [2021-06-05 14:16:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:16,503 INFO L134 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:16:16,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:16,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087377592] [2021-06-05 14:16:16,503 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087377592] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:16,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189655246] [2021-06-05 14:16:16,503 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 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:16:16,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:16,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:16,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:16,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:16,667 INFO L134 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:16:16,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189655246] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:16,668 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:16,668 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:16,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633622327] [2021-06-05 14:16:16,668 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:16,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:16,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:16,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:16,668 INFO L87 Difference]: Start difference. First operand 145 states and 451 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:16:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:16,748 INFO L93 Difference]: Finished difference Result 219 states and 626 transitions. [2021-06-05 14:16:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:16,748 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 16 [2021-06-05 14:16:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:16,749 INFO L225 Difference]: With dead ends: 219 [2021-06-05 14:16:16,749 INFO L226 Difference]: Without dead ends: 217 [2021-06-05 14:16:16,749 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-06-05 14:16:16,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 143. [2021-06-05 14:16:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.119718309859155) internal successors, (443), 142 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 443 transitions. [2021-06-05 14:16:16,751 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 443 transitions. Word has length 16 [2021-06-05 14:16:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:16,751 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 443 transitions. [2021-06-05 14:16:16,751 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:16:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 443 transitions. [2021-06-05 14:16:16,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:16,751 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:16,751 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:16:16,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable344 [2021-06-05 14:16:16,952 INFO L430 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:16,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:16,952 INFO L82 PathProgramCache]: Analyzing trace with hash -375718014, now seen corresponding path program 49 times [2021-06-05 14:16:16,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:16,953 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020549402] [2021-06-05 14:16:16,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:17,024 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:16:17,024 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:17,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020549402] [2021-06-05 14:16:17,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020549402] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:17,024 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:17,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:17,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192415755] [2021-06-05 14:16:17,025 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:17,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:17,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:17,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:17,025 INFO L87 Difference]: Start difference. First operand 143 states and 443 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:17,106 INFO L93 Difference]: Finished difference Result 252 states and 683 transitions. [2021-06-05 14:16:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:17,107 INFO L225 Difference]: With dead ends: 252 [2021-06-05 14:16:17,107 INFO L226 Difference]: Without dead ends: 248 [2021-06-05 14:16:17,107 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-06-05 14:16:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 145. [2021-06-05 14:16:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.1041666666666665) internal successors, (447), 144 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 447 transitions. [2021-06-05 14:16:17,109 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 447 transitions. Word has length 16 [2021-06-05 14:16:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:17,109 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 447 transitions. [2021-06-05 14:16:17,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 447 transitions. [2021-06-05 14:16:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:17,110 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:17,110 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:16:17,110 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2021-06-05 14:16:17,110 INFO L430 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:17,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:17,110 INFO L82 PathProgramCache]: Analyzing trace with hash -449090494, now seen corresponding path program 50 times [2021-06-05 14:16:17,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:17,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730070515] [2021-06-05 14:16:17,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:17,144 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:17,144 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730070515] [2021-06-05 14:16:17,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730070515] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:17,145 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:17,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:17,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007495915] [2021-06-05 14:16:17,145 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:17,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:17,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:17,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:17,145 INFO L87 Difference]: Start difference. First operand 145 states and 447 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:17,244 INFO L93 Difference]: Finished difference Result 235 states and 657 transitions. [2021-06-05 14:16:17,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:17,245 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:17,245 INFO L225 Difference]: With dead ends: 235 [2021-06-05 14:16:17,245 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 14:16:17,245 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 55.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 14:16:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 144. [2021-06-05 14:16:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 3.104895104895105) internal successors, (444), 143 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 444 transitions. [2021-06-05 14:16:17,248 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 444 transitions. Word has length 16 [2021-06-05 14:16:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:17,248 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 444 transitions. [2021-06-05 14:16:17,248 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 444 transitions. [2021-06-05 14:16:17,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:17,248 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:17,248 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:16:17,249 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2021-06-05 14:16:17,249 INFO L430 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:17,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:17,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1114797280, now seen corresponding path program 51 times [2021-06-05 14:16:17,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:17,249 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810480011] [2021-06-05 14:16:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:17,283 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:16:17,283 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:17,283 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810480011] [2021-06-05 14:16:17,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810480011] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:17,284 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:17,284 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:17,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801100632] [2021-06-05 14:16:17,284 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:17,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:17,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:17,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:17,284 INFO L87 Difference]: Start difference. First operand 144 states and 444 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:17,399 INFO L93 Difference]: Finished difference Result 221 states and 606 transitions. [2021-06-05 14:16:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:17,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:17,399 INFO L225 Difference]: With dead ends: 221 [2021-06-05 14:16:17,400 INFO L226 Difference]: Without dead ends: 218 [2021-06-05 14:16:17,400 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 85.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-06-05 14:16:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 146. [2021-06-05 14:16:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 3.089655172413793) internal successors, (448), 145 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 448 transitions. [2021-06-05 14:16:17,402 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 448 transitions. Word has length 16 [2021-06-05 14:16:17,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:17,402 INFO L482 AbstractCegarLoop]: Abstraction has 146 states and 448 transitions. [2021-06-05 14:16:17,403 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 448 transitions. [2021-06-05 14:16:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:17,403 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:17,403 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:16:17,403 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2021-06-05 14:16:17,403 INFO L430 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:17,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2082842440, now seen corresponding path program 52 times [2021-06-05 14:16:17,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:17,404 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258502573] [2021-06-05 14:16:17,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:17,438 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:16:17,438 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:17,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258502573] [2021-06-05 14:16:17,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258502573] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:17,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:17,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:17,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566509385] [2021-06-05 14:16:17,439 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:17,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:17,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:17,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:17,439 INFO L87 Difference]: Start difference. First operand 146 states and 448 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:17,551 INFO L93 Difference]: Finished difference Result 207 states and 585 transitions. [2021-06-05 14:16:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:17,552 INFO L225 Difference]: With dead ends: 207 [2021-06-05 14:16:17,552 INFO L226 Difference]: Without dead ends: 204 [2021-06-05 14:16:17,552 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 84.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-06-05 14:16:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 145. [2021-06-05 14:16:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.0902777777777777) internal successors, (445), 144 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:17,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 445 transitions. [2021-06-05 14:16:17,554 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 445 transitions. Word has length 16 [2021-06-05 14:16:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:17,554 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 445 transitions. [2021-06-05 14:16:17,555 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 445 transitions. [2021-06-05 14:16:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:17,555 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:17,555 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:16:17,555 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2021-06-05 14:16:17,555 INFO L430 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1272791022, now seen corresponding path program 51 times [2021-06-05 14:16:17,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:17,556 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283975567] [2021-06-05 14:16:17,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:17,697 INFO L134 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:16:17,697 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:17,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283975567] [2021-06-05 14:16:17,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283975567] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:17,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608894666] [2021-06-05 14:16:17,701 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 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:16:17,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:16:17,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:17,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:17,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:17,814 INFO L134 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:16:17,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608894666] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:17,815 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:17,815 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:17,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830962240] [2021-06-05 14:16:17,815 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:17,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:17,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:17,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:17,816 INFO L87 Difference]: Start difference. First operand 145 states and 445 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:16:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:17,931 INFO L93 Difference]: Finished difference Result 271 states and 747 transitions. [2021-06-05 14:16:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:17,932 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 16 [2021-06-05 14:16:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:17,932 INFO L225 Difference]: With dead ends: 271 [2021-06-05 14:16:17,932 INFO L226 Difference]: Without dead ends: 271 [2021-06-05 14:16:17,932 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 145.0ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-06-05 14:16:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 147. [2021-06-05 14:16:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 3.1027397260273974) internal successors, (453), 146 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 453 transitions. [2021-06-05 14:16:17,935 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 453 transitions. Word has length 16 [2021-06-05 14:16:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:17,935 INFO L482 AbstractCegarLoop]: Abstraction has 147 states and 453 transitions. [2021-06-05 14:16:17,935 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:16:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 453 transitions. [2021-06-05 14:16:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:17,936 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:17,936 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:16:18,150 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351,114 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:18,151 INFO L430 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:18,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash 88765084, now seen corresponding path program 52 times [2021-06-05 14:16:18,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:18,151 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114306186] [2021-06-05 14:16:18,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:18,193 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:16:18,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:18,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114306186] [2021-06-05 14:16:18,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114306186] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:18,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:18,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:18,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510405359] [2021-06-05 14:16:18,194 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:18,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:18,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:18,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:18,194 INFO L87 Difference]: Start difference. First operand 147 states and 453 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:18,284 INFO L93 Difference]: Finished difference Result 245 states and 683 transitions. [2021-06-05 14:16:18,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:18,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:18,285 INFO L225 Difference]: With dead ends: 245 [2021-06-05 14:16:18,285 INFO L226 Difference]: Without dead ends: 243 [2021-06-05 14:16:18,285 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 51.9ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-06-05 14:16:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 144. [2021-06-05 14:16:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 3.090909090909091) internal successors, (442), 143 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:16:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 442 transitions. [2021-06-05 14:16:18,288 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 442 transitions. Word has length 16 [2021-06-05 14:16:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:18,288 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 442 transitions. [2021-06-05 14:16:18,288 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 442 transitions. [2021-06-05 14:16:18,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:18,288 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:18,288 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:16:18,288 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2021-06-05 14:16:18,289 INFO L430 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:18,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1701446174, now seen corresponding path program 53 times [2021-06-05 14:16:18,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:18,289 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254944669] [2021-06-05 14:16:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:18,365 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:16:18,365 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:18,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254944669] [2021-06-05 14:16:18,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254944669] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:18,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537015922] [2021-06-05 14:16:18,365 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 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:16:18,447 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:16:18,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:18,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:18,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:18,508 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:16:18,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537015922] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:18,509 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:18,509 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:18,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021984983] [2021-06-05 14:16:18,509 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:18,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:18,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:18,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:18,510 INFO L87 Difference]: Start difference. First operand 144 states and 442 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:16:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:18,614 INFO L93 Difference]: Finished difference Result 215 states and 605 transitions. [2021-06-05 14:16:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:18,615 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 16 [2021-06-05 14:16:18,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:18,615 INFO L225 Difference]: With dead ends: 215 [2021-06-05 14:16:18,615 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 14:16:18,615 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 101.7ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 14:16:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 143. [2021-06-05 14:16:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 3.0492957746478875) internal successors, (433), 142 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 433 transitions. [2021-06-05 14:16:18,617 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 433 transitions. Word has length 16 [2021-06-05 14:16:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:18,617 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 433 transitions. [2021-06-05 14:16:18,617 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:16:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 433 transitions. [2021-06-05 14:16:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:18,618 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:18,618 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:16:18,818 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353,115 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:18,818 INFO L430 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:18,819 INFO L82 PathProgramCache]: Analyzing trace with hash -621807768, now seen corresponding path program 54 times [2021-06-05 14:16:18,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:18,819 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647049305] [2021-06-05 14:16:18,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:18,853 INFO L134 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:16:18,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:18,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647049305] [2021-06-05 14:16:18,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647049305] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:18,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177626021] [2021-06-05 14:16:18,853 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 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:16:18,884 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:18,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:18,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:18,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:18,960 INFO L134 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:16:18,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177626021] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:18,960 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:18,960 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:18,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610204494] [2021-06-05 14:16:18,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:18,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:18,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:18,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:18,961 INFO L87 Difference]: Start difference. First operand 143 states and 433 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:16:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:19,066 INFO L93 Difference]: Finished difference Result 206 states and 578 transitions. [2021-06-05 14:16:19,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:19,066 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 16 [2021-06-05 14:16:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:19,066 INFO L225 Difference]: With dead ends: 206 [2021-06-05 14:16:19,067 INFO L226 Difference]: Without dead ends: 204 [2021-06-05 14:16:19,067 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 94.4ms TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-06-05 14:16:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 137. [2021-06-05 14:16:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.0661764705882355) internal successors, (417), 136 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 417 transitions. [2021-06-05 14:16:19,069 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 417 transitions. Word has length 16 [2021-06-05 14:16:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:19,069 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 417 transitions. [2021-06-05 14:16:19,070 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:16:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 417 transitions. [2021-06-05 14:16:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:19,070 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:19,070 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:16:19,289 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable354 [2021-06-05 14:16:19,289 INFO L430 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:19,289 INFO L82 PathProgramCache]: Analyzing trace with hash -239087380, now seen corresponding path program 55 times [2021-06-05 14:16:19,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:19,290 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833734093] [2021-06-05 14:16:19,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:19,323 INFO L134 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:16:19,323 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:19,323 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833734093] [2021-06-05 14:16:19,323 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833734093] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:19,323 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209951400] [2021-06-05 14:16:19,323 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 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:16:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:19,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:19,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:19,407 INFO L134 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:16:19,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209951400] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:19,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:19,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:16:19,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445943437] [2021-06-05 14:16:19,407 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:16:19,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:19,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:16:19,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:19,408 INFO L87 Difference]: Start difference. First operand 137 states and 417 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:16:19,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:19,499 INFO L93 Difference]: Finished difference Result 185 states and 529 transitions. [2021-06-05 14:16:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:19,500 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 16 [2021-06-05 14:16:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:19,500 INFO L225 Difference]: With dead ends: 185 [2021-06-05 14:16:19,500 INFO L226 Difference]: Without dead ends: 181 [2021-06-05 14:16:19,500 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 73.5ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-06-05 14:16:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 135. [2021-06-05 14:16:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 3.0522388059701493) internal successors, (409), 134 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 409 transitions. [2021-06-05 14:16:19,503 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 409 transitions. Word has length 16 [2021-06-05 14:16:19,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:19,503 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 409 transitions. [2021-06-05 14:16:19,503 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:16:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 409 transitions. [2021-06-05 14:16:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:19,503 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:19,503 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:16:19,706 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357,117 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:19,706 INFO L430 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:19,706 INFO L82 PathProgramCache]: Analyzing trace with hash 212027308, now seen corresponding path program 53 times [2021-06-05 14:16:19,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:19,706 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341652839] [2021-06-05 14:16:19,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:19,735 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:16:19,736 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:19,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341652839] [2021-06-05 14:16:19,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341652839] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:19,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:19,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:19,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117015770] [2021-06-05 14:16:19,736 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:19,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:19,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:19,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:19,737 INFO L87 Difference]: Start difference. First operand 135 states and 409 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:19,817 INFO L93 Difference]: Finished difference Result 213 states and 580 transitions. [2021-06-05 14:16:19,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:19,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:19,818 INFO L225 Difference]: With dead ends: 213 [2021-06-05 14:16:19,818 INFO L226 Difference]: Without dead ends: 209 [2021-06-05 14:16:19,818 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 52.0ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-06-05 14:16:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 139. [2021-06-05 14:16:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.028985507246377) internal successors, (418), 138 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:16:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 418 transitions. [2021-06-05 14:16:19,820 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 418 transitions. Word has length 16 [2021-06-05 14:16:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:19,821 INFO L482 AbstractCegarLoop]: Abstraction has 139 states and 418 transitions. [2021-06-05 14:16:19,821 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 418 transitions. [2021-06-05 14:16:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:19,821 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:19,821 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:16:19,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2021-06-05 14:16:19,821 INFO L430 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:19,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:19,821 INFO L82 PathProgramCache]: Analyzing trace with hash 138654828, now seen corresponding path program 54 times [2021-06-05 14:16:19,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:19,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233487747] [2021-06-05 14:16:19,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:19,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:16:19,860 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:19,860 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233487747] [2021-06-05 14:16:19,860 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233487747] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:19,860 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:19,860 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:19,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443586999] [2021-06-05 14:16:19,860 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:19,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:19,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:19,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:19,861 INFO L87 Difference]: Start difference. First operand 139 states and 418 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:19,948 INFO L93 Difference]: Finished difference Result 211 states and 577 transitions. [2021-06-05 14:16:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:19,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:19,949 INFO L225 Difference]: With dead ends: 211 [2021-06-05 14:16:19,949 INFO L226 Difference]: Without dead ends: 208 [2021-06-05 14:16:19,949 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 54.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:19,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-06-05 14:16:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 137. [2021-06-05 14:16:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.036764705882353) internal successors, (413), 136 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 413 transitions. [2021-06-05 14:16:19,951 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 413 transitions. Word has length 16 [2021-06-05 14:16:19,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:19,951 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 413 transitions. [2021-06-05 14:16:19,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:19,951 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 413 transitions. [2021-06-05 14:16:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:19,952 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:19,952 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:16:19,952 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2021-06-05 14:16:19,952 INFO L430 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:19,952 INFO L82 PathProgramCache]: Analyzing trace with hash 141280604, now seen corresponding path program 55 times [2021-06-05 14:16:19,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:19,952 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347445309] [2021-06-05 14:16:19,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:19,977 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:16:19,978 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:19,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347445309] [2021-06-05 14:16:19,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347445309] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:19,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:19,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:19,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892745385] [2021-06-05 14:16:19,978 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:19,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:19,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:19,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:19,979 INFO L87 Difference]: Start difference. First operand 137 states and 413 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:20,057 INFO L93 Difference]: Finished difference Result 199 states and 559 transitions. [2021-06-05 14:16:20,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:20,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:20,057 INFO L225 Difference]: With dead ends: 199 [2021-06-05 14:16:20,057 INFO L226 Difference]: Without dead ends: 194 [2021-06-05 14:16:20,058 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 43.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-06-05 14:16:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2021-06-05 14:16:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.037037037037037) internal successors, (410), 135 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:16:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 410 transitions. [2021-06-05 14:16:20,060 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 410 transitions. Word has length 16 [2021-06-05 14:16:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:20,060 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 410 transitions. [2021-06-05 14:16:20,060 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 410 transitions. [2021-06-05 14:16:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:20,061 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:20,061 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:16:20,061 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2021-06-05 14:16:20,061 INFO L430 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:20,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:20,061 INFO L82 PathProgramCache]: Analyzing trace with hash 567039630, now seen corresponding path program 56 times [2021-06-05 14:16:20,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:20,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650183168] [2021-06-05 14:16:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:20,089 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:16:20,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:20,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650183168] [2021-06-05 14:16:20,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650183168] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:20,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:20,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:20,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103629943] [2021-06-05 14:16:20,090 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:20,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:20,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:20,090 INFO L87 Difference]: Start difference. First operand 136 states and 410 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:20,203 INFO L93 Difference]: Finished difference Result 169 states and 478 transitions. [2021-06-05 14:16:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:20,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:20,204 INFO L225 Difference]: With dead ends: 169 [2021-06-05 14:16:20,204 INFO L226 Difference]: Without dead ends: 166 [2021-06-05 14:16:20,204 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 85.0ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-06-05 14:16:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 143. [2021-06-05 14:16:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 2.992957746478873) internal successors, (425), 142 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:16:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 425 transitions. [2021-06-05 14:16:20,206 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 425 transitions. Word has length 16 [2021-06-05 14:16:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:20,206 INFO L482 AbstractCegarLoop]: Abstraction has 143 states and 425 transitions. [2021-06-05 14:16:20,206 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 425 transitions. [2021-06-05 14:16:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:20,206 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:20,207 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:16:20,207 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2021-06-05 14:16:20,207 INFO L430 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:20,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash -530287946, now seen corresponding path program 57 times [2021-06-05 14:16:20,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:20,207 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978327519] [2021-06-05 14:16:20,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:20,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:20,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978327519] [2021-06-05 14:16:20,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978327519] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:20,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:20,267 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:20,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215281290] [2021-06-05 14:16:20,267 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:20,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:20,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:20,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:20,267 INFO L87 Difference]: Start difference. First operand 143 states and 425 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:20,384 INFO L93 Difference]: Finished difference Result 168 states and 476 transitions. [2021-06-05 14:16:20,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:20,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:20,385 INFO L225 Difference]: With dead ends: 168 [2021-06-05 14:16:20,385 INFO L226 Difference]: Without dead ends: 165 [2021-06-05 14:16:20,385 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 94.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-06-05 14:16:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 142. [2021-06-05 14:16:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.99290780141844) internal successors, (422), 141 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:16:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 422 transitions. [2021-06-05 14:16:20,387 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 422 transitions. Word has length 16 [2021-06-05 14:16:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:20,387 INFO L482 AbstractCegarLoop]: Abstraction has 142 states and 422 transitions. [2021-06-05 14:16:20,387 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,387 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 422 transitions. [2021-06-05 14:16:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:20,387 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:20,387 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:16:20,387 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2021-06-05 14:16:20,387 INFO L430 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:20,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:20,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1618508590, now seen corresponding path program 58 times [2021-06-05 14:16:20,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:20,388 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829373879] [2021-06-05 14:16:20,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:20,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:16:20,473 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:20,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829373879] [2021-06-05 14:16:20,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829373879] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:20,473 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:20,473 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:20,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033395966] [2021-06-05 14:16:20,473 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:20,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:20,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:20,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:20,474 INFO L87 Difference]: Start difference. First operand 142 states and 422 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:20,569 INFO L93 Difference]: Finished difference Result 155 states and 456 transitions. [2021-06-05 14:16:20,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:20,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:20,570 INFO L225 Difference]: With dead ends: 155 [2021-06-05 14:16:20,570 INFO L226 Difference]: Without dead ends: 150 [2021-06-05 14:16:20,570 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 109.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-06-05 14:16:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2021-06-05 14:16:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.0296296296296297) internal successors, (409), 135 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 409 transitions. [2021-06-05 14:16:20,572 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 409 transitions. Word has length 16 [2021-06-05 14:16:20,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:20,572 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 409 transitions. [2021-06-05 14:16:20,572 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 409 transitions. [2021-06-05 14:16:20,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:20,573 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:20,573 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:16:20,573 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2021-06-05 14:16:20,573 INFO L430 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:20,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1191391966, now seen corresponding path program 56 times [2021-06-05 14:16:20,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:20,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294686959] [2021-06-05 14:16:20,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:20,616 INFO L134 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:16:20,616 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:20,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294686959] [2021-06-05 14:16:20,616 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294686959] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:20,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812593253] [2021-06-05 14:16:20,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 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:16:20,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:20,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:20,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:20,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:20,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:16:20,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812593253] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:20,719 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:20,719 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:20,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469294356] [2021-06-05 14:16:20,719 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:20,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:20,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:20,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:20,720 INFO L87 Difference]: Start difference. First operand 136 states and 409 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:16:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:20,822 INFO L93 Difference]: Finished difference Result 201 states and 566 transitions. [2021-06-05 14:16:20,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:20,822 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 16 [2021-06-05 14:16:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:20,823 INFO L225 Difference]: With dead ends: 201 [2021-06-05 14:16:20,823 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 14:16:20,823 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 97.3ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:20,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 14:16:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 135. [2021-06-05 14:16:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.985074626865672) internal successors, (400), 134 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 400 transitions. [2021-06-05 14:16:20,825 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 400 transitions. Word has length 16 [2021-06-05 14:16:20,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:20,825 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 400 transitions. [2021-06-05 14:16:20,825 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:16:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 400 transitions. [2021-06-05 14:16:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:20,826 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:20,826 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:16:21,045 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 118 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable366 [2021-06-05 14:16:21,046 INFO L430 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:21,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash 170164140, now seen corresponding path program 57 times [2021-06-05 14:16:21,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:21,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967435271] [2021-06-05 14:16:21,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:21,075 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:16:21,076 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:21,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967435271] [2021-06-05 14:16:21,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967435271] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:21,076 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:21,076 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:21,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456673690] [2021-06-05 14:16:21,076 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:21,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:21,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:21,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:21,077 INFO L87 Difference]: Start difference. First operand 135 states and 400 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:21,162 INFO L93 Difference]: Finished difference Result 197 states and 549 transitions. [2021-06-05 14:16:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:21,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:21,163 INFO L225 Difference]: With dead ends: 197 [2021-06-05 14:16:21,163 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 14:16:21,163 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 49.7ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:21,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 14:16:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 133. [2021-06-05 14:16:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.9696969696969697) internal successors, (392), 132 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 392 transitions. [2021-06-05 14:16:21,165 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 392 transitions. Word has length 16 [2021-06-05 14:16:21,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:21,166 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 392 transitions. [2021-06-05 14:16:21,166 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:21,166 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 392 transitions. [2021-06-05 14:16:21,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:21,166 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:21,166 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:16:21,166 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2021-06-05 14:16:21,166 INFO L430 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash -365065662, now seen corresponding path program 58 times [2021-06-05 14:16:21,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:21,167 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189372389] [2021-06-05 14:16:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:21,221 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:16:21,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:21,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189372389] [2021-06-05 14:16:21,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189372389] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:21,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:21,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:21,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494003193] [2021-06-05 14:16:21,222 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:21,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:21,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:21,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:21,223 INFO L87 Difference]: Start difference. First operand 133 states and 392 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:21,291 INFO L93 Difference]: Finished difference Result 174 states and 499 transitions. [2021-06-05 14:16:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:21,292 INFO L225 Difference]: With dead ends: 174 [2021-06-05 14:16:21,292 INFO L226 Difference]: Without dead ends: 170 [2021-06-05 14:16:21,292 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-06-05 14:16:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 126. [2021-06-05 14:16:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 3.008) internal successors, (376), 125 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:16:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 376 transitions. [2021-06-05 14:16:21,294 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 376 transitions. Word has length 16 [2021-06-05 14:16:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:21,294 INFO L482 AbstractCegarLoop]: Abstraction has 126 states and 376 transitions. [2021-06-05 14:16:21,294 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 376 transitions. [2021-06-05 14:16:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:21,294 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:21,294 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:16:21,294 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2021-06-05 14:16:21,294 INFO L430 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:21,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:21,295 INFO L82 PathProgramCache]: Analyzing trace with hash -559894012, now seen corresponding path program 59 times [2021-06-05 14:16:21,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:21,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361553522] [2021-06-05 14:16:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:21,339 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:16:21,339 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:21,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361553522] [2021-06-05 14:16:21,340 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361553522] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:21,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554386783] [2021-06-05 14:16:21,340 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 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:16:21,366 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:21,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:21,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:21,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:21,430 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:16:21,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554386783] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:21,430 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:21,430 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:21,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903921112] [2021-06-05 14:16:21,431 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:21,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:21,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:21,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:21,431 INFO L87 Difference]: Start difference. First operand 126 states and 376 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:16:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:21,697 INFO L93 Difference]: Finished difference Result 200 states and 564 transitions. [2021-06-05 14:16:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:21,698 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 16 [2021-06-05 14:16:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:21,698 INFO L225 Difference]: With dead ends: 200 [2021-06-05 14:16:21,698 INFO L226 Difference]: Without dead ends: 200 [2021-06-05 14:16:21,698 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 140.2ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-06-05 14:16:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 129. [2021-06-05 14:16:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 3.0546875) internal successors, (391), 128 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:16:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 391 transitions. [2021-06-05 14:16:21,701 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 391 transitions. Word has length 16 [2021-06-05 14:16:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:21,701 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 391 transitions. [2021-06-05 14:16:21,701 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:16:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 391 transitions. [2021-06-05 14:16:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:21,701 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:21,701 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:16:21,912 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable369 [2021-06-05 14:16:21,913 INFO L430 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash 635142162, now seen corresponding path program 59 times [2021-06-05 14:16:21,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:21,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561916348] [2021-06-05 14:16:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:21,966 INFO L134 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:16:21,966 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:21,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561916348] [2021-06-05 14:16:21,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561916348] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:21,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287469327] [2021-06-05 14:16:21,966 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:16:21,995 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:21,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:21,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:21,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:22,040 INFO L134 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:16:22,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287469327] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:22,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:22,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:16:22,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552693427] [2021-06-05 14:16:22,040 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:16:22,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:22,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:16:22,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:16:22,041 INFO L87 Difference]: Start difference. First operand 129 states and 391 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:22,132 INFO L93 Difference]: Finished difference Result 199 states and 565 transitions. [2021-06-05 14:16:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:22,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have 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:16:22,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:22,133 INFO L225 Difference]: With dead ends: 199 [2021-06-05 14:16:22,133 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 14:16:22,133 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 77.8ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 14:16:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 136. [2021-06-05 14:16:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.0444444444444443) internal successors, (411), 135 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 411 transitions. [2021-06-05 14:16:22,135 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 411 transitions. Word has length 16 [2021-06-05 14:16:22,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:22,135 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 411 transitions. [2021-06-05 14:16:22,135 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 411 transitions. [2021-06-05 14:16:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:22,136 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:22,136 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:16:22,356 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370,120 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:22,357 INFO L430 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:22,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2064097268, now seen corresponding path program 60 times [2021-06-05 14:16:22,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:22,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665405112] [2021-06-05 14:16:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:22,392 INFO L134 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:16:22,392 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:22,392 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665405112] [2021-06-05 14:16:22,392 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665405112] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:22,392 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411938550] [2021-06-05 14:16:22,392 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:16:22,424 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:22,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:22,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:22,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:22,487 INFO L134 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:16:22,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411938550] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:22,487 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:22,487 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:22,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432390048] [2021-06-05 14:16:22,487 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:22,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:22,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:22,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:22,488 INFO L87 Difference]: Start difference. First operand 136 states and 411 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:16:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:22,584 INFO L93 Difference]: Finished difference Result 206 states and 579 transitions. [2021-06-05 14:16:22,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:22,585 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 16 [2021-06-05 14:16:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:22,585 INFO L225 Difference]: With dead ends: 206 [2021-06-05 14:16:22,585 INFO L226 Difference]: Without dead ends: 203 [2021-06-05 14:16:22,585 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 89.5ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-06-05 14:16:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 136. [2021-06-05 14:16:22,587 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:16:22,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 408 transitions. [2021-06-05 14:16:22,588 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 408 transitions. Word has length 16 [2021-06-05 14:16:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:22,588 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 408 transitions. [2021-06-05 14:16:22,588 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:16:22,588 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 408 transitions. [2021-06-05 14:16:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:22,590 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:22,590 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:16:22,813 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373,121 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:22,813 INFO L430 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:22,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1304846584, now seen corresponding path program 60 times [2021-06-05 14:16:22,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:22,813 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098149200] [2021-06-05 14:16:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:22,843 INFO L134 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:16:22,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:22,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098149200] [2021-06-05 14:16:22,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098149200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:22,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597901430] [2021-06-05 14:16:22,843 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 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:16:22,878 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:22,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:22,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:22,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:22,924 INFO L134 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:16:22,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597901430] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:22,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:22,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:16:22,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41859833] [2021-06-05 14:16:22,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:16:22,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:22,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:16:22,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:16:22,925 INFO L87 Difference]: Start difference. First operand 136 states and 408 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:23,032 INFO L93 Difference]: Finished difference Result 201 states and 573 transitions. [2021-06-05 14:16:23,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:23,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have 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:16:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:23,033 INFO L225 Difference]: With dead ends: 201 [2021-06-05 14:16:23,033 INFO L226 Difference]: Without dead ends: 201 [2021-06-05 14:16:23,033 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 72.3ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-06-05 14:16:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 133. [2021-06-05 14:16:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.022727272727273) internal successors, (399), 132 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 399 transitions. [2021-06-05 14:16:23,045 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 399 transitions. Word has length 16 [2021-06-05 14:16:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:23,045 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 399 transitions. [2021-06-05 14:16:23,045 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 399 transitions. [2021-06-05 14:16:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:23,045 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:23,045 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:16:23,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable376 [2021-06-05 14:16:23,269 INFO L430 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:23,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:23,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1190356588, now seen corresponding path program 61 times [2021-06-05 14:16:23,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:23,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375747125] [2021-06-05 14:16:23,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:23,315 INFO L134 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:16:23,316 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:23,316 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375747125] [2021-06-05 14:16:23,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375747125] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:23,316 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619146098] [2021-06-05 14:16:23,316 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 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:16:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:23,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:23,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:23,397 INFO L134 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:16:23,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619146098] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:23,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:23,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:16:23,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362598615] [2021-06-05 14:16:23,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:16:23,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:23,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:16:23,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:23,398 INFO L87 Difference]: Start difference. First operand 133 states and 399 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:16:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:23,489 INFO L93 Difference]: Finished difference Result 199 states and 553 transitions. [2021-06-05 14:16:23,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:23,489 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 16 [2021-06-05 14:16:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:23,490 INFO L225 Difference]: With dead ends: 199 [2021-06-05 14:16:23,490 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 14:16:23,490 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 74.9ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 14:16:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 133. [2021-06-05 14:16:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.0) internal successors, (396), 132 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:23,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 396 transitions. [2021-06-05 14:16:23,492 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 396 transitions. Word has length 16 [2021-06-05 14:16:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:23,492 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 396 transitions. [2021-06-05 14:16:23,493 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:16:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 396 transitions. [2021-06-05 14:16:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:23,493 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:23,493 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:16:23,717 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377,123 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:23,717 INFO L430 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1323280610, now seen corresponding path program 61 times [2021-06-05 14:16:23,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:23,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932249099] [2021-06-05 14:16:23,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:23,748 INFO L134 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:16:23,748 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:23,748 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932249099] [2021-06-05 14:16:23,748 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932249099] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:23,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671995748] [2021-06-05 14:16:23,749 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 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:16:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:23,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:23,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:23,824 INFO L134 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:16:23,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671995748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:23,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:23,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:16:23,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919584033] [2021-06-05 14:16:23,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:16:23,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:23,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:16:23,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:16:23,825 INFO L87 Difference]: Start difference. First operand 133 states and 396 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:16:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:23,923 INFO L93 Difference]: Finished difference Result 220 states and 636 transitions. [2021-06-05 14:16:23,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:23,923 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 16 [2021-06-05 14:16:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:23,923 INFO L225 Difference]: With dead ends: 220 [2021-06-05 14:16:23,924 INFO L226 Difference]: Without dead ends: 220 [2021-06-05 14:16:23,924 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 62.5ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-06-05 14:16:23,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 130. [2021-06-05 14:16:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 3.0) internal successors, (387), 129 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 387 transitions. [2021-06-05 14:16:23,926 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 387 transitions. Word has length 16 [2021-06-05 14:16:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:23,926 INFO L482 AbstractCegarLoop]: Abstraction has 130 states and 387 transitions. [2021-06-05 14:16:23,926 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:16:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 387 transitions. [2021-06-05 14:16:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:23,927 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:23,927 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:16:24,145 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380,124 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:24,146 INFO L430 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:24,146 INFO L82 PathProgramCache]: Analyzing trace with hash 715054666, now seen corresponding path program 62 times [2021-06-05 14:16:24,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:24,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701196176] [2021-06-05 14:16:24,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:24,208 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:16:24,208 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:24,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701196176] [2021-06-05 14:16:24,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701196176] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:24,208 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554871915] [2021-06-05 14:16:24,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:16:24,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:24,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:24,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:24,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:24,378 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:16:24,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554871915] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:24,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:24,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 14:16:24,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855830782] [2021-06-05 14:16:24,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:16:24,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:24,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:16:24,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:24,380 INFO L87 Difference]: Start difference. First operand 130 states and 387 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:16:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:24,584 INFO L93 Difference]: Finished difference Result 267 states and 740 transitions. [2021-06-05 14:16:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:24,585 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 16 [2021-06-05 14:16:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:24,585 INFO L225 Difference]: With dead ends: 267 [2021-06-05 14:16:24,585 INFO L226 Difference]: Without dead ends: 267 [2021-06-05 14:16:24,585 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 178.3ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:16:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-06-05 14:16:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 138. [2021-06-05 14:16:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.116788321167883) internal successors, (427), 137 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:16:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 427 transitions. [2021-06-05 14:16:24,588 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 427 transitions. Word has length 16 [2021-06-05 14:16:24,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:24,588 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 427 transitions. [2021-06-05 14:16:24,588 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:16:24,588 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 427 transitions. [2021-06-05 14:16:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:24,588 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:24,588 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:16:24,789 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381,125 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:24,789 INFO L430 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:24,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1910090840, now seen corresponding path program 62 times [2021-06-05 14:16:24,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:24,790 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133573375] [2021-06-05 14:16:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:24,858 INFO L134 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:16:24,858 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:24,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133573375] [2021-06-05 14:16:24,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133573375] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:24,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973824825] [2021-06-05 14:16:24,858 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 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:16:24,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:24,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:24,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:24,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:24,966 INFO L134 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:16:24,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973824825] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:24,966 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:24,966 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 14:16:24,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007285204] [2021-06-05 14:16:24,966 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:16:24,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:24,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:16:24,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:24,967 INFO L87 Difference]: Start difference. First operand 138 states and 427 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:16:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:25,152 INFO L93 Difference]: Finished difference Result 271 states and 760 transitions. [2021-06-05 14:16:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:25,152 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 16 [2021-06-05 14:16:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:25,153 INFO L225 Difference]: With dead ends: 271 [2021-06-05 14:16:25,153 INFO L226 Difference]: Without dead ends: 267 [2021-06-05 14:16:25,153 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 161.8ms TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:16:25,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-06-05 14:16:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 142. [2021-06-05 14:16:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 3.148936170212766) internal successors, (444), 141 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 444 transitions. [2021-06-05 14:16:25,156 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 444 transitions. Word has length 16 [2021-06-05 14:16:25,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:25,156 INFO L482 AbstractCegarLoop]: Abstraction has 142 states and 444 transitions. [2021-06-05 14:16:25,156 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:16:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 444 transitions. [2021-06-05 14:16:25,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:25,156 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:25,157 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:16:25,375 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382,126 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:25,376 INFO L430 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:25,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:25,376 INFO L82 PathProgramCache]: Analyzing trace with hash -955921350, now seen corresponding path program 63 times [2021-06-05 14:16:25,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:25,376 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034408262] [2021-06-05 14:16:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:25,439 INFO L134 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:16:25,439 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:25,439 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034408262] [2021-06-05 14:16:25,439 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034408262] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:25,439 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524369630] [2021-06-05 14:16:25,439 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 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:16:25,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:16:25,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:25,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:25,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:25,549 INFO L134 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:16:25,549 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524369630] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:25,549 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:25,549 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 14:16:25,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764641182] [2021-06-05 14:16:25,549 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:16:25,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:25,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:16:25,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:25,550 INFO L87 Difference]: Start difference. First operand 142 states and 444 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:16:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:25,731 INFO L93 Difference]: Finished difference Result 260 states and 717 transitions. [2021-06-05 14:16:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:25,732 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 16 [2021-06-05 14:16:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:25,732 INFO L225 Difference]: With dead ends: 260 [2021-06-05 14:16:25,732 INFO L226 Difference]: Without dead ends: 257 [2021-06-05 14:16:25,732 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 164.6ms TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:16:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-06-05 14:16:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 145. [2021-06-05 14:16:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 3.1041666666666665) internal successors, (447), 144 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 447 transitions. [2021-06-05 14:16:25,735 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 447 transitions. Word has length 16 [2021-06-05 14:16:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:25,735 INFO L482 AbstractCegarLoop]: Abstraction has 145 states and 447 transitions. [2021-06-05 14:16:25,735 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:16:25,735 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 447 transitions. [2021-06-05 14:16:25,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:25,736 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:25,736 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:16:25,936 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385,127 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:25,937 INFO L430 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:25,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash -29897906, now seen corresponding path program 63 times [2021-06-05 14:16:25,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:25,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427672655] [2021-06-05 14:16:25,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:25,994 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:16:25,994 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:25,994 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427672655] [2021-06-05 14:16:25,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427672655] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:25,994 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891739845] [2021-06-05 14:16:25,994 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 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:16:26,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:16:26,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:26,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:26,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:26,109 INFO L134 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:16:26,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891739845] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:26,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:26,110 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 14:16:26,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182564525] [2021-06-05 14:16:26,110 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:16:26,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:26,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:16:26,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:26,110 INFO L87 Difference]: Start difference. First operand 145 states and 447 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:16:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:26,332 INFO L93 Difference]: Finished difference Result 278 states and 788 transitions. [2021-06-05 14:16:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:26,333 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 16 [2021-06-05 14:16:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:26,333 INFO L225 Difference]: With dead ends: 278 [2021-06-05 14:16:26,333 INFO L226 Difference]: Without dead ends: 278 [2021-06-05 14:16:26,334 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 176.8ms TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:16:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-06-05 14:16:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 139. [2021-06-05 14:16:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.0652173913043477) internal successors, (423), 138 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 423 transitions. [2021-06-05 14:16:26,336 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 423 transitions. Word has length 16 [2021-06-05 14:16:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:26,336 INFO L482 AbstractCegarLoop]: Abstraction has 139 states and 423 transitions. [2021-06-05 14:16:26,336 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:16:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 423 transitions. [2021-06-05 14:16:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:26,337 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:26,337 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:16:26,544 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 128 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable388 [2021-06-05 14:16:26,545 INFO L430 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:26,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:26,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1057638178, now seen corresponding path program 64 times [2021-06-05 14:16:26,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:26,545 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769775674] [2021-06-05 14:16:26,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:26,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:16:26,584 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:26,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769775674] [2021-06-05 14:16:26,584 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769775674] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:26,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795356784] [2021-06-05 14:16:26,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 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:16:26,643 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:16:26,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:26,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:26,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:26,725 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:16:26,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795356784] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:26,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:26,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:26,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724445977] [2021-06-05 14:16:26,726 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:26,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:26,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:26,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:26,727 INFO L87 Difference]: Start difference. First operand 139 states and 423 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:16:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:26,846 INFO L93 Difference]: Finished difference Result 239 states and 660 transitions. [2021-06-05 14:16:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:26,846 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 16 [2021-06-05 14:16:26,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:26,847 INFO L225 Difference]: With dead ends: 239 [2021-06-05 14:16:26,847 INFO L226 Difference]: Without dead ends: 239 [2021-06-05 14:16:26,847 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 93.7ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:26,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-06-05 14:16:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 134. [2021-06-05 14:16:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.045112781954887) internal successors, (405), 133 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 405 transitions. [2021-06-05 14:16:26,850 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 405 transitions. Word has length 16 [2021-06-05 14:16:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:26,850 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 405 transitions. [2021-06-05 14:16:26,850 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:16:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 405 transitions. [2021-06-05 14:16:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:26,850 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:26,850 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:16:27,073 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable389 [2021-06-05 14:16:27,073 INFO L430 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:27,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1265615764, now seen corresponding path program 65 times [2021-06-05 14:16:27,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:27,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762619265] [2021-06-05 14:16:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:27,117 INFO L134 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:16:27,117 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:27,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762619265] [2021-06-05 14:16:27,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762619265] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:27,117 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560259871] [2021-06-05 14:16:27,118 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 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:16:27,152 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:27,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:27,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:27,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:27,217 INFO L134 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:16:27,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560259871] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:27,218 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:27,218 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:27,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165485577] [2021-06-05 14:16:27,218 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:27,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:27,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:27,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:27,219 INFO L87 Difference]: Start difference. First operand 134 states and 405 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:16:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:27,306 INFO L93 Difference]: Finished difference Result 217 states and 606 transitions. [2021-06-05 14:16:27,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:27,307 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 16 [2021-06-05 14:16:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:27,307 INFO L225 Difference]: With dead ends: 217 [2021-06-05 14:16:27,307 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 14:16:27,307 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 82.6ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 14:16:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 132. [2021-06-05 14:16:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.030534351145038) internal successors, (397), 131 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 397 transitions. [2021-06-05 14:16:27,310 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 397 transitions. Word has length 16 [2021-06-05 14:16:27,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:27,310 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 397 transitions. [2021-06-05 14:16:27,310 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:16:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 397 transitions. [2021-06-05 14:16:27,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:27,310 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:27,310 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:16:27,511 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390,130 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:27,511 INFO L430 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:27,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1168657166, now seen corresponding path program 64 times [2021-06-05 14:16:27,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:27,512 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982294879] [2021-06-05 14:16:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:27,541 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:16:27,542 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:27,542 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982294879] [2021-06-05 14:16:27,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982294879] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:27,542 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:27,542 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:27,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456174133] [2021-06-05 14:16:27,542 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:27,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:27,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:27,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:27,543 INFO L87 Difference]: Start difference. First operand 132 states and 397 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:27,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:27,629 INFO L93 Difference]: Finished difference Result 227 states and 624 transitions. [2021-06-05 14:16:27,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:27,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:27,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:27,629 INFO L225 Difference]: With dead ends: 227 [2021-06-05 14:16:27,629 INFO L226 Difference]: Without dead ends: 223 [2021-06-05 14:16:27,630 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-06-05 14:16:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 134. [2021-06-05 14:16:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.0150375939849625) internal successors, (401), 133 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 401 transitions. [2021-06-05 14:16:27,632 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 401 transitions. Word has length 16 [2021-06-05 14:16:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:27,632 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 401 transitions. [2021-06-05 14:16:27,632 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 401 transitions. [2021-06-05 14:16:27,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:27,633 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:27,633 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:16:27,633 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2021-06-05 14:16:27,633 INFO L430 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:27,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1095284686, now seen corresponding path program 65 times [2021-06-05 14:16:27,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:27,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567266547] [2021-06-05 14:16:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:27,664 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:16:27,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:27,664 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567266547] [2021-06-05 14:16:27,664 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567266547] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:27,664 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:27,664 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:27,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756053916] [2021-06-05 14:16:27,664 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:27,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:27,665 INFO L87 Difference]: Start difference. First operand 134 states and 401 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:27,769 INFO L93 Difference]: Finished difference Result 210 states and 598 transitions. [2021-06-05 14:16:27,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:27,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:27,770 INFO L225 Difference]: With dead ends: 210 [2021-06-05 14:16:27,770 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 14:16:27,770 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 53.4ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 14:16:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2021-06-05 14:16:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.015151515151515) internal successors, (398), 132 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 398 transitions. [2021-06-05 14:16:27,772 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 398 transitions. Word has length 16 [2021-06-05 14:16:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:27,772 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 398 transitions. [2021-06-05 14:16:27,773 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 398 transitions. [2021-06-05 14:16:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:27,773 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:27,773 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:16:27,773 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2021-06-05 14:16:27,773 INFO L430 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:27,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:27,773 INFO L82 PathProgramCache]: Analyzing trace with hash 429577900, now seen corresponding path program 66 times [2021-06-05 14:16:27,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:27,774 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425891785] [2021-06-05 14:16:27,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:27,815 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:27,815 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425891785] [2021-06-05 14:16:27,815 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425891785] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:27,815 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:27,815 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:27,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980331350] [2021-06-05 14:16:27,815 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:27,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:27,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:27,816 INFO L87 Difference]: Start difference. First operand 133 states and 398 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:27,909 INFO L93 Difference]: Finished difference Result 227 states and 615 transitions. [2021-06-05 14:16:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:27,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:27,910 INFO L225 Difference]: With dead ends: 227 [2021-06-05 14:16:27,910 INFO L226 Difference]: Without dead ends: 224 [2021-06-05 14:16:27,910 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 52.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:27,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-06-05 14:16:27,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 138. [2021-06-05 14:16:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.978102189781022) internal successors, (408), 137 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:16:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 408 transitions. [2021-06-05 14:16:27,914 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 408 transitions. Word has length 16 [2021-06-05 14:16:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:27,914 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 408 transitions. [2021-06-05 14:16:27,914 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:27,914 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 408 transitions. [2021-06-05 14:16:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:27,914 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:27,914 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:16:27,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2021-06-05 14:16:27,915 INFO L430 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:27,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:27,915 INFO L82 PathProgramCache]: Analyzing trace with hash -667749676, now seen corresponding path program 67 times [2021-06-05 14:16:27,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:27,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94793865] [2021-06-05 14:16:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:27,958 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:16:27,959 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:27,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94793865] [2021-06-05 14:16:27,959 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94793865] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:27,959 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:27,959 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:27,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263713145] [2021-06-05 14:16:27,959 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:27,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:27,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:27,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:27,960 INFO L87 Difference]: Start difference. First operand 138 states and 408 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:28,045 INFO L93 Difference]: Finished difference Result 214 states and 596 transitions. [2021-06-05 14:16:28,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:28,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:28,045 INFO L225 Difference]: With dead ends: 214 [2021-06-05 14:16:28,046 INFO L226 Difference]: Without dead ends: 211 [2021-06-05 14:16:28,046 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 52.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:28,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-06-05 14:16:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 133. [2021-06-05 14:16:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 3.007575757575758) internal successors, (397), 132 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 397 transitions. [2021-06-05 14:16:28,048 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 397 transitions. Word has length 16 [2021-06-05 14:16:28,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:28,048 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 397 transitions. [2021-06-05 14:16:28,048 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 397 transitions. [2021-06-05 14:16:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:28,049 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:28,049 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:16:28,049 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2021-06-05 14:16:28,049 INFO L430 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:28,049 INFO L82 PathProgramCache]: Analyzing trace with hash 271584158, now seen corresponding path program 66 times [2021-06-05 14:16:28,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:28,049 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271458322] [2021-06-05 14:16:28,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:28,084 INFO L134 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:16:28,084 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:28,084 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271458322] [2021-06-05 14:16:28,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271458322] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:28,085 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905865245] [2021-06-05 14:16:28,085 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 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:16:28,117 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:16:28,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:28,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:28,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:28,174 INFO L134 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:16:28,174 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905865245] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:28,174 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:28,174 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:16:28,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322343858] [2021-06-05 14:16:28,175 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:16:28,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:28,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:16:28,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:28,175 INFO L87 Difference]: Start difference. First operand 133 states and 397 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:16:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:28,283 INFO L93 Difference]: Finished difference Result 240 states and 672 transitions. [2021-06-05 14:16:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:28,284 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 16 [2021-06-05 14:16:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:28,284 INFO L225 Difference]: With dead ends: 240 [2021-06-05 14:16:28,284 INFO L226 Difference]: Without dead ends: 240 [2021-06-05 14:16:28,284 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 76.5ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-06-05 14:16:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 135. [2021-06-05 14:16:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 3.0223880597014925) internal successors, (405), 134 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 405 transitions. [2021-06-05 14:16:28,287 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 405 transitions. Word has length 16 [2021-06-05 14:16:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:28,287 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 405 transitions. [2021-06-05 14:16:28,287 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:16:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 405 transitions. [2021-06-05 14:16:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:28,287 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:28,287 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:16:28,488 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397,131 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:28,488 INFO L430 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:28,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:28,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1633140264, now seen corresponding path program 67 times [2021-06-05 14:16:28,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:28,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155027491] [2021-06-05 14:16:28,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:28,529 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:16:28,530 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:28,530 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155027491] [2021-06-05 14:16:28,530 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155027491] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:28,530 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:28,530 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:28,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140906869] [2021-06-05 14:16:28,530 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:28,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:28,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:28,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:28,531 INFO L87 Difference]: Start difference. First operand 135 states and 405 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:28,631 INFO L93 Difference]: Finished difference Result 217 states and 619 transitions. [2021-06-05 14:16:28,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:28,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:28,632 INFO L225 Difference]: With dead ends: 217 [2021-06-05 14:16:28,632 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 14:16:28,633 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 56.5ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 14:16:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 132. [2021-06-05 14:16:28,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.0076335877862594) internal successors, (394), 131 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 394 transitions. [2021-06-05 14:16:28,635 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 394 transitions. Word has length 16 [2021-06-05 14:16:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:28,635 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 394 transitions. [2021-06-05 14:16:28,635 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 394 transitions. [2021-06-05 14:16:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:28,636 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:28,636 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:16:28,636 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2021-06-05 14:16:28,636 INFO L430 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1191160378, now seen corresponding path program 68 times [2021-06-05 14:16:28,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:28,636 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347118056] [2021-06-05 14:16:28,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:28,673 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:16:28,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:28,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347118056] [2021-06-05 14:16:28,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347118056] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:28,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:28,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:28,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928997853] [2021-06-05 14:16:28,674 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:28,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:28,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:28,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:28,674 INFO L87 Difference]: Start difference. First operand 132 states and 394 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:28,756 INFO L93 Difference]: Finished difference Result 218 states and 587 transitions. [2021-06-05 14:16:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:28,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:28,757 INFO L225 Difference]: With dead ends: 218 [2021-06-05 14:16:28,757 INFO L226 Difference]: Without dead ends: 212 [2021-06-05 14:16:28,758 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 49.6ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-06-05 14:16:28,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 133. [2021-06-05 14:16:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.992424242424242) internal successors, (395), 132 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 395 transitions. [2021-06-05 14:16:28,760 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 395 transitions. Word has length 16 [2021-06-05 14:16:28,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:28,760 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 395 transitions. [2021-06-05 14:16:28,760 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 395 transitions. [2021-06-05 14:16:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:28,761 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:28,761 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:16:28,761 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2021-06-05 14:16:28,761 INFO L430 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:28,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:28,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1677206220, now seen corresponding path program 69 times [2021-06-05 14:16:28,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:28,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272234457] [2021-06-05 14:16:28,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:28,793 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:16:28,793 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:28,793 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272234457] [2021-06-05 14:16:28,793 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272234457] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:28,793 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:28,793 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:28,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42203455] [2021-06-05 14:16:28,793 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:28,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:28,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:28,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:28,794 INFO L87 Difference]: Start difference. First operand 133 states and 395 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:28,876 INFO L93 Difference]: Finished difference Result 215 states and 577 transitions. [2021-06-05 14:16:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:28,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:28,876 INFO L225 Difference]: With dead ends: 215 [2021-06-05 14:16:28,876 INFO L226 Difference]: Without dead ends: 212 [2021-06-05 14:16:28,877 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 59.9ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:28,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-06-05 14:16:28,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 138. [2021-06-05 14:16:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.9562043795620436) internal successors, (405), 137 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 405 transitions. [2021-06-05 14:16:28,879 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 405 transitions. Word has length 16 [2021-06-05 14:16:28,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:28,879 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 405 transitions. [2021-06-05 14:16:28,879 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 405 transitions. [2021-06-05 14:16:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:28,880 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:28,880 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:16:28,880 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2021-06-05 14:16:28,880 INFO L430 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1520433500, now seen corresponding path program 70 times [2021-06-05 14:16:28,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:28,880 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397307750] [2021-06-05 14:16:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:28,912 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:16:28,912 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:28,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397307750] [2021-06-05 14:16:28,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397307750] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:28,913 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:28,913 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:28,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605135812] [2021-06-05 14:16:28,913 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:28,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:28,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:28,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:28,913 INFO L87 Difference]: Start difference. First operand 138 states and 405 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:28,994 INFO L93 Difference]: Finished difference Result 202 states and 558 transitions. [2021-06-05 14:16:28,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:28,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:28,995 INFO L225 Difference]: With dead ends: 202 [2021-06-05 14:16:28,995 INFO L226 Difference]: Without dead ends: 198 [2021-06-05 14:16:28,996 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 55.6ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-06-05 14:16:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 132. [2021-06-05 14:16:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 3.0) internal successors, (393), 131 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 393 transitions. [2021-06-05 14:16:28,997 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 393 transitions. Word has length 16 [2021-06-05 14:16:28,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:28,998 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 393 transitions. [2021-06-05 14:16:28,998 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:28,998 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 393 transitions. [2021-06-05 14:16:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:28,998 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:28,998 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:16:28,998 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2021-06-05 14:16:28,998 INFO L430 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:28,998 INFO L82 PathProgramCache]: Analyzing trace with hash -567271218, now seen corresponding path program 68 times [2021-06-05 14:16:28,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:28,998 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265360136] [2021-06-05 14:16:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:29,029 INFO L134 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:16:29,029 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:29,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265360136] [2021-06-05 14:16:29,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265360136] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:29,029 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346822907] [2021-06-05 14:16:29,029 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 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:16:29,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:29,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:29,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:29,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:29,136 INFO L134 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:16:29,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346822907] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:29,136 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:29,136 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:16:29,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783378384] [2021-06-05 14:16:29,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:16:29,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:29,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:16:29,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:16:29,137 INFO L87 Difference]: Start difference. First operand 132 states and 393 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:16:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:29,230 INFO L93 Difference]: Finished difference Result 274 states and 793 transitions. [2021-06-05 14:16:29,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:29,230 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 16 [2021-06-05 14:16:29,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:29,230 INFO L225 Difference]: With dead ends: 274 [2021-06-05 14:16:29,230 INFO L226 Difference]: Without dead ends: 274 [2021-06-05 14:16:29,231 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 56.0ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:29,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2021-06-05 14:16:29,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 134. [2021-06-05 14:16:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.0) internal successors, (399), 133 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 399 transitions. [2021-06-05 14:16:29,233 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 399 transitions. Word has length 16 [2021-06-05 14:16:29,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:29,233 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 399 transitions. [2021-06-05 14:16:29,233 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:16:29,233 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 399 transitions. [2021-06-05 14:16:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:29,233 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:29,234 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:16:29,440 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 132 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable402 [2021-06-05 14:16:29,441 INFO L430 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:29,441 INFO L82 PathProgramCache]: Analyzing trace with hash 859329480, now seen corresponding path program 69 times [2021-06-05 14:16:29,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:29,441 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18611087] [2021-06-05 14:16:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:29,493 INFO L134 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:16:29,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:29,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18611087] [2021-06-05 14:16:29,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18611087] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:29,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195169929] [2021-06-05 14:16:29,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 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:16:29,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:16:29,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:29,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:29,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:29,568 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195169929] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:29,568 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:29,568 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:16:29,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839877433] [2021-06-05 14:16:29,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:16:29,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:29,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:16:29,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:16:29,569 INFO L87 Difference]: Start difference. First operand 134 states and 399 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:16:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:29,677 INFO L93 Difference]: Finished difference Result 253 states and 716 transitions. [2021-06-05 14:16:29,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:29,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 16 [2021-06-05 14:16:29,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:29,678 INFO L225 Difference]: With dead ends: 253 [2021-06-05 14:16:29,678 INFO L226 Difference]: Without dead ends: 253 [2021-06-05 14:16:29,678 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 69.8ms TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-06-05 14:16:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 136. [2021-06-05 14:16:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.0148148148148146) internal successors, (407), 135 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 407 transitions. [2021-06-05 14:16:29,681 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 407 transitions. Word has length 16 [2021-06-05 14:16:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:29,681 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 407 transitions. [2021-06-05 14:16:29,681 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:16:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 407 transitions. [2021-06-05 14:16:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:29,681 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:29,681 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:16:29,897 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable403 [2021-06-05 14:16:29,898 INFO L430 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:29,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:29,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2074081710, now seen corresponding path program 70 times [2021-06-05 14:16:29,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:29,898 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681875675] [2021-06-05 14:16:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:29,928 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:16:29,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:29,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681875675] [2021-06-05 14:16:29,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681875675] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:29,929 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:29,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:29,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490341285] [2021-06-05 14:16:29,929 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:29,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:29,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:29,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:29,930 INFO L87 Difference]: Start difference. First operand 136 states and 407 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:30,049 INFO L93 Difference]: Finished difference Result 230 states and 663 transitions. [2021-06-05 14:16:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:30,050 INFO L225 Difference]: With dead ends: 230 [2021-06-05 14:16:30,050 INFO L226 Difference]: Without dead ends: 228 [2021-06-05 14:16:30,051 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 59.5ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-06-05 14:16:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 131. [2021-06-05 14:16:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 3.0) internal successors, (390), 130 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:16:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 390 transitions. [2021-06-05 14:16:30,053 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 390 transitions. Word has length 16 [2021-06-05 14:16:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:30,053 INFO L482 AbstractCegarLoop]: Abstraction has 131 states and 390 transitions. [2021-06-05 14:16:30,053 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 390 transitions. [2021-06-05 14:16:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:30,054 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:30,054 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:16:30,054 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2021-06-05 14:16:30,054 INFO L430 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:30,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:30,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2096777692, now seen corresponding path program 71 times [2021-06-05 14:16:30,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:30,054 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158766094] [2021-06-05 14:16:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:30,134 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:16:30,134 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:30,135 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158766094] [2021-06-05 14:16:30,135 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158766094] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:30,135 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608192510] [2021-06-05 14:16:30,135 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:16:30,166 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:30,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:30,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:30,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:30,337 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:16:30,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608192510] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:30,337 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:30,337 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 14:16:30,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819389667] [2021-06-05 14:16:30,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:16:30,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:30,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:16:30,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:30,338 INFO L87 Difference]: Start difference. First operand 131 states and 390 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:16:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:30,547 INFO L93 Difference]: Finished difference Result 217 states and 589 transitions. [2021-06-05 14:16:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:30,547 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 16 [2021-06-05 14:16:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:30,548 INFO L225 Difference]: With dead ends: 217 [2021-06-05 14:16:30,548 INFO L226 Difference]: Without dead ends: 217 [2021-06-05 14:16:30,548 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 181.4ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:16:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-06-05 14:16:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 136. [2021-06-05 14:16:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 3.074074074074074) internal successors, (415), 135 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 415 transitions. [2021-06-05 14:16:30,550 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 415 transitions. Word has length 16 [2021-06-05 14:16:30,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:30,550 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 415 transitions. [2021-06-05 14:16:30,550 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:16:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 415 transitions. [2021-06-05 14:16:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:30,551 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:30,551 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:16:30,752 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405,134 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:30,753 INFO L430 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:30,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:30,753 INFO L82 PathProgramCache]: Analyzing trace with hash -901741518, now seen corresponding path program 71 times [2021-06-05 14:16:30,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:30,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24384509] [2021-06-05 14:16:30,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:30,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:16:30,790 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:30,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24384509] [2021-06-05 14:16:30,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24384509] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:30,790 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90670214] [2021-06-05 14:16:30,790 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 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:16:30,836 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:30,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:30,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:30,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:30,904 INFO L134 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:16:30,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90670214] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:30,905 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:30,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:30,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109807347] [2021-06-05 14:16:30,905 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:30,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:30,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:30,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:30,906 INFO L87 Difference]: Start difference. First operand 136 states and 415 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:16:31,221 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2021-06-05 14:16:31,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:31,450 INFO L93 Difference]: Finished difference Result 211 states and 579 transitions. [2021-06-05 14:16:31,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:31,451 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 16 [2021-06-05 14:16:31,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:31,451 INFO L225 Difference]: With dead ends: 211 [2021-06-05 14:16:31,451 INFO L226 Difference]: Without dead ends: 207 [2021-06-05 14:16:31,451 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 249.6ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-06-05 14:16:31,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 141. [2021-06-05 14:16:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 3.1214285714285714) internal successors, (437), 140 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 437 transitions. [2021-06-05 14:16:31,454 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 437 transitions. Word has length 16 [2021-06-05 14:16:31,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:31,454 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 437 transitions. [2021-06-05 14:16:31,454 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:16:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 437 transitions. [2021-06-05 14:16:31,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:31,455 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:31,455 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:16:31,655 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406,135 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:31,655 INFO L430 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:31,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:31,656 INFO L82 PathProgramCache]: Analyzing trace with hash 527213588, now seen corresponding path program 72 times [2021-06-05 14:16:31,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:31,656 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959891171] [2021-06-05 14:16:31,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:31,712 INFO L134 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:16:31,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:31,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959891171] [2021-06-05 14:16:31,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959891171] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:31,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712477323] [2021-06-05 14:16:31,712 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:16:31,742 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:31,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:31,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:31,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:31,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:16:31,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712477323] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:31,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:31,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-06-05 14:16:31,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604365198] [2021-06-05 14:16:31,824 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:16:31,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:31,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:16:31,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:31,824 INFO L87 Difference]: Start difference. First operand 141 states and 437 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:16:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:31,994 INFO L93 Difference]: Finished difference Result 221 states and 603 transitions. [2021-06-05 14:16:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:31,994 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 16 [2021-06-05 14:16:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:31,995 INFO L225 Difference]: With dead ends: 221 [2021-06-05 14:16:31,995 INFO L226 Difference]: Without dead ends: 218 [2021-06-05 14:16:31,995 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 148.1ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:16:31,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-06-05 14:16:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 144. [2021-06-05 14:16:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 3.076923076923077) internal successors, (440), 143 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 440 transitions. [2021-06-05 14:16:31,997 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 440 transitions. Word has length 16 [2021-06-05 14:16:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:31,998 INFO L482 AbstractCegarLoop]: Abstraction has 144 states and 440 transitions. [2021-06-05 14:16:31,998 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:16:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 440 transitions. [2021-06-05 14:16:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:31,998 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:31,998 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:16:32,213 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409,136 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:32,213 INFO L430 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:32,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:32,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1453237032, now seen corresponding path program 72 times [2021-06-05 14:16:32,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:32,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227837544] [2021-06-05 14:16:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:32,254 INFO L134 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:16:32,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:32,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227837544] [2021-06-05 14:16:32,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227837544] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:32,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063929432] [2021-06-05 14:16:32,254 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 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:16:32,287 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:32,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:32,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:32,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:32,353 INFO L134 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:16:32,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063929432] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:32,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:32,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:32,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384725156] [2021-06-05 14:16:32,354 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:32,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:32,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:32,354 INFO L87 Difference]: Start difference. First operand 144 states and 440 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:16:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:32,462 INFO L93 Difference]: Finished difference Result 220 states and 605 transitions. [2021-06-05 14:16:32,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:32,462 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 16 [2021-06-05 14:16:32,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:32,463 INFO L225 Difference]: With dead ends: 220 [2021-06-05 14:16:32,463 INFO L226 Difference]: Without dead ends: 220 [2021-06-05 14:16:32,463 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 92.0ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-06-05 14:16:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 138. [2021-06-05 14:16:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0364963503649633) internal successors, (416), 137 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 416 transitions. [2021-06-05 14:16:32,465 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 416 transitions. Word has length 16 [2021-06-05 14:16:32,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:32,465 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 416 transitions. [2021-06-05 14:16:32,465 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:16:32,465 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 416 transitions. [2021-06-05 14:16:32,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:32,466 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:32,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:16:32,684 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412,137 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:32,685 INFO L430 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:32,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1754194180, now seen corresponding path program 73 times [2021-06-05 14:16:32,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:32,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719216067] [2021-06-05 14:16:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:32,721 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:16:32,722 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:32,722 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719216067] [2021-06-05 14:16:32,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719216067] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:32,722 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452133919] [2021-06-05 14:16:32,722 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 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:16:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:32,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:32,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:32,858 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:16:32,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452133919] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:32,858 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:32,858 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:32,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527493070] [2021-06-05 14:16:32,859 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:32,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:32,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:32,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:32,859 INFO L87 Difference]: Start difference. First operand 138 states and 416 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:16:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:32,962 INFO L93 Difference]: Finished difference Result 250 states and 667 transitions. [2021-06-05 14:16:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:32,962 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 16 [2021-06-05 14:16:32,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:32,962 INFO L225 Difference]: With dead ends: 250 [2021-06-05 14:16:32,963 INFO L226 Difference]: Without dead ends: 250 [2021-06-05 14:16:32,963 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 90.8ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-06-05 14:16:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 140. [2021-06-05 14:16:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.050359712230216) internal successors, (424), 139 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 424 transitions. [2021-06-05 14:16:32,965 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 424 transitions. Word has length 16 [2021-06-05 14:16:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:32,965 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 424 transitions. [2021-06-05 14:16:32,965 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:16:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 424 transitions. [2021-06-05 14:16:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:32,966 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:32,966 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:16:33,184 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable413 [2021-06-05 14:16:33,185 INFO L430 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:33,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash 217519174, now seen corresponding path program 74 times [2021-06-05 14:16:33,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:33,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903136721] [2021-06-05 14:16:33,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:33,220 INFO L134 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:16:33,220 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:33,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903136721] [2021-06-05 14:16:33,220 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903136721] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:33,220 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573501435] [2021-06-05 14:16:33,220 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 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:16:33,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:33,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:33,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:33,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:33,318 INFO L134 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:16:33,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573501435] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:33,318 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:33,318 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:33,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762982295] [2021-06-05 14:16:33,345 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:33,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:33,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:33,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:33,345 INFO L87 Difference]: Start difference. First operand 140 states and 424 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:16:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:33,438 INFO L93 Difference]: Finished difference Result 228 states and 613 transitions. [2021-06-05 14:16:33,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:33,439 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 16 [2021-06-05 14:16:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:33,453 INFO L225 Difference]: With dead ends: 228 [2021-06-05 14:16:33,453 INFO L226 Difference]: Without dead ends: 226 [2021-06-05 14:16:33,453 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 83.8ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-06-05 14:16:33,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 138. [2021-06-05 14:16:33,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0364963503649633) internal successors, (416), 137 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 416 transitions. [2021-06-05 14:16:33,470 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 416 transitions. Word has length 16 [2021-06-05 14:16:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:33,470 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 416 transitions. [2021-06-05 14:16:33,470 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:16:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 416 transitions. [2021-06-05 14:16:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:33,471 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:33,471 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:16:33,688 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 139 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable414 [2021-06-05 14:16:33,689 INFO L430 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:33,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:33,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1643175192, now seen corresponding path program 73 times [2021-06-05 14:16:33,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:33,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325915819] [2021-06-05 14:16:33,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:33,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:16:33,723 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:33,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325915819] [2021-06-05 14:16:33,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325915819] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:33,723 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:33,723 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:33,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482450540] [2021-06-05 14:16:33,723 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:33,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:33,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:33,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:33,724 INFO L87 Difference]: Start difference. First operand 138 states and 416 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:33,842 INFO L93 Difference]: Finished difference Result 235 states and 620 transitions. [2021-06-05 14:16:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:33,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:33,843 INFO L225 Difference]: With dead ends: 235 [2021-06-05 14:16:33,843 INFO L226 Difference]: Without dead ends: 231 [2021-06-05 14:16:33,843 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 81.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-06-05 14:16:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 140. [2021-06-05 14:16:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.0215827338129495) internal successors, (420), 139 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:16:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 420 transitions. [2021-06-05 14:16:33,846 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 420 transitions. Word has length 16 [2021-06-05 14:16:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:33,846 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 420 transitions. [2021-06-05 14:16:33,846 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 420 transitions. [2021-06-05 14:16:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:33,846 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:33,846 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:16:33,846 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2021-06-05 14:16:33,846 INFO L430 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:33,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:33,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1716547672, now seen corresponding path program 74 times [2021-06-05 14:16:33,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:33,847 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757605821] [2021-06-05 14:16:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:33,879 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:16:33,880 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:33,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757605821] [2021-06-05 14:16:33,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757605821] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:33,880 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:33,880 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:33,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148249077] [2021-06-05 14:16:33,880 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:33,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:33,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:33,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:33,881 INFO L87 Difference]: Start difference. First operand 140 states and 420 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:34,001 INFO L93 Difference]: Finished difference Result 218 states and 594 transitions. [2021-06-05 14:16:34,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:34,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:34,002 INFO L225 Difference]: With dead ends: 218 [2021-06-05 14:16:34,002 INFO L226 Difference]: Without dead ends: 215 [2021-06-05 14:16:34,002 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 82.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-06-05 14:16:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2021-06-05 14:16:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 3.0291970802919708) internal successors, (415), 137 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 415 transitions. [2021-06-05 14:16:34,005 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 415 transitions. Word has length 16 [2021-06-05 14:16:34,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:34,005 INFO L482 AbstractCegarLoop]: Abstraction has 138 states and 415 transitions. [2021-06-05 14:16:34,005 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 415 transitions. [2021-06-05 14:16:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:34,005 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:34,005 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:16:34,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2021-06-05 14:16:34,005 INFO L430 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1912712838, now seen corresponding path program 75 times [2021-06-05 14:16:34,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:34,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063176998] [2021-06-05 14:16:34,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:34,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:16:34,073 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:34,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063176998] [2021-06-05 14:16:34,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063176998] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:34,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:34,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:34,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743394812] [2021-06-05 14:16:34,074 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:34,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:34,074 INFO L87 Difference]: Start difference. First operand 138 states and 415 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:34,161 INFO L93 Difference]: Finished difference Result 235 states and 613 transitions. [2021-06-05 14:16:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:34,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:34,162 INFO L225 Difference]: With dead ends: 235 [2021-06-05 14:16:34,162 INFO L226 Difference]: Without dead ends: 232 [2021-06-05 14:16:34,162 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 67.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-06-05 14:16:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 140. [2021-06-05 14:16:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 3.014388489208633) internal successors, (419), 139 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 419 transitions. [2021-06-05 14:16:34,165 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 419 transitions. Word has length 16 [2021-06-05 14:16:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:34,165 INFO L482 AbstractCegarLoop]: Abstraction has 140 states and 419 transitions. [2021-06-05 14:16:34,165 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 419 transitions. [2021-06-05 14:16:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:34,165 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:34,165 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:16:34,165 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419 [2021-06-05 14:16:34,165 INFO L430 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:34,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:34,166 INFO L82 PathProgramCache]: Analyzing trace with hash 815385262, now seen corresponding path program 76 times [2021-06-05 14:16:34,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:34,166 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354914353] [2021-06-05 14:16:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:34,198 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:16:34,198 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:34,198 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354914353] [2021-06-05 14:16:34,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354914353] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:34,199 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:34,199 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:34,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427507163] [2021-06-05 14:16:34,199 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:34,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:34,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:34,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:34,199 INFO L87 Difference]: Start difference. First operand 140 states and 419 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:34,287 INFO L93 Difference]: Finished difference Result 221 states and 592 transitions. [2021-06-05 14:16:34,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:34,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:34,288 INFO L225 Difference]: With dead ends: 221 [2021-06-05 14:16:34,288 INFO L226 Difference]: Without dead ends: 218 [2021-06-05 14:16:34,288 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 52.8ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-06-05 14:16:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 139. [2021-06-05 14:16:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 3.0144927536231885) internal successors, (416), 138 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 416 transitions. [2021-06-05 14:16:34,296 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 416 transitions. Word has length 16 [2021-06-05 14:16:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:34,296 INFO L482 AbstractCegarLoop]: Abstraction has 139 states and 416 transitions. [2021-06-05 14:16:34,296 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 416 transitions. [2021-06-05 14:16:34,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:34,296 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:34,296 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:16:34,297 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2021-06-05 14:16:34,297 INFO L430 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:34,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1754719096, now seen corresponding path program 75 times [2021-06-05 14:16:34,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:34,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588869599] [2021-06-05 14:16:34,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:34,336 INFO L134 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:16:34,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:34,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588869599] [2021-06-05 14:16:34,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588869599] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:34,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647786668] [2021-06-05 14:16:34,336 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:16:34,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:16:34,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:34,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:34,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:34,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647786668] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:34,435 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:34,435 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:34,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182992236] [2021-06-05 14:16:34,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:34,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:34,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:34,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:34,436 INFO L87 Difference]: Start difference. First operand 139 states and 416 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:16:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:34,548 INFO L93 Difference]: Finished difference Result 254 states and 684 transitions. [2021-06-05 14:16:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:34,549 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 16 [2021-06-05 14:16:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:34,550 INFO L225 Difference]: With dead ends: 254 [2021-06-05 14:16:34,550 INFO L226 Difference]: Without dead ends: 254 [2021-06-05 14:16:34,550 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 87.1ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-06-05 14:16:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 141. [2021-06-05 14:16:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 3.0285714285714285) internal successors, (424), 140 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 424 transitions. [2021-06-05 14:16:34,553 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 424 transitions. Word has length 16 [2021-06-05 14:16:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:34,553 INFO L482 AbstractCegarLoop]: Abstraction has 141 states and 424 transitions. [2021-06-05 14:16:34,553 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:16:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 424 transitions. [2021-06-05 14:16:34,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:34,553 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:34,554 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:16:34,772 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable421 [2021-06-05 14:16:34,773 INFO L430 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:34,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:34,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1178692094, now seen corresponding path program 76 times [2021-06-05 14:16:34,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:34,773 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639855421] [2021-06-05 14:16:34,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:34,824 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:16:34,824 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:34,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639855421] [2021-06-05 14:16:34,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639855421] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:34,824 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:34,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:34,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979059431] [2021-06-05 14:16:34,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:34,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:34,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:34,825 INFO L87 Difference]: Start difference. First operand 141 states and 424 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:34,966 INFO L93 Difference]: Finished difference Result 228 states and 620 transitions. [2021-06-05 14:16:34,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:34,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:34,967 INFO L225 Difference]: With dead ends: 228 [2021-06-05 14:16:34,967 INFO L226 Difference]: Without dead ends: 226 [2021-06-05 14:16:34,967 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 100.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-06-05 14:16:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 137. [2021-06-05 14:16:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 3.0) internal successors, (408), 136 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:16:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 408 transitions. [2021-06-05 14:16:34,982 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 408 transitions. Word has length 16 [2021-06-05 14:16:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:34,982 INFO L482 AbstractCegarLoop]: Abstraction has 137 states and 408 transitions. [2021-06-05 14:16:34,982 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 408 transitions. [2021-06-05 14:16:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:34,982 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:34,982 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:16:34,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable422 [2021-06-05 14:16:34,982 INFO L430 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:34,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:34,983 INFO L82 PathProgramCache]: Analyzing trace with hash 433988996, now seen corresponding path program 77 times [2021-06-05 14:16:34,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:34,983 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566721181] [2021-06-05 14:16:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:35,110 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:16:35,111 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:35,111 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566721181] [2021-06-05 14:16:35,111 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566721181] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:35,111 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65157982] [2021-06-05 14:16:35,111 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 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:16:35,141 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:16:35,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:35,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:35,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:35,203 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:16:35,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65157982] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:35,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:35,203 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:35,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768352424] [2021-06-05 14:16:35,203 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:35,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:35,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:35,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:35,204 INFO L87 Difference]: Start difference. First operand 137 states and 408 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:16:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:35,293 INFO L93 Difference]: Finished difference Result 206 states and 557 transitions. [2021-06-05 14:16:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:35,293 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 16 [2021-06-05 14:16:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:35,294 INFO L225 Difference]: With dead ends: 206 [2021-06-05 14:16:35,294 INFO L226 Difference]: Without dead ends: 206 [2021-06-05 14:16:35,294 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 135.4ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-06-05 14:16:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 136. [2021-06-05 14:16:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.9555555555555557) internal successors, (399), 135 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 399 transitions. [2021-06-05 14:16:35,298 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 399 transitions. Word has length 16 [2021-06-05 14:16:35,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:35,298 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 399 transitions. [2021-06-05 14:16:35,298 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:16:35,298 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 399 transitions. [2021-06-05 14:16:35,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:35,298 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:35,298 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:16:35,499 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable423,141 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:35,499 INFO L430 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:35,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1889264946, now seen corresponding path program 78 times [2021-06-05 14:16:35,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:35,499 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897154850] [2021-06-05 14:16:35,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:35,532 INFO L134 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:16:35,532 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:35,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897154850] [2021-06-05 14:16:35,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897154850] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:35,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695968522] [2021-06-05 14:16:35,532 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 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:16:35,561 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:16:35,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:35,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:35,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:35,620 INFO L134 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:16:35,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695968522] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:35,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:35,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:35,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902997439] [2021-06-05 14:16:35,621 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:35,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:35,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:35,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:35,621 INFO L87 Difference]: Start difference. First operand 136 states and 399 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:16:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:35,712 INFO L93 Difference]: Finished difference Result 197 states and 530 transitions. [2021-06-05 14:16:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:35,712 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 16 [2021-06-05 14:16:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:35,713 INFO L225 Difference]: With dead ends: 197 [2021-06-05 14:16:35,713 INFO L226 Difference]: Without dead ends: 195 [2021-06-05 14:16:35,713 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 83.6ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-06-05 14:16:35,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 130. [2021-06-05 14:16:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.9689922480620154) internal successors, (383), 129 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 383 transitions. [2021-06-05 14:16:35,715 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 383 transitions. Word has length 16 [2021-06-05 14:16:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:35,715 INFO L482 AbstractCegarLoop]: Abstraction has 130 states and 383 transitions. [2021-06-05 14:16:35,715 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:16:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 383 transitions. [2021-06-05 14:16:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:35,715 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:35,715 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:16:35,916 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 142 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable424 [2021-06-05 14:16:35,916 INFO L430 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:35,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:35,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1506544558, now seen corresponding path program 79 times [2021-06-05 14:16:35,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:35,916 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188872025] [2021-06-05 14:16:35,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:35,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:16:35,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:35,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188872025] [2021-06-05 14:16:35,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188872025] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:35,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274810384] [2021-06-05 14:16:35,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 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:16:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:35,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:35,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:36,048 INFO L134 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:16:36,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274810384] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:36,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:36,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:16:36,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077600708] [2021-06-05 14:16:36,049 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:16:36,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:36,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:16:36,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:36,049 INFO L87 Difference]: Start difference. First operand 130 states and 383 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:16:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:36,129 INFO L93 Difference]: Finished difference Result 176 states and 481 transitions. [2021-06-05 14:16:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:36,129 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 16 [2021-06-05 14:16:36,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:36,130 INFO L225 Difference]: With dead ends: 176 [2021-06-05 14:16:36,130 INFO L226 Difference]: Without dead ends: 172 [2021-06-05 14:16:36,130 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-06-05 14:16:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 128. [2021-06-05 14:16:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.952755905511811) internal successors, (375), 127 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:36,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 375 transitions. [2021-06-05 14:16:36,142 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 375 transitions. Word has length 16 [2021-06-05 14:16:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:36,143 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 375 transitions. [2021-06-05 14:16:36,143 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:16:36,143 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 375 transitions. [2021-06-05 14:16:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:36,143 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:36,143 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:16:36,365 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable427 [2021-06-05 14:16:36,365 INFO L430 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:36,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1055429870, now seen corresponding path program 77 times [2021-06-05 14:16:36,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:36,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881083161] [2021-06-05 14:16:36,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:36,392 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:16:36,392 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:36,392 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881083161] [2021-06-05 14:16:36,392 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881083161] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:36,392 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:36,392 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:36,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158506220] [2021-06-05 14:16:36,394 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:36,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:36,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:36,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:36,395 INFO L87 Difference]: Start difference. First operand 128 states and 375 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:36,496 INFO L93 Difference]: Finished difference Result 175 states and 467 transitions. [2021-06-05 14:16:36,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:36,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:36,497 INFO L225 Difference]: With dead ends: 175 [2021-06-05 14:16:36,497 INFO L226 Difference]: Without dead ends: 171 [2021-06-05 14:16:36,497 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 73.4ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-06-05 14:16:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2021-06-05 14:16:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.931297709923664) internal successors, (384), 131 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 384 transitions. [2021-06-05 14:16:36,499 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 384 transitions. Word has length 16 [2021-06-05 14:16:36,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:36,499 INFO L482 AbstractCegarLoop]: Abstraction has 132 states and 384 transitions. [2021-06-05 14:16:36,499 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,499 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 384 transitions. [2021-06-05 14:16:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:36,499 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:36,499 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:16:36,499 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable430 [2021-06-05 14:16:36,499 INFO L430 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:36,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1128802350, now seen corresponding path program 78 times [2021-06-05 14:16:36,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:36,499 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316435454] [2021-06-05 14:16:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:36,538 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:16:36,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:36,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316435454] [2021-06-05 14:16:36,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316435454] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:36,539 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:36,539 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:36,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016446691] [2021-06-05 14:16:36,539 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:36,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:36,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:36,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:36,539 INFO L87 Difference]: Start difference. First operand 132 states and 384 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:36,643 INFO L93 Difference]: Finished difference Result 173 states and 464 transitions. [2021-06-05 14:16:36,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:36,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:36,644 INFO L225 Difference]: With dead ends: 173 [2021-06-05 14:16:36,644 INFO L226 Difference]: Without dead ends: 170 [2021-06-05 14:16:36,644 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 74.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-06-05 14:16:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 130. [2021-06-05 14:16:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.937984496124031) internal successors, (379), 129 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 379 transitions. [2021-06-05 14:16:36,646 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 379 transitions. Word has length 16 [2021-06-05 14:16:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:36,646 INFO L482 AbstractCegarLoop]: Abstraction has 130 states and 379 transitions. [2021-06-05 14:16:36,646 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 379 transitions. [2021-06-05 14:16:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:36,646 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:36,646 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:16:36,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2021-06-05 14:16:36,646 INFO L430 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:36,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:36,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1126176574, now seen corresponding path program 79 times [2021-06-05 14:16:36,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:36,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937566569] [2021-06-05 14:16:36,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:36,680 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:16:36,680 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:36,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937566569] [2021-06-05 14:16:36,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937566569] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:36,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:36,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:36,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250502475] [2021-06-05 14:16:36,681 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:36,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:36,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:36,681 INFO L87 Difference]: Start difference. First operand 130 states and 379 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:36,786 INFO L93 Difference]: Finished difference Result 161 states and 446 transitions. [2021-06-05 14:16:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:36,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:36,787 INFO L225 Difference]: With dead ends: 161 [2021-06-05 14:16:36,787 INFO L226 Difference]: Without dead ends: 156 [2021-06-05 14:16:36,787 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 78.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-06-05 14:16:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 129. [2021-06-05 14:16:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.9375) internal successors, (376), 128 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:16:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 376 transitions. [2021-06-05 14:16:36,789 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 376 transitions. Word has length 16 [2021-06-05 14:16:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:36,789 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 376 transitions. [2021-06-05 14:16:36,789 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 376 transitions. [2021-06-05 14:16:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:36,790 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:36,790 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:16:36,790 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable432 [2021-06-05 14:16:36,790 INFO L430 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash -700417548, now seen corresponding path program 80 times [2021-06-05 14:16:36,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:36,790 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678041182] [2021-06-05 14:16:36,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:36,823 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:16:36,823 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:36,823 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678041182] [2021-06-05 14:16:36,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678041182] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:36,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:36,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:36,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754877733] [2021-06-05 14:16:36,823 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:36,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:36,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:36,824 INFO L87 Difference]: Start difference. First operand 129 states and 376 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:36,892 INFO L93 Difference]: Finished difference Result 186 states and 490 transitions. [2021-06-05 14:16:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:36,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:36,892 INFO L225 Difference]: With dead ends: 186 [2021-06-05 14:16:36,892 INFO L226 Difference]: Without dead ends: 183 [2021-06-05 14:16:36,892 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 51.3ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-06-05 14:16:36,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 136. [2021-06-05 14:16:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.8962962962962964) internal successors, (391), 135 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:16:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 391 transitions. [2021-06-05 14:16:36,894 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 391 transitions. Word has length 16 [2021-06-05 14:16:36,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:36,894 INFO L482 AbstractCegarLoop]: Abstraction has 136 states and 391 transitions. [2021-06-05 14:16:36,894 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 391 transitions. [2021-06-05 14:16:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:36,894 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:36,894 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:16:36,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable433 [2021-06-05 14:16:36,895 INFO L430 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:36,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:36,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1797745124, now seen corresponding path program 81 times [2021-06-05 14:16:36,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:36,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187528035] [2021-06-05 14:16:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:36,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:16:36,927 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:36,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187528035] [2021-06-05 14:16:36,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187528035] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:36,928 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:36,928 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:36,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109355537] [2021-06-05 14:16:36,928 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:36,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:36,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:36,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:36,928 INFO L87 Difference]: Start difference. First operand 136 states and 391 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:36,999 INFO L93 Difference]: Finished difference Result 185 states and 488 transitions. [2021-06-05 14:16:36,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:37,000 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:37,000 INFO L225 Difference]: With dead ends: 185 [2021-06-05 14:16:37,000 INFO L226 Difference]: Without dead ends: 182 [2021-06-05 14:16:37,000 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 46.0ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-06-05 14:16:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 135. [2021-06-05 14:16:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.8955223880597014) internal successors, (388), 134 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 388 transitions. [2021-06-05 14:16:37,002 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 388 transitions. Word has length 16 [2021-06-05 14:16:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:37,002 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 388 transitions. [2021-06-05 14:16:37,002 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 388 transitions. [2021-06-05 14:16:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:37,002 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:37,002 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:16:37,002 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2021-06-05 14:16:37,002 INFO L430 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:37,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:37,002 INFO L82 PathProgramCache]: Analyzing trace with hash 351051412, now seen corresponding path program 82 times [2021-06-05 14:16:37,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:37,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149908767] [2021-06-05 14:16:37,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:37,025 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:16:37,025 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:37,025 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149908767] [2021-06-05 14:16:37,025 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149908767] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:37,025 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:37,025 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:37,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101970909] [2021-06-05 14:16:37,025 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:37,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:37,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:37,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:37,026 INFO L87 Difference]: Start difference. First operand 135 states and 388 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:37,082 INFO L93 Difference]: Finished difference Result 172 states and 468 transitions. [2021-06-05 14:16:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:37,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:37,083 INFO L225 Difference]: With dead ends: 172 [2021-06-05 14:16:37,083 INFO L226 Difference]: Without dead ends: 167 [2021-06-05 14:16:37,083 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 36.3ms TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-06-05 14:16:37,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 129. [2021-06-05 14:16:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.9296875) internal successors, (375), 128 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 375 transitions. [2021-06-05 14:16:37,085 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 375 transitions. Word has length 16 [2021-06-05 14:16:37,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:37,085 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 375 transitions. [2021-06-05 14:16:37,085 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 375 transitions. [2021-06-05 14:16:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:37,085 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:37,085 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:16:37,085 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435 [2021-06-05 14:16:37,085 INFO L430 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:37,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1836118152, now seen corresponding path program 80 times [2021-06-05 14:16:37,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:37,085 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437449098] [2021-06-05 14:16:37,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:37,115 INFO L134 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:16:37,115 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:37,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437449098] [2021-06-05 14:16:37,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437449098] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:37,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138742299] [2021-06-05 14:16:37,115 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 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:16:37,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:37,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:37,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:37,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:37,193 INFO L134 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:16:37,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138742299] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:37,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:37,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2021-06-05 14:16:37,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981385389] [2021-06-05 14:16:37,194 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:16:37,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:16:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:37,194 INFO L87 Difference]: Start difference. First operand 129 states and 375 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:16:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:37,277 INFO L93 Difference]: Finished difference Result 197 states and 540 transitions. [2021-06-05 14:16:37,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:37,278 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 16 [2021-06-05 14:16:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:37,278 INFO L225 Difference]: With dead ends: 197 [2021-06-05 14:16:37,278 INFO L226 Difference]: Without dead ends: 197 [2021-06-05 14:16:37,278 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-06-05 14:16:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 133. [2021-06-05 14:16:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.962121212121212) internal successors, (391), 132 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:16:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 391 transitions. [2021-06-05 14:16:37,280 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 391 transitions. Word has length 16 [2021-06-05 14:16:37,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:37,280 INFO L482 AbstractCegarLoop]: Abstraction has 133 states and 391 transitions. [2021-06-05 14:16:37,280 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:16:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 391 transitions. [2021-06-05 14:16:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:37,280 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:37,280 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:16:37,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436,144 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:37,485 INFO L430 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:37,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:37,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1097293038, now seen corresponding path program 81 times [2021-06-05 14:16:37,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:37,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579023767] [2021-06-05 14:16:37,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:37,512 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:16:37,513 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:37,513 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579023767] [2021-06-05 14:16:37,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579023767] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:37,513 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:37,513 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:37,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276533064] [2021-06-05 14:16:37,513 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:37,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:37,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:37,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:37,513 INFO L87 Difference]: Start difference. First operand 133 states and 391 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:37,609 INFO L93 Difference]: Finished difference Result 193 states and 523 transitions. [2021-06-05 14:16:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:37,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:37,610 INFO L225 Difference]: With dead ends: 193 [2021-06-05 14:16:37,610 INFO L226 Difference]: Without dead ends: 191 [2021-06-05 14:16:37,610 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 65.7ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-06-05 14:16:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 131. [2021-06-05 14:16:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.9461538461538463) internal successors, (383), 130 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 383 transitions. [2021-06-05 14:16:37,612 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 383 transitions. Word has length 16 [2021-06-05 14:16:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:37,612 INFO L482 AbstractCegarLoop]: Abstraction has 131 states and 383 transitions. [2021-06-05 14:16:37,612 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 383 transitions. [2021-06-05 14:16:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:37,612 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:37,612 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:16:37,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable437 [2021-06-05 14:16:37,612 INFO L430 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:37,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:37,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1632522840, now seen corresponding path program 82 times [2021-06-05 14:16:37,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:37,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938979846] [2021-06-05 14:16:37,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:37,646 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:16:37,646 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:37,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938979846] [2021-06-05 14:16:37,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938979846] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:37,646 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:37,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:37,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546492541] [2021-06-05 14:16:37,647 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:37,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:37,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:37,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:37,647 INFO L87 Difference]: Start difference. First operand 131 states and 383 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:37,745 INFO L93 Difference]: Finished difference Result 170 states and 473 transitions. [2021-06-05 14:16:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:37,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:37,745 INFO L225 Difference]: With dead ends: 170 [2021-06-05 14:16:37,745 INFO L226 Difference]: Without dead ends: 166 [2021-06-05 14:16:37,746 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 73.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:37,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-06-05 14:16:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2021-06-05 14:16:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.9291338582677167) internal successors, (372), 127 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 372 transitions. [2021-06-05 14:16:37,747 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 372 transitions. Word has length 16 [2021-06-05 14:16:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:37,747 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 372 transitions. [2021-06-05 14:16:37,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,747 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 372 transitions. [2021-06-05 14:16:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:37,748 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:37,748 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:16:37,748 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable438 [2021-06-05 14:16:37,748 INFO L430 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1788497036, now seen corresponding path program 83 times [2021-06-05 14:16:37,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:37,748 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183490207] [2021-06-05 14:16:37,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:37,770 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:16:37,770 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:37,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183490207] [2021-06-05 14:16:37,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183490207] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:37,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:37,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:37,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872786355] [2021-06-05 14:16:37,771 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:37,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:37,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:37,771 INFO L87 Difference]: Start difference. First operand 128 states and 372 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:37,831 INFO L93 Difference]: Finished difference Result 154 states and 417 transitions. [2021-06-05 14:16:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:37,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:37,831 INFO L225 Difference]: With dead ends: 154 [2021-06-05 14:16:37,831 INFO L226 Difference]: Without dead ends: 148 [2021-06-05 14:16:37,832 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.5ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-06-05 14:16:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2021-06-05 14:16:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 2.9140625) internal successors, (373), 128 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 373 transitions. [2021-06-05 14:16:37,833 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 373 transitions. Word has length 16 [2021-06-05 14:16:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:37,833 INFO L482 AbstractCegarLoop]: Abstraction has 129 states and 373 transitions. [2021-06-05 14:16:37,833 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 373 transitions. [2021-06-05 14:16:37,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:37,834 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:37,834 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:16:37,834 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable439 [2021-06-05 14:16:37,834 INFO L430 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:37,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1079869562, now seen corresponding path program 84 times [2021-06-05 14:16:37,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:37,834 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563737052] [2021-06-05 14:16:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:37,882 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:16:37,882 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:37,882 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563737052] [2021-06-05 14:16:37,882 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563737052] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:37,882 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:37,882 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:37,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323840996] [2021-06-05 14:16:37,883 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:37,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:37,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:37,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:37,883 INFO L87 Difference]: Start difference. First operand 129 states and 373 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:37,963 INFO L93 Difference]: Finished difference Result 164 states and 429 transitions. [2021-06-05 14:16:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:37,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:37,963 INFO L225 Difference]: With dead ends: 164 [2021-06-05 14:16:37,963 INFO L226 Difference]: Without dead ends: 161 [2021-06-05 14:16:37,964 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 69.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:37,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-06-05 14:16:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2021-06-05 14:16:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.8796992481203008) internal successors, (383), 133 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 383 transitions. [2021-06-05 14:16:37,965 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 383 transitions. Word has length 16 [2021-06-05 14:16:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:37,965 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 383 transitions. [2021-06-05 14:16:37,965 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:37,965 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 383 transitions. [2021-06-05 14:16:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:37,966 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:37,966 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:16:37,966 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440 [2021-06-05 14:16:37,966 INFO L430 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:37,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:37,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2117770158, now seen corresponding path program 85 times [2021-06-05 14:16:37,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:37,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402452492] [2021-06-05 14:16:37,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:37,991 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:16:37,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:37,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402452492] [2021-06-05 14:16:37,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402452492] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:37,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:37,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:37,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050634131] [2021-06-05 14:16:37,991 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:37,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:37,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:37,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:37,992 INFO L87 Difference]: Start difference. First operand 134 states and 383 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:38,064 INFO L93 Difference]: Finished difference Result 151 states and 410 transitions. [2021-06-05 14:16:38,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:38,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:38,065 INFO L225 Difference]: With dead ends: 151 [2021-06-05 14:16:38,065 INFO L226 Difference]: Without dead ends: 147 [2021-06-05 14:16:38,065 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 53.9ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-06-05 14:16:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 128. [2021-06-05 14:16:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.921259842519685) internal successors, (371), 127 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 371 transitions. [2021-06-05 14:16:38,066 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 371 transitions. Word has length 16 [2021-06-05 14:16:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:38,066 INFO L482 AbstractCegarLoop]: Abstraction has 128 states and 371 transitions. [2021-06-05 14:16:38,066 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 371 transitions. [2021-06-05 14:16:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:38,067 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:38,067 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:16:38,067 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2021-06-05 14:16:38,067 INFO L430 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1586215828, now seen corresponding path program 86 times [2021-06-05 14:16:38,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:38,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323162785] [2021-06-05 14:16:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:38,092 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:16:38,092 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:38,092 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323162785] [2021-06-05 14:16:38,092 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323162785] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:38,092 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:38,092 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:38,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021494614] [2021-06-05 14:16:38,092 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:38,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:38,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:38,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:38,093 INFO L87 Difference]: Start difference. First operand 128 states and 371 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:38,163 INFO L93 Difference]: Finished difference Result 147 states and 399 transitions. [2021-06-05 14:16:38,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:38,164 INFO L225 Difference]: With dead ends: 147 [2021-06-05 14:16:38,164 INFO L226 Difference]: Without dead ends: 144 [2021-06-05 14:16:38,164 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 54.7ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:38,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-06-05 14:16:38,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2021-06-05 14:16:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.8805970149253732) internal successors, (386), 134 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 386 transitions. [2021-06-05 14:16:38,166 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 386 transitions. Word has length 16 [2021-06-05 14:16:38,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:38,166 INFO L482 AbstractCegarLoop]: Abstraction has 135 states and 386 transitions. [2021-06-05 14:16:38,166 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,166 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 386 transitions. [2021-06-05 14:16:38,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:38,166 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:38,166 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:16:38,166 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable442 [2021-06-05 14:16:38,166 INFO L430 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:38,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1611423892, now seen corresponding path program 87 times [2021-06-05 14:16:38,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:38,167 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566108096] [2021-06-05 14:16:38,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:38,191 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:16:38,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:38,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566108096] [2021-06-05 14:16:38,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566108096] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:38,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:38,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:38,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259593786] [2021-06-05 14:16:38,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:38,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:38,192 INFO L87 Difference]: Start difference. First operand 135 states and 386 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:38,270 INFO L93 Difference]: Finished difference Result 146 states and 397 transitions. [2021-06-05 14:16:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:38,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:38,271 INFO L225 Difference]: With dead ends: 146 [2021-06-05 14:16:38,271 INFO L226 Difference]: Without dead ends: 143 [2021-06-05 14:16:38,271 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 58.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-06-05 14:16:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2021-06-05 14:16:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.8796992481203008) internal successors, (383), 133 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 383 transitions. [2021-06-05 14:16:38,272 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 383 transitions. Word has length 16 [2021-06-05 14:16:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:38,272 INFO L482 AbstractCegarLoop]: Abstraction has 134 states and 383 transitions. [2021-06-05 14:16:38,273 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 383 transitions. [2021-06-05 14:16:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:38,273 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:38,273 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:16:38,273 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable443 [2021-06-05 14:16:38,273 INFO L430 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:38,273 INFO L82 PathProgramCache]: Analyzing trace with hash -534746868, now seen corresponding path program 88 times [2021-06-05 14:16:38,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:38,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954793900] [2021-06-05 14:16:38,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:38,295 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:16:38,296 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:38,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954793900] [2021-06-05 14:16:38,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954793900] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:38,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:38,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:38,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670768536] [2021-06-05 14:16:38,296 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:38,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:38,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:38,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:38,296 INFO L87 Difference]: Start difference. First operand 134 states and 383 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:38,346 INFO L93 Difference]: Finished difference Result 133 states and 377 transitions. [2021-06-05 14:16:38,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:38,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:38,347 INFO L225 Difference]: With dead ends: 133 [2021-06-05 14:16:38,347 INFO L226 Difference]: Without dead ends: 127 [2021-06-05 14:16:38,347 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.8ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-06-05 14:16:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-06-05 14:16:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.9285714285714284) internal successors, (369), 126 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 369 transitions. [2021-06-05 14:16:38,348 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 369 transitions. Word has length 16 [2021-06-05 14:16:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:38,348 INFO L482 AbstractCegarLoop]: Abstraction has 127 states and 369 transitions. [2021-06-05 14:16:38,348 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 369 transitions. [2021-06-05 14:16:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:38,349 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:38,349 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:16:38,349 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable444 [2021-06-05 14:16:38,349 INFO L430 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:38,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:38,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1956099518, now seen corresponding path program 83 times [2021-06-05 14:16:38,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:38,349 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464582212] [2021-06-05 14:16:38,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:38,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:16:38,373 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:38,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464582212] [2021-06-05 14:16:38,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464582212] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:38,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257492234] [2021-06-05 14:16:38,373 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 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:16:38,399 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:16:38,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:38,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:38,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:38,443 INFO L134 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:16:38,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257492234] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:38,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:38,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 14:16:38,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900120117] [2021-06-05 14:16:38,444 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 14:16:38,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:38,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 14:16:38,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 14:16:38,444 INFO L87 Difference]: Start difference. First operand 127 states and 369 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:16:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:38,526 INFO L93 Difference]: Finished difference Result 176 states and 508 transitions. [2021-06-05 14:16:38,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:38,527 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 16 [2021-06-05 14:16:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:38,527 INFO L225 Difference]: With dead ends: 176 [2021-06-05 14:16:38,527 INFO L226 Difference]: Without dead ends: 176 [2021-06-05 14:16:38,527 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 55.2ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:16:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-06-05 14:16:38,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 121. [2021-06-05 14:16:38,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 2.925) internal successors, (351), 120 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 351 transitions. [2021-06-05 14:16:38,529 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 351 transitions. Word has length 16 [2021-06-05 14:16:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:38,529 INFO L482 AbstractCegarLoop]: Abstraction has 121 states and 351 transitions. [2021-06-05 14:16:38,529 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:16:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 351 transitions. [2021-06-05 14:16:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:38,529 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:38,529 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:16:38,730 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable445 [2021-06-05 14:16:38,730 INFO L430 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:38,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:38,730 INFO L82 PathProgramCache]: Analyzing trace with hash -912267080, now seen corresponding path program 84 times [2021-06-05 14:16:38,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:38,731 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755892063] [2021-06-05 14:16:38,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:38,758 INFO L134 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:16:38,759 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:38,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755892063] [2021-06-05 14:16:38,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755892063] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:38,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093723163] [2021-06-05 14:16:38,759 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 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:16:38,784 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:16:38,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:38,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:38,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:38,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093723163] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:38,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:38,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 14:16:38,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418853458] [2021-06-05 14:16:38,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 14:16:38,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:38,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 14:16:38,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 14:16:38,823 INFO L87 Difference]: Start difference. First operand 121 states and 351 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:16:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:38,918 INFO L93 Difference]: Finished difference Result 193 states and 540 transitions. [2021-06-05 14:16:38,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:38,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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 16 [2021-06-05 14:16:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:38,919 INFO L225 Difference]: With dead ends: 193 [2021-06-05 14:16:38,919 INFO L226 Difference]: Without dead ends: 193 [2021-06-05 14:16:38,919 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 64.8ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:16:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-06-05 14:16:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 123. [2021-06-05 14:16:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.942622950819672) internal successors, (359), 122 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 359 transitions. [2021-06-05 14:16:38,921 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 359 transitions. Word has length 16 [2021-06-05 14:16:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:38,921 INFO L482 AbstractCegarLoop]: Abstraction has 123 states and 359 transitions. [2021-06-05 14:16:38,921 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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:16:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 359 transitions. [2021-06-05 14:16:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:38,921 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:38,921 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:16:39,122 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446,146 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:39,122 INFO L430 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:39,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash 449289026, now seen corresponding path program 85 times [2021-06-05 14:16:39,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:39,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44338255] [2021-06-05 14:16:39,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:39,144 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:39,145 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44338255] [2021-06-05 14:16:39,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44338255] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:39,145 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:39,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:39,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301101035] [2021-06-05 14:16:39,145 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:39,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:39,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:39,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:39,145 INFO L87 Difference]: Start difference. First operand 123 states and 359 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:39,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:39,220 INFO L93 Difference]: Finished difference Result 170 states and 487 transitions. [2021-06-05 14:16:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:39,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:39,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:39,221 INFO L225 Difference]: With dead ends: 170 [2021-06-05 14:16:39,221 INFO L226 Difference]: Without dead ends: 168 [2021-06-05 14:16:39,221 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 43.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-06-05 14:16:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 119. [2021-06-05 14:16:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.9237288135593222) internal successors, (345), 118 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 345 transitions. [2021-06-05 14:16:39,223 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 345 transitions. Word has length 16 [2021-06-05 14:16:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:39,223 INFO L482 AbstractCegarLoop]: Abstraction has 119 states and 345 transitions. [2021-06-05 14:16:39,223 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 345 transitions. [2021-06-05 14:16:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:39,223 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:39,223 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:16:39,223 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447 [2021-06-05 14:16:39,223 INFO L430 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:39,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:39,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1418613346, now seen corresponding path program 86 times [2021-06-05 14:16:39,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:39,224 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704808858] [2021-06-05 14:16:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:39,250 INFO L134 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:16:39,250 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:39,251 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704808858] [2021-06-05 14:16:39,251 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704808858] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:39,251 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742742257] [2021-06-05 14:16:39,251 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 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:16:39,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:39,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:39,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 14:16:39,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:39,339 INFO L134 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:16:39,340 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742742257] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:39,340 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:39,340 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-06-05 14:16:39,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879133048] [2021-06-05 14:16:39,340 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:16:39,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:39,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:16:39,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:16:39,341 INFO L87 Difference]: Start difference. First operand 119 states and 345 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:16:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:39,463 INFO L93 Difference]: Finished difference Result 151 states and 417 transitions. [2021-06-05 14:16:39,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:39,463 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 16 [2021-06-05 14:16:39,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:39,463 INFO L225 Difference]: With dead ends: 151 [2021-06-05 14:16:39,463 INFO L226 Difference]: Without dead ends: 151 [2021-06-05 14:16:39,464 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 85.4ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:16:39,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-06-05 14:16:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 118. [2021-06-05 14:16:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.871794871794872) internal successors, (336), 117 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 336 transitions. [2021-06-05 14:16:39,466 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 336 transitions. Word has length 16 [2021-06-05 14:16:39,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:39,466 INFO L482 AbstractCegarLoop]: Abstraction has 118 states and 336 transitions. [2021-06-05 14:16:39,466 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:16:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 336 transitions. [2021-06-05 14:16:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:39,466 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:39,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:16:39,680 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 147 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable448 [2021-06-05 14:16:39,681 INFO L430 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:39,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash -57057240, now seen corresponding path program 87 times [2021-06-05 14:16:39,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:39,681 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896316734] [2021-06-05 14:16:39,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:39,707 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:16:39,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:39,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896316734] [2021-06-05 14:16:39,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896316734] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:39,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:39,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:39,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333885779] [2021-06-05 14:16:39,707 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:39,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:39,708 INFO L87 Difference]: Start difference. First operand 118 states and 336 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:39,814 INFO L93 Difference]: Finished difference Result 147 states and 400 transitions. [2021-06-05 14:16:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:39,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:39,815 INFO L225 Difference]: With dead ends: 147 [2021-06-05 14:16:39,815 INFO L226 Difference]: Without dead ends: 145 [2021-06-05 14:16:39,815 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.5ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-06-05 14:16:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2021-06-05 14:16:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.8521739130434782) internal successors, (328), 115 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 328 transitions. [2021-06-05 14:16:39,816 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 328 transitions. Word has length 16 [2021-06-05 14:16:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:39,816 INFO L482 AbstractCegarLoop]: Abstraction has 116 states and 328 transitions. [2021-06-05 14:16:39,816 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 328 transitions. [2021-06-05 14:16:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 14:16:39,817 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:39,817 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:16:39,817 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449 [2021-06-05 14:16:39,817 INFO L430 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:39,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:39,817 INFO L82 PathProgramCache]: Analyzing trace with hash -592287042, now seen corresponding path program 88 times [2021-06-05 14:16:39,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:39,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720563578] [2021-06-05 14:16:39,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:39,843 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:16:39,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:39,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720563578] [2021-06-05 14:16:39,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720563578] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 14:16:39,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 14:16:39,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 14:16:39,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406569420] [2021-06-05 14:16:39,843 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 14:16:39,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:39,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 14:16:39,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 14:16:39,844 INFO L87 Difference]: Start difference. First operand 116 states and 328 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:39,926 INFO L93 Difference]: Finished difference Result 124 states and 350 transitions. [2021-06-05 14:16:39,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 14:16:39,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:39,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:39,926 INFO L225 Difference]: With dead ends: 124 [2021-06-05 14:16:39,926 INFO L226 Difference]: Without dead ends: 120 [2021-06-05 14:16:39,927 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.9ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:16:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-06-05 14:16:39,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2021-06-05 14:16:39,928 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:16:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 308 transitions. [2021-06-05 14:16:39,928 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 308 transitions. Word has length 16 [2021-06-05 14:16:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:39,929 INFO L482 AbstractCegarLoop]: Abstraction has 108 states and 308 transitions. [2021-06-05 14:16:39,929 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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:16:39,929 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 308 transitions. [2021-06-05 14:16:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:16:39,929 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:39,929 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:16:39,929 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450 [2021-06-05 14:16:39,929 INFO L430 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:39,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1638627788, now seen corresponding path program 1 times [2021-06-05 14:16:39,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:39,929 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028657656] [2021-06-05 14:16:39,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:40,249 INFO L134 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:16:40,249 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:40,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028657656] [2021-06-05 14:16:40,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028657656] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:40,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022719578] [2021-06-05 14:16:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:16:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:40,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:16:40,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:40,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:40,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 25 treesize of output 19 [2021-06-05 14:16:40,434 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:40,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:40,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:16:40,441 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:40,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:40,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 25 treesize of output 19 [2021-06-05 14:16:40,452 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:40,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 35 treesize of output 27 [2021-06-05 14:16:40,458 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:40,497 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:40,499 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:16:40,499 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:113 [2021-06-05 14:16:40,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 17 treesize of output 13 [2021-06-05 14:16:40,799 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:40,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 29 treesize of output 23 [2021-06-05 14:16:40,803 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:40,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 17 treesize of output 13 [2021-06-05 14:16:40,808 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:40,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 17 treesize of output 13 [2021-06-05 14:16:40,812 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:40,885 INFO L628 ElimStorePlain]: treesize reduction 78, result has 57.1 percent of original size [2021-06-05 14:16:40,886 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:16:40,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 27 treesize of output 21 [2021-06-05 14:16:40,890 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:40,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 21 treesize of output 17 [2021-06-05 14:16:40,894 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:40,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 27 treesize of output 21 [2021-06-05 14:16:40,897 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:40,931 INFO L628 ElimStorePlain]: treesize reduction 20, result has 66.1 percent of original size [2021-06-05 14:16:40,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 12 treesize of output 8 [2021-06-05 14:16:40,935 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:16:40,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:40,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:16:40,949 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:224, output treesize:32 [2021-06-05 14:16:40,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:16:40,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022719578] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:40,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:40,994 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 14:16:40,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050458849] [2021-06-05 14:16:40,994 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:16:40,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:40,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:16:40,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:16:40,995 INFO L87 Difference]: Start difference. First operand 108 states and 308 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:16:41,506 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2021-06-05 14:16:41,787 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2021-06-05 14:16:41,935 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2021-06-05 14:16:42,274 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2021-06-05 14:16:42,846 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2021-06-05 14:16:43,129 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2021-06-05 14:16:43,377 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2021-06-05 14:16:43,777 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 85 [2021-06-05 14:16:44,216 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 93 [2021-06-05 14:16:44,609 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2021-06-05 14:16:44,805 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2021-06-05 14:16:45,181 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2021-06-05 14:16:45,541 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 82 [2021-06-05 14:16:45,949 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2021-06-05 14:16:46,309 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2021-06-05 14:16:46,721 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2021-06-05 14:16:46,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:46,784 INFO L93 Difference]: Finished difference Result 324 states and 849 transitions. [2021-06-05 14:16:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 14:16:46,784 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 17 [2021-06-05 14:16:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:46,785 INFO L225 Difference]: With dead ends: 324 [2021-06-05 14:16:46,785 INFO L226 Difference]: Without dead ends: 281 [2021-06-05 14:16:46,785 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 5679.7ms TimeCoverageRelationStatistics Valid=321, Invalid=1239, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 14:16:46,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-06-05 14:16:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 167. [2021-06-05 14:16:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.86144578313253) internal successors, (475), 166 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 475 transitions. [2021-06-05 14:16:46,787 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 475 transitions. Word has length 17 [2021-06-05 14:16:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:46,787 INFO L482 AbstractCegarLoop]: Abstraction has 167 states and 475 transitions. [2021-06-05 14:16:46,788 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:16:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 475 transitions. [2021-06-05 14:16:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:16:46,788 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:46,788 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:16:46,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451,148 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:46,988 INFO L430 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash -310438566, now seen corresponding path program 2 times [2021-06-05 14:16:46,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:46,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810373504] [2021-06-05 14:16:46,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:47,406 INFO L134 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:16:47,406 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:47,406 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810373504] [2021-06-05 14:16:47,406 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810373504] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:47,406 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329955877] [2021-06-05 14:16:47,406 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 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:16:47,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:16:47,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:47,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:16:47,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:47,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:47,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:16:47,552 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:47,555 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:47,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 35 treesize of output 27 [2021-06-05 14:16:47,557 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:47,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:47,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 25 treesize of output 19 [2021-06-05 14:16:47,562 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:47,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 25 treesize of output 19 [2021-06-05 14:16:47,567 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:47,610 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:47,612 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:16:47,612 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:139 [2021-06-05 14:16:47,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 17 treesize of output 13 [2021-06-05 14:16:47,831 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:47,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 27 treesize of output 21 [2021-06-05 14:16:47,836 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:47,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:16:47,841 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:47,899 INFO L628 ElimStorePlain]: treesize reduction 52, result has 67.5 percent of original size [2021-06-05 14:16:47,899 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:16:47,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 27 treesize of output 21 [2021-06-05 14:16:47,910 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:47,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:47,947 INFO L518 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2021-06-05 14:16:47,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 29 treesize of output 23 [2021-06-05 14:16:47,951 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:47,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 21 treesize of output 17 [2021-06-05 14:16:47,954 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:47,980 INFO L628 ElimStorePlain]: treesize reduction 20, result has 66.1 percent of original size [2021-06-05 14:16:47,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 12 treesize of output 8 [2021-06-05 14:16:47,983 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:16:47,993 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:47,994 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:16:47,994 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:191, output treesize:32 [2021-06-05 14:16:48,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:16:48,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329955877] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:48,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:48,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 14:16:48,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139741179] [2021-06-05 14:16:48,045 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:16:48,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:48,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:16:48,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:16:48,045 INFO L87 Difference]: Start difference. First operand 167 states and 475 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:16:48,880 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-06-05 14:16:49,123 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2021-06-05 14:16:49,337 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2021-06-05 14:16:49,610 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-06-05 14:16:49,985 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 90 [2021-06-05 14:16:50,384 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 88 [2021-06-05 14:16:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:50,507 INFO L93 Difference]: Finished difference Result 264 states and 736 transitions. [2021-06-05 14:16:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 14:16:50,507 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 17 [2021-06-05 14:16:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:50,508 INFO L225 Difference]: With dead ends: 264 [2021-06-05 14:16:50,508 INFO L226 Difference]: Without dead ends: 252 [2021-06-05 14:16:50,508 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2501.3ms TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2021-06-05 14:16:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-06-05 14:16:50,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 176. [2021-06-05 14:16:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 2.9257142857142857) internal successors, (512), 175 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:16:50,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 512 transitions. [2021-06-05 14:16:50,511 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 512 transitions. Word has length 17 [2021-06-05 14:16:50,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:50,511 INFO L482 AbstractCegarLoop]: Abstraction has 176 states and 512 transitions. [2021-06-05 14:16:50,511 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:16:50,511 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 512 transitions. [2021-06-05 14:16:50,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:16:50,511 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:50,511 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:16:50,711 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 149 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable463 [2021-06-05 14:16:50,712 INFO L430 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:50,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:50,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1170799304, now seen corresponding path program 3 times [2021-06-05 14:16:50,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:50,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418558628] [2021-06-05 14:16:50,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:50,934 INFO L134 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:16:50,934 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:50,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418558628] [2021-06-05 14:16:50,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418558628] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:50,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405727484] [2021-06-05 14:16:50,934 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 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:16:50,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:16:50,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:50,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:16:50,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:51,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 25 treesize of output 19 [2021-06-05 14:16:51,110 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,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 35 treesize of output 27 [2021-06-05 14:16:51,115 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,156 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:51,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:16:51,161 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:16:51,166 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:51,206 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:16:51,206 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:152, output treesize:117 [2021-06-05 14:16:51,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:51,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 25 treesize of output 19 [2021-06-05 14:16:51,310 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:51,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:16:51,315 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:51,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:16:51,321 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:51,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 14:16:51,327 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:51,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:16:51,333 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:51,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 38 treesize of output 30 [2021-06-05 14:16:51,338 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:51,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 17 treesize of output 13 [2021-06-05 14:16:51,344 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:16:51,348 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,450 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2021-06-05 14:16:51,450 INFO L628 ElimStorePlain]: treesize reduction 110, result has 55.8 percent of original size [2021-06-05 14:16:51,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:51,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 22 treesize of output 14 [2021-06-05 14:16:51,454 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:51,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 11 treesize of output 7 [2021-06-05 14:16:51,458 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:16:51,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:51,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 10 treesize of output 6 [2021-06-05 14:16:51,463 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:16:51,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 14:16:51,466 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:51,501 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:51,502 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:16:51,502 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:321, output treesize:97 [2021-06-05 14:16:51,627 INFO L134 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:16:51,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405727484] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:51,627 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:51,628 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:16:51,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158433327] [2021-06-05 14:16:51,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:16:51,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:51,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:16:51,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:16:51,628 INFO L87 Difference]: Start difference. First operand 176 states and 512 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:16:52,437 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2021-06-05 14:16:52,668 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 68 [2021-06-05 14:16:52,865 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2021-06-05 14:16:53,061 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2021-06-05 14:16:53,284 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2021-06-05 14:16:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:53,491 INFO L93 Difference]: Finished difference Result 283 states and 795 transitions. [2021-06-05 14:16:53,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 14:16:53,492 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:16:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:53,492 INFO L225 Difference]: With dead ends: 283 [2021-06-05 14:16:53,492 INFO L226 Difference]: Without dead ends: 252 [2021-06-05 14:16:53,492 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1863.1ms TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:16:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-06-05 14:16:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 180. [2021-06-05 14:16:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.916201117318436) internal successors, (522), 179 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 522 transitions. [2021-06-05 14:16:53,495 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 522 transitions. Word has length 17 [2021-06-05 14:16:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:53,495 INFO L482 AbstractCegarLoop]: Abstraction has 180 states and 522 transitions. [2021-06-05 14:16:53,495 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:16:53,495 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 522 transitions. [2021-06-05 14:16:53,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:16:53,496 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:53,496 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:16:53,700 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 150 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable479 [2021-06-05 14:16:53,701 INFO L430 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:53,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:53,701 INFO L82 PathProgramCache]: Analyzing trace with hash 227417012, now seen corresponding path program 4 times [2021-06-05 14:16:53,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:53,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160358562] [2021-06-05 14:16:53,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:54,045 INFO L134 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:16:54,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:54,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160358562] [2021-06-05 14:16:54,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160358562] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:54,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365020026] [2021-06-05 14:16:54,046 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 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:16:54,079 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:16:54,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:54,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:16:54,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:54,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 25 treesize of output 19 [2021-06-05 14:16:54,328 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:54,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 25 treesize of output 19 [2021-06-05 14:16:54,332 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:54,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:16:54,336 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:54,442 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2021-06-05 14:16:54,443 INFO L628 ElimStorePlain]: treesize reduction 62, result has 72.1 percent of original size [2021-06-05 14:16:54,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 15 treesize of output 11 [2021-06-05 14:16:54,447 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:54,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 25 treesize of output 19 [2021-06-05 14:16:54,450 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:54,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:16:54,453 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:54,523 INFO L628 ElimStorePlain]: treesize reduction 4, result has 97.0 percent of original size [2021-06-05 14:16:54,525 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:16:54,525 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:245, output treesize:131 [2021-06-05 14:16:54,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 17 treesize of output 13 [2021-06-05 14:16:54,742 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:54,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 19 treesize of output 15 [2021-06-05 14:16:54,746 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:54,814 INFO L628 ElimStorePlain]: treesize reduction 16, result has 88.5 percent of original size [2021-06-05 14:16:54,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 10 treesize of output 6 [2021-06-05 14:16:54,819 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:16:54,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:54,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 29 treesize of output 23 [2021-06-05 14:16:54,857 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:54,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 31 treesize of output 25 [2021-06-05 14:16:54,862 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:54,907 INFO L628 ElimStorePlain]: treesize reduction 9, result has 88.3 percent of original size [2021-06-05 14:16:54,907 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:16:54,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 27 treesize of output 21 [2021-06-05 14:16:54,911 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:54,941 INFO L628 ElimStorePlain]: treesize reduction 16, result has 67.3 percent of original size [2021-06-05 14:16:54,941 INFO L518 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2021-06-05 14:16:54,942 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:16:54,942 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:152, output treesize:32 [2021-06-05 14:16:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:16:54,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365020026] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:54,981 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:54,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 14:16:54,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905587516] [2021-06-05 14:16:54,982 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:16:54,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:54,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:16:54,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:16:54,982 INFO L87 Difference]: Start difference. First operand 180 states and 522 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:16:55,664 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2021-06-05 14:16:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:55,838 INFO L93 Difference]: Finished difference Result 265 states and 737 transitions. [2021-06-05 14:16:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 14:16:55,839 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 17 [2021-06-05 14:16:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:55,839 INFO L225 Difference]: With dead ends: 265 [2021-06-05 14:16:55,839 INFO L226 Difference]: Without dead ends: 259 [2021-06-05 14:16:55,839 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1065.2ms TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:16:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-06-05 14:16:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 184. [2021-06-05 14:16:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.907103825136612) internal successors, (532), 183 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 532 transitions. [2021-06-05 14:16:55,842 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 532 transitions. Word has length 17 [2021-06-05 14:16:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:55,842 INFO L482 AbstractCegarLoop]: Abstraction has 184 states and 532 transitions. [2021-06-05 14:16:55,842 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:16:55,842 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 532 transitions. [2021-06-05 14:16:55,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:16:55,843 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:55,843 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:16:56,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable495,151 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:56,053 INFO L430 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:56,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:56,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1708654882, now seen corresponding path program 5 times [2021-06-05 14:16:56,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:56,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181192092] [2021-06-05 14:16:56,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:56,368 INFO L134 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:16:56,368 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:56,368 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181192092] [2021-06-05 14:16:56,368 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181192092] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:56,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489182074] [2021-06-05 14:16:56,369 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 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:16:56,401 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:16:56,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:56,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:16:56,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:56,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 25 treesize of output 19 [2021-06-05 14:16:56,575 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,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 25 treesize of output 19 [2021-06-05 14:16:56,580 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,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 15 treesize of output 11 [2021-06-05 14:16:56,585 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,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 25 treesize of output 19 [2021-06-05 14:16:56,590 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:16:56,595 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,694 INFO L628 ElimStorePlain]: treesize reduction 52, result has 75.7 percent of original size [2021-06-05 14:16:56,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 25 treesize of output 19 [2021-06-05 14:16:56,699 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:16:56,703 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:16:56,706 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:56,745 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:16:56,745 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:257, output treesize:142 [2021-06-05 14:16:56,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 28 treesize of output 22 [2021-06-05 14:16:56,877 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,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 24 [2021-06-05 14:16:56,881 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,930 INFO L628 ElimStorePlain]: treesize reduction 11, result has 88.4 percent of original size [2021-06-05 14:16:56,930 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:16:56,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 27 treesize of output 21 [2021-06-05 14:16:56,934 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,968 INFO L628 ElimStorePlain]: treesize reduction 14, result has 78.5 percent of original size [2021-06-05 14:16:56,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 27 treesize of output 21 [2021-06-05 14:16:56,972 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:56,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:56,985 INFO L518 ElimStorePlain]: Eliminatee v_prenex_16 vanished before elimination [2021-06-05 14:16:56,985 INFO L518 ElimStorePlain]: Eliminatee v_prenex_15 vanished before elimination [2021-06-05 14:16:56,985 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:16:56,986 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:133, output treesize:32 [2021-06-05 14:16:57,029 INFO L134 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:16:57,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489182074] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:57,029 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:57,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:16:57,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416974489] [2021-06-05 14:16:57,030 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:16:57,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:16:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:16:57,030 INFO L87 Difference]: Start difference. First operand 184 states and 532 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:16:57,617 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 77 [2021-06-05 14:16:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:16:57,846 INFO L93 Difference]: Finished difference Result 279 states and 768 transitions. [2021-06-05 14:16:57,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:16:57,846 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:16:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:16:57,847 INFO L225 Difference]: With dead ends: 279 [2021-06-05 14:16:57,847 INFO L226 Difference]: Without dead ends: 256 [2021-06-05 14:16:57,847 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1002.8ms TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:16:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-06-05 14:16:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 182. [2021-06-05 14:16:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.911602209944751) internal successors, (527), 181 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:16:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 527 transitions. [2021-06-05 14:16:57,850 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 527 transitions. Word has length 17 [2021-06-05 14:16:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:16:57,850 INFO L482 AbstractCegarLoop]: Abstraction has 182 states and 527 transitions. [2021-06-05 14:16:57,850 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:16:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 527 transitions. [2021-06-05 14:16:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:16:57,850 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:16:57,851 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:16:58,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519,152 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:16:58,061 INFO L430 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:16:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:16:58,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1137200076, now seen corresponding path program 6 times [2021-06-05 14:16:58,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:16:58,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695383382] [2021-06-05 14:16:58,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:16:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:16:58,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:16:58,348 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:16:58,348 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695383382] [2021-06-05 14:16:58,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695383382] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:58,348 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190429510] [2021-06-05 14:16:58,348 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 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:16:58,386 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:16:58,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:16:58,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:16:58,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:16:58,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:58,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:16:58,622 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:58,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:58,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:16:58,627 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:58,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:58,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:16:58,632 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:58,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:16:58,636 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:58,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:58,675 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:16:58,675 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:139, output treesize:104 [2021-06-05 14:16:58,844 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_18], 1=[v_prenex_19, array_4]} [2021-06-05 14:16:58,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 38 treesize of output 30 [2021-06-05 14:16:58,850 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:58,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 25 treesize of output 19 [2021-06-05 14:16:58,855 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:58,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 27 treesize of output 21 [2021-06-05 14:16:58,861 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:58,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 35 treesize of output 27 [2021-06-05 14:16:58,867 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:58,988 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2021-06-05 14:16:58,988 INFO L628 ElimStorePlain]: treesize reduction 137, result has 52.1 percent of original size [2021-06-05 14:16:58,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 18 treesize of output 14 [2021-06-05 14:16:58,992 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:58,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 7 treesize of output 5 [2021-06-05 14:16:58,997 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:59,043 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:59,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:16:59,048 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:16:59,091 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:59,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:59,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:16:59,097 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:16:59,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:16:59,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 11 treesize of output 7 [2021-06-05 14:16:59,102 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:16:59,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 24 treesize of output 16 [2021-06-05 14:16:59,106 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:16:59,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:16:59,149 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:16:59,149 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:327, output treesize:102 [2021-06-05 14:16:59,288 INFO L134 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:16:59,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190429510] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:16:59,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:16:59,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:16:59,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699999136] [2021-06-05 14:16:59,288 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:16:59,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:16:59,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:16:59,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:16:59,289 INFO L87 Difference]: Start difference. First operand 182 states and 527 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:16:59,866 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2021-06-05 14:17:00,142 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2021-06-05 14:17:00,314 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2021-06-05 14:17:00,468 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2021-06-05 14:17:00,694 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 68 [2021-06-05 14:17:00,953 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-06-05 14:17:01,207 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2021-06-05 14:17:01,498 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2021-06-05 14:17:01,798 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2021-06-05 14:17:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:01,888 INFO L93 Difference]: Finished difference Result 416 states and 1139 transitions. [2021-06-05 14:17:01,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 14:17:01,888 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:01,889 INFO L225 Difference]: With dead ends: 416 [2021-06-05 14:17:01,889 INFO L226 Difference]: Without dead ends: 306 [2021-06-05 14:17:01,889 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2570.5ms TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2021-06-05 14:17:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-06-05 14:17:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 211. [2021-06-05 14:17:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.9714285714285715) internal successors, (624), 210 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:17:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 624 transitions. [2021-06-05 14:17:01,892 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 624 transitions. Word has length 17 [2021-06-05 14:17:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:01,892 INFO L482 AbstractCegarLoop]: Abstraction has 211 states and 624 transitions. [2021-06-05 14:17:01,892 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 624 transitions. [2021-06-05 14:17:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:01,893 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:01,893 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:17:02,093 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549,153 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:17:02,093 INFO L430 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:02,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1264185258, now seen corresponding path program 7 times [2021-06-05 14:17:02,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:02,094 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570854938] [2021-06-05 14:17:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:02,489 INFO L134 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:17:02,490 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:02,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570854938] [2021-06-05 14:17:02,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570854938] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:02,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556323357] [2021-06-05 14:17:02,490 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 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:17:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:02,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:02,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:02,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 25 treesize of output 19 [2021-06-05 14:17:02,640 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:02,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 15 treesize of output 11 [2021-06-05 14:17:02,645 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:02,667 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:02,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 27 treesize of output 21 [2021-06-05 14:17:02,671 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:02,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 25 treesize of output 19 [2021-06-05 14:17:02,675 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:02,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:02,693 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:02,693 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:66 [2021-06-05 14:17:02,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 17 treesize of output 13 [2021-06-05 14:17:02,813 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:02,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 19 treesize of output 15 [2021-06-05 14:17:02,818 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:02,861 INFO L628 ElimStorePlain]: treesize reduction 66, result has 52.9 percent of original size [2021-06-05 14:17:02,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 29 treesize of output 23 [2021-06-05 14:17:02,865 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:02,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:02,880 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:17:02,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 19 treesize of output 15 [2021-06-05 14:17:02,883 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:02,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:02,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 10 treesize of output 6 [2021-06-05 14:17:02,899 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:02,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:02,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 11 treesize of output 7 [2021-06-05 14:17:02,917 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:02,930 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:02,931 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:02,931 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:154, output treesize:32 [2021-06-05 14:17:02,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:17:02,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556323357] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:02,971 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:02,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:02,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82480034] [2021-06-05 14:17:02,972 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:02,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:02,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:02,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:02,972 INFO L87 Difference]: Start difference. First operand 211 states and 624 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:03,332 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2021-06-05 14:17:03,619 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2021-06-05 14:17:03,842 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2021-06-05 14:17:04,141 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 85 [2021-06-05 14:17:04,347 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2021-06-05 14:17:04,581 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2021-06-05 14:17:04,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:04,686 INFO L93 Difference]: Finished difference Result 341 states and 923 transitions. [2021-06-05 14:17:04,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:17:04,686 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:04,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:04,687 INFO L225 Difference]: With dead ends: 341 [2021-06-05 14:17:04,687 INFO L226 Difference]: Without dead ends: 316 [2021-06-05 14:17:04,687 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1747.7ms TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:17:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-06-05 14:17:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 208. [2021-06-05 14:17:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.9855072463768115) internal successors, (618), 207 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:17:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 618 transitions. [2021-06-05 14:17:04,690 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 618 transitions. Word has length 17 [2021-06-05 14:17:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:04,690 INFO L482 AbstractCegarLoop]: Abstraction has 208 states and 618 transitions. [2021-06-05 14:17:04,690 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 618 transitions. [2021-06-05 14:17:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:04,691 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:04,691 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:17:04,900 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 154 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable564 [2021-06-05 14:17:04,901 INFO L430 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:04,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:04,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1508275688, now seen corresponding path program 8 times [2021-06-05 14:17:04,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:04,901 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039816693] [2021-06-05 14:17:04,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:05,301 INFO L134 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:17:05,301 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:05,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039816693] [2021-06-05 14:17:05,302 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039816693] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:05,302 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020584539] [2021-06-05 14:17:05,302 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 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:17:05,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:17:05,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:05,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:05,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:05,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 25 treesize of output 19 [2021-06-05 14:17:05,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:05,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:05,473 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:05,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:05,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 15 treesize of output 11 [2021-06-05 14:17:05,504 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:05,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 25 treesize of output 19 [2021-06-05 14:17:05,508 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:05,529 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:05,530 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:05,530 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:74 [2021-06-05 14:17:05,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 17 treesize of output 13 [2021-06-05 14:17:05,636 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:05,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 19 treesize of output 15 [2021-06-05 14:17:05,640 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:05,670 INFO L628 ElimStorePlain]: treesize reduction 39, result has 64.5 percent of original size [2021-06-05 14:17:05,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:17:05,674 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:05,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:05,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 27 treesize of output 21 [2021-06-05 14:17:05,692 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:05,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:05,704 INFO L518 ElimStorePlain]: Eliminatee v_prenex_28 vanished before elimination [2021-06-05 14:17:05,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 19 treesize of output 15 [2021-06-05 14:17:05,708 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:05,719 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:05,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:17:05,722 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:05,733 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:05,734 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:05,734 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 14:17:05,847 INFO L134 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:17:05,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020584539] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:05,847 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:05,847 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:05,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752182752] [2021-06-05 14:17:05,847 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:05,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:05,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:05,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:05,848 INFO L87 Difference]: Start difference. First operand 208 states and 618 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:06,475 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2021-06-05 14:17:06,748 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-06-05 14:17:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:07,097 INFO L93 Difference]: Finished difference Result 298 states and 856 transitions. [2021-06-05 14:17:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:17:07,098 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:07,098 INFO L225 Difference]: With dead ends: 298 [2021-06-05 14:17:07,099 INFO L226 Difference]: Without dead ends: 276 [2021-06-05 14:17:07,099 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1277.7ms TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:17:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-06-05 14:17:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 220. [2021-06-05 14:17:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.9680365296803655) internal successors, (650), 219 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:17:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 650 transitions. [2021-06-05 14:17:07,101 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 650 transitions. Word has length 17 [2021-06-05 14:17:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:07,101 INFO L482 AbstractCegarLoop]: Abstraction has 220 states and 650 transitions. [2021-06-05 14:17:07,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 650 transitions. [2021-06-05 14:17:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:07,102 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:07,102 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:17:07,302 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 155 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable573 [2021-06-05 14:17:07,303 INFO L430 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:07,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash -27037818, now seen corresponding path program 9 times [2021-06-05 14:17:07,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:07,303 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052394409] [2021-06-05 14:17:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:07,741 INFO L134 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:17:07,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:07,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052394409] [2021-06-05 14:17:07,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052394409] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:07,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167920450] [2021-06-05 14:17:07,742 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 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:17:07,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:17:07,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:07,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:07,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:07,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 25 treesize of output 19 [2021-06-05 14:17:07,923 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17: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 27 treesize of output 21 [2021-06-05 14:17:07,926 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:07,951 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:07,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 15 treesize of output 11 [2021-06-05 14:17:07,959 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:07,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 25 treesize of output 19 [2021-06-05 14:17:07,964 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:07,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:07,986 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:07,986 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:77 [2021-06-05 14:17:08,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:17:08,071 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:08,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 14:17:08,075 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:08,110 INFO L628 ElimStorePlain]: treesize reduction 17, result has 81.5 percent of original size [2021-06-05 14:17:08,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 27 treesize of output 21 [2021-06-05 14:17:08,114 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:08,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:08,128 INFO L518 ElimStorePlain]: Eliminatee v_prenex_31 vanished before elimination [2021-06-05 14:17:08,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 10 treesize of output 6 [2021-06-05 14:17:08,132 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:08,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:08,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:08,151 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:08,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:08,163 INFO L518 ElimStorePlain]: Eliminatee v_prenex_33 vanished before elimination [2021-06-05 14:17:08,164 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:08,164 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:106, output treesize:32 [2021-06-05 14:17:08,206 INFO L134 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:17:08,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167920450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:08,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:08,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:08,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073804810] [2021-06-05 14:17:08,207 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:08,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:08,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:08,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:08,208 INFO L87 Difference]: Start difference. First operand 220 states and 650 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:08,819 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2021-06-05 14:17:09,128 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2021-06-05 14:17:09,421 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2021-06-05 14:17:09,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:09,512 INFO L93 Difference]: Finished difference Result 308 states and 858 transitions. [2021-06-05 14:17:09,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:17:09,512 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:09,513 INFO L225 Difference]: With dead ends: 308 [2021-06-05 14:17:09,513 INFO L226 Difference]: Without dead ends: 268 [2021-06-05 14:17:09,513 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1396.3ms TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:17:09,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-06-05 14:17:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 210. [2021-06-05 14:17:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 2.971291866028708) internal successors, (621), 209 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:17:09,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 621 transitions. [2021-06-05 14:17:09,516 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 621 transitions. Word has length 17 [2021-06-05 14:17:09,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:09,516 INFO L482 AbstractCegarLoop]: Abstraction has 210 states and 621 transitions. [2021-06-05 14:17:09,516 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:09,516 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 621 transitions. [2021-06-05 14:17:09,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:09,517 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:09,517 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:17:09,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable582,156 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:17:09,725 INFO L430 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:09,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:09,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1496339310, now seen corresponding path program 10 times [2021-06-05 14:17:09,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:09,725 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402240887] [2021-06-05 14:17:09,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:10,285 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-05 14:17:10,285 INFO L134 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:17:10,286 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:10,286 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402240887] [2021-06-05 14:17:10,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402240887] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:10,286 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785263930] [2021-06-05 14:17:10,286 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:17:10,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:17:10,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:10,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:10,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:10,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 25 treesize of output 19 [2021-06-05 14:17:10,403 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:10,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 15 treesize of output 11 [2021-06-05 14:17:10,407 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:10,429 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:10,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 27 treesize of output 21 [2021-06-05 14:17:10,433 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:10,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 25 treesize of output 19 [2021-06-05 14:17:10,437 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:10,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:10,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:10,454 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:60 [2021-06-05 14:17:10,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 17 treesize of output 13 [2021-06-05 14:17:10,554 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:10,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 19 treesize of output 15 [2021-06-05 14:17:10,557 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:10,600 INFO L628 ElimStorePlain]: treesize reduction 60, result has 53.1 percent of original size [2021-06-05 14:17:10,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:17:10,605 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:10,622 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:10,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 19 treesize of output 15 [2021-06-05 14:17:10,626 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:10,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:10,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 19 treesize of output 15 [2021-06-05 14:17:10,646 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:10,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:10,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 12 treesize of output 8 [2021-06-05 14:17:10,663 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:10,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:10,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 14:17:10,680 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:10,693 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:10,694 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:10,694 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:142, output treesize:32 [2021-06-05 14:17:10,734 INFO L134 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:17:10,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785263930] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:10,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:10,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:10,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227755858] [2021-06-05 14:17:10,735 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:10,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:10,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:10,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:10,735 INFO L87 Difference]: Start difference. First operand 210 states and 621 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:12,072 INFO L93 Difference]: Finished difference Result 379 states and 1063 transitions. [2021-06-05 14:17:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:17:12,073 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:12,074 INFO L225 Difference]: With dead ends: 379 [2021-06-05 14:17:12,074 INFO L226 Difference]: Without dead ends: 345 [2021-06-05 14:17:12,074 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1468.3ms TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:17:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-06-05 14:17:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 221. [2021-06-05 14:17:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 3.0136363636363637) internal successors, (663), 220 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:17:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 663 transitions. [2021-06-05 14:17:12,078 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 663 transitions. Word has length 17 [2021-06-05 14:17:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:12,078 INFO L482 AbstractCegarLoop]: Abstraction has 221 states and 663 transitions. [2021-06-05 14:17:12,078 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 663 transitions. [2021-06-05 14:17:12,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:12,078 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:12,078 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:17:12,296 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591,157 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:17:12,297 INFO L430 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:12,297 INFO L82 PathProgramCache]: Analyzing trace with hash 849561632, now seen corresponding path program 11 times [2021-06-05 14:17:12,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:12,297 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145322501] [2021-06-05 14:17:12,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:17:12,629 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:12,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145322501] [2021-06-05 14:17:12,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145322501] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:12,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483513133] [2021-06-05 14:17:12,629 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 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:17:12,658 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:17:12,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:12,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 14:17:12,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:12,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 25 treesize of output 19 [2021-06-05 14:17:12,801 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:12,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 27 treesize of output 21 [2021-06-05 14:17:12,805 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:12,832 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:12,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 25 treesize of output 19 [2021-06-05 14:17:12,836 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:12,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 15 treesize of output 11 [2021-06-05 14:17:12,839 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:12,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:12,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:12,863 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:76 [2021-06-05 14:17:12,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 17 treesize of output 13 [2021-06-05 14:17:12,942 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:12,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 19 treesize of output 15 [2021-06-05 14:17:12,946 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:12,991 INFO L628 ElimStorePlain]: treesize reduction 66, result has 52.5 percent of original size [2021-06-05 14:17:12,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 14:17:12,995 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:13,010 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:13,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:17:13,014 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:13,028 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:13,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 12 treesize of output 8 [2021-06-05 14:17:13,033 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:13,046 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:13,046 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:17:13,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:17:13,050 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:13,063 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:13,064 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:13,065 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:154, output treesize:32 [2021-06-05 14:17:13,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:17:13,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483513133] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:13,109 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:13,109 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:13,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820291512] [2021-06-05 14:17:13,109 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:13,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:13,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:13,110 INFO L87 Difference]: Start difference. First operand 221 states and 663 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:13,322 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2021-06-05 14:17:14,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:14,217 INFO L93 Difference]: Finished difference Result 288 states and 848 transitions. [2021-06-05 14:17:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:17:14,218 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:14,218 INFO L225 Difference]: With dead ends: 288 [2021-06-05 14:17:14,218 INFO L226 Difference]: Without dead ends: 269 [2021-06-05 14:17:14,219 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1125.4ms TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:17:14,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-06-05 14:17:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 224. [2021-06-05 14:17:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 3.013452914798206) internal successors, (672), 223 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:17:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 672 transitions. [2021-06-05 14:17:14,222 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 672 transitions. Word has length 17 [2021-06-05 14:17:14,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:14,222 INFO L482 AbstractCegarLoop]: Abstraction has 224 states and 672 transitions. [2021-06-05 14:17:14,222 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 672 transitions. [2021-06-05 14:17:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:14,223 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:14,223 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:17:14,436 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 158 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable600 [2021-06-05 14:17:14,437 INFO L430 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:14,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1964167794, now seen corresponding path program 12 times [2021-06-05 14:17:14,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:14,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698131926] [2021-06-05 14:17:14,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:14,725 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2021-06-05 14:17:14,927 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2021-06-05 14:17:15,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:17:15,129 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:15,129 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698131926] [2021-06-05 14:17:15,129 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698131926] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:15,129 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458391285] [2021-06-05 14:17:15,129 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:15,163 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:17:15,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:15,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:15,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:15,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:15,272 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:15,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:15,276 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:15,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:15,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 25 treesize of output 19 [2021-06-05 14:17:15,308 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:15,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:17:15,311 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:15,333 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:15,334 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:15,334 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:79 [2021-06-05 14:17:15,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:17:15,398 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:15,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 17 treesize of output 13 [2021-06-05 14:17:15,402 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:15,442 INFO L628 ElimStorePlain]: treesize reduction 44, result has 63.6 percent of original size [2021-06-05 14:17:15,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 11 treesize of output 7 [2021-06-05 14:17:15,447 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:15,463 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:15,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 28 treesize of output 22 [2021-06-05 14:17:15,467 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:15,481 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:15,481 INFO L518 ElimStorePlain]: Eliminatee v_prenex_46 vanished before elimination [2021-06-05 14:17:15,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:15,484 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:15,495 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:15,495 INFO L518 ElimStorePlain]: Eliminatee v_prenex_48 vanished before elimination [2021-06-05 14:17:15,496 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:15,496 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:135, output treesize:32 [2021-06-05 14:17:15,532 INFO L134 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:17:15,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458391285] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:15,532 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:15,532 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 14:17:15,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64321692] [2021-06-05 14:17:15,532 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:17:15,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:15,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:17:15,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:17:15,533 INFO L87 Difference]: Start difference. First operand 224 states and 672 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:17:16,553 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2021-06-05 14:17:16,681 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2021-06-05 14:17:16,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:16,773 INFO L93 Difference]: Finished difference Result 283 states and 830 transitions. [2021-06-05 14:17:16,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:17:16,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 17 [2021-06-05 14:17:16,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:16,774 INFO L225 Difference]: With dead ends: 283 [2021-06-05 14:17:16,774 INFO L226 Difference]: Without dead ends: 270 [2021-06-05 14:17:16,774 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1639.5ms TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:17:16,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-06-05 14:17:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 230. [2021-06-05 14:17:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 3.004366812227074) internal successors, (688), 229 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:17:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 688 transitions. [2021-06-05 14:17:16,778 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 688 transitions. Word has length 17 [2021-06-05 14:17:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:16,778 INFO L482 AbstractCegarLoop]: Abstraction has 230 states and 688 transitions. [2021-06-05 14:17:16,778 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:17:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 688 transitions. [2021-06-05 14:17:16,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:16,778 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:16,778 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:17:16,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 159 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable609 [2021-06-05 14:17:16,989 INFO L430 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:16,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1308901226, now seen corresponding path program 13 times [2021-06-05 14:17:16,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:16,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301876944] [2021-06-05 14:17:16,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:17,488 INFO L134 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:17:17,488 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:17,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301876944] [2021-06-05 14:17:17,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301876944] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:17,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008577926] [2021-06-05 14:17:17,488 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 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:17:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:17,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:17,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:17,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 27 treesize of output 21 [2021-06-05 14:17:17,614 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17: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 25 treesize of output 19 [2021-06-05 14:17:17,618 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:17,640 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17: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 15 treesize of output 11 [2021-06-05 14:17:17,644 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:17,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 25 treesize of output 19 [2021-06-05 14:17:17,647 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:17,663 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:17,664 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:17,665 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:60 [2021-06-05 14:17:17,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:17:17,776 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:17,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 17 treesize of output 13 [2021-06-05 14:17:17,781 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:17,822 INFO L628 ElimStorePlain]: treesize reduction 60, result has 53.8 percent of original size [2021-06-05 14:17:17,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:17:17,825 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:17,840 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:17,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 13 treesize of output 9 [2021-06-05 14:17:17,845 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:17,859 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:17,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 19 treesize of output 15 [2021-06-05 14:17:17,863 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:17,876 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:17,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 11 treesize of output 7 [2021-06-05 14:17:17,880 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:17,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:17,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 12 treesize of output 8 [2021-06-05 14:17:17,897 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:17,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:17,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:17,912 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:142, output treesize:32 [2021-06-05 14:17:17,954 INFO L134 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:17:17,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008577926] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:17,955 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:17,955 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:17,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3479928] [2021-06-05 14:17:17,955 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:17,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:17,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:17,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:17,956 INFO L87 Difference]: Start difference. First operand 230 states and 688 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:18,531 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2021-06-05 14:17:18,831 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2021-06-05 14:17:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:19,065 INFO L93 Difference]: Finished difference Result 361 states and 1046 transitions. [2021-06-05 14:17:19,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:17:19,065 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:19,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:19,066 INFO L225 Difference]: With dead ends: 361 [2021-06-05 14:17:19,066 INFO L226 Difference]: Without dead ends: 341 [2021-06-05 14:17:19,066 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1335.4ms TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:17:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-06-05 14:17:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 250. [2021-06-05 14:17:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.0160642570281126) internal successors, (751), 249 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:17:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 751 transitions. [2021-06-05 14:17:19,070 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 751 transitions. Word has length 17 [2021-06-05 14:17:19,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:19,070 INFO L482 AbstractCegarLoop]: Abstraction has 250 states and 751 transitions. [2021-06-05 14:17:19,070 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 751 transitions. [2021-06-05 14:17:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:19,070 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:19,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:17:19,278 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618,160 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:17:19,278 INFO L430 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:19,279 INFO L82 PathProgramCache]: Analyzing trace with hash -2024967756, now seen corresponding path program 14 times [2021-06-05 14:17:19,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:19,279 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736123793] [2021-06-05 14:17:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:19,832 INFO L134 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:17:19,832 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:19,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736123793] [2021-06-05 14:17:19,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736123793] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:19,833 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724270524] [2021-06-05 14:17:19,833 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 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:17:19,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:17:19,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:19,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:19,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:19,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 15 treesize of output 11 [2021-06-05 14:17:19,990 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:19,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 25 treesize of output 19 [2021-06-05 14:17:19,994 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:20,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:20,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 27 treesize of output 21 [2021-06-05 14:17:20,024 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:20,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 25 treesize of output 19 [2021-06-05 14:17:20,027 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:20,048 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:20,049 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:20,049 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:78 [2021-06-05 14:17:20,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:17:20,123 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:20,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 14:17:20,127 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:20,164 INFO L628 ElimStorePlain]: treesize reduction 17, result has 81.7 percent of original size [2021-06-05 14:17:20,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 11 treesize of output 7 [2021-06-05 14:17:20,169 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:20,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:20,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 27 treesize of output 21 [2021-06-05 14:17:20,191 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:20,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:20,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 27 treesize of output 21 [2021-06-05 14:17:20,213 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:20,226 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:20,226 INFO L518 ElimStorePlain]: Eliminatee v_prenex_56 vanished before elimination [2021-06-05 14:17:20,226 INFO L518 ElimStorePlain]: Eliminatee v_prenex_59 vanished before elimination [2021-06-05 14:17:20,227 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:20,227 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:108, output treesize:32 [2021-06-05 14:17:20,282 INFO L134 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:17:20,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724270524] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:20,282 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:20,282 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:20,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657122765] [2021-06-05 14:17:20,283 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:20,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:20,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:20,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:20,283 INFO L87 Difference]: Start difference. First operand 250 states and 751 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:21,343 INFO L93 Difference]: Finished difference Result 321 states and 954 transitions. [2021-06-05 14:17:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:17:21,344 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:21,345 INFO L225 Difference]: With dead ends: 321 [2021-06-05 14:17:21,345 INFO L226 Difference]: Without dead ends: 311 [2021-06-05 14:17:21,345 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1297.4ms TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:17:21,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2021-06-05 14:17:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 262. [2021-06-05 14:17:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 3.0306513409961684) internal successors, (791), 261 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:17:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 791 transitions. [2021-06-05 14:17:21,348 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 791 transitions. Word has length 17 [2021-06-05 14:17:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:21,349 INFO L482 AbstractCegarLoop]: Abstraction has 262 states and 791 transitions. [2021-06-05 14:17:21,349 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 791 transitions. [2021-06-05 14:17:21,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:21,349 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:21,349 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:17:21,568 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 161 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable627 [2021-06-05 14:17:21,569 INFO L430 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:21,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:21,569 INFO L82 PathProgramCache]: Analyzing trace with hash -2098340236, now seen corresponding path program 15 times [2021-06-05 14:17:21,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:21,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260884207] [2021-06-05 14:17:21,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:22,099 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2021-06-05 14:17:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:17:22,211 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:22,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260884207] [2021-06-05 14:17:22,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260884207] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:22,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823472955] [2021-06-05 14:17:22,211 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 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:17:22,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:17:22,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:22,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:17:22,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:22,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 35 treesize of output 27 [2021-06-05 14:17:22,392 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:17:22,396 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,440 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:22,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 15 treesize of output 11 [2021-06-05 14:17:22,445 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,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 25 treesize of output 19 [2021-06-05 14:17:22,449 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,484 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:22,485 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:22,485 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:149, output treesize:119 [2021-06-05 14:17:22,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:22,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:17:22,588 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:22,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 25 treesize of output 19 [2021-06-05 14:17:22,594 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:22,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 35 treesize of output 27 [2021-06-05 14:17:22,600 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:22,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 25 treesize of output 19 [2021-06-05 14:17:22,606 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:22,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 23 [2021-06-05 14:17:22,611 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:22,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 14:17:22,616 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:22,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 25 treesize of output 19 [2021-06-05 14:17:22,623 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,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 35 treesize of output 27 [2021-06-05 14:17:22,628 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,719 INFO L628 ElimStorePlain]: treesize reduction 121, result has 51.6 percent of original size [2021-06-05 14:17:22,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:22,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 14:17:22,724 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:22,727 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:22,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 11 treesize of output 7 [2021-06-05 14:17:22,728 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:22,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:22,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 10 treesize of output 6 [2021-06-05 14:17:22,734 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:22,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:17:22,738 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:22,775 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:22,776 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:17:22,776 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:325, output treesize:96 [2021-06-05 14:17:22,917 INFO L134 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:17:22,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823472955] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:22,918 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:22,918 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:17:22,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965855132] [2021-06-05 14:17:22,918 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:22,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:22,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:22,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:22,918 INFO L87 Difference]: Start difference. First operand 262 states and 791 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:23,296 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2021-06-05 14:17:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:23,409 INFO L93 Difference]: Finished difference Result 309 states and 924 transitions. [2021-06-05 14:17:23,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:17:23,410 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:23,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:23,410 INFO L225 Difference]: With dead ends: 309 [2021-06-05 14:17:23,410 INFO L226 Difference]: Without dead ends: 298 [2021-06-05 14:17:23,411 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1040.0ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:17:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2021-06-05 14:17:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 263. [2021-06-05 14:17:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 3.0381679389312977) internal successors, (796), 262 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:17:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 796 transitions. [2021-06-05 14:17:23,416 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 796 transitions. Word has length 17 [2021-06-05 14:17:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:23,416 INFO L482 AbstractCegarLoop]: Abstraction has 263 states and 796 transitions. [2021-06-05 14:17:23,416 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 796 transitions. [2021-06-05 14:17:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:23,417 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:23,417 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:17:23,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636,162 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:17:23,625 INFO L430 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1062058060, now seen corresponding path program 16 times [2021-06-05 14:17:23,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:23,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570255935] [2021-06-05 14:17:23,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:24,071 INFO L134 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:17:24,071 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:24,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570255935] [2021-06-05 14:17:24,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570255935] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:24,071 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272235886] [2021-06-05 14:17:24,071 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 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:17:24,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:17:24,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:24,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:24,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:24,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:17:24,205 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:24,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 25 treesize of output 19 [2021-06-05 14:17:24,208 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:24,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:24,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:24,233 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:24,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 25 treesize of output 19 [2021-06-05 14:17:24,236 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:24,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:24,255 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:24,255 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:76 [2021-06-05 14:17:24,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 29 treesize of output 23 [2021-06-05 14:17:24,322 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:24,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 14:17:24,326 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:24,363 INFO L628 ElimStorePlain]: treesize reduction 54, result has 52.6 percent of original size [2021-06-05 14:17:24,364 INFO L518 ElimStorePlain]: Eliminatee v_prenex_64 vanished before elimination [2021-06-05 14:17:24,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 19 treesize of output 15 [2021-06-05 14:17:24,367 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:24,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:24,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 19 treesize of output 15 [2021-06-05 14:17:24,382 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:24,393 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:24,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:17:24,396 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:24,407 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:24,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 13 treesize of output 9 [2021-06-05 14:17:24,411 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:24,421 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:24,422 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:24,422 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:154, output treesize:32 [2021-06-05 14:17:24,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:17:24,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272235886] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:24,456 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:24,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:24,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348054709] [2021-06-05 14:17:24,456 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:24,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:24,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:24,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:24,457 INFO L87 Difference]: Start difference. First operand 263 states and 796 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:25,018 INFO L93 Difference]: Finished difference Result 315 states and 940 transitions. [2021-06-05 14:17:25,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:17:25,018 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:25,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:25,019 INFO L225 Difference]: With dead ends: 315 [2021-06-05 14:17:25,019 INFO L226 Difference]: Without dead ends: 305 [2021-06-05 14:17:25,019 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 800.3ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:17:25,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-06-05 14:17:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 265. [2021-06-05 14:17:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 3.0416666666666665) internal successors, (803), 264 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:17:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 803 transitions. [2021-06-05 14:17:25,022 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 803 transitions. Word has length 17 [2021-06-05 14:17:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:25,022 INFO L482 AbstractCegarLoop]: Abstraction has 265 states and 803 transitions. [2021-06-05 14:17:25,022 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 803 transitions. [2021-06-05 14:17:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:25,022 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:25,022 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:17:25,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable654,163 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:17:25,223 INFO L430 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 419179810, now seen corresponding path program 17 times [2021-06-05 14:17:25,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:25,223 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746234075] [2021-06-05 14:17:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:25,594 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2021-06-05 14:17:25,788 INFO L134 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:17:25,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:25,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746234075] [2021-06-05 14:17:25,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746234075] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:25,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454178480] [2021-06-05 14:17:25,788 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 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:17:25,826 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:17:25,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:25,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 14:17:25,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:25,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 25 treesize of output 19 [2021-06-05 14:17:25,929 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:25,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:25,932 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:25,957 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:25,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 25 treesize of output 19 [2021-06-05 14:17:25,962 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:25,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:17:25,965 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:25,985 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:25,987 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:25,987 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:69 [2021-06-05 14:17:26,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:17:26,044 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:26,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 19 treesize of output 15 [2021-06-05 14:17:26,047 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:26,102 INFO L628 ElimStorePlain]: treesize reduction 61, result has 52.7 percent of original size [2021-06-05 14:17:26,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 19 treesize of output 15 [2021-06-05 14:17:26,105 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:26,120 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:26,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 11 treesize of output 7 [2021-06-05 14:17:26,124 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:26,139 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:26,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:17:26,143 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:26,157 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:26,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 18 treesize of output 14 [2021-06-05 14:17:26,162 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:26,175 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:26,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 14 treesize of output 10 [2021-06-05 14:17:26,180 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:26,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:26,193 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:26,193 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:140, output treesize:32 [2021-06-05 14:17:26,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:17:26,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454178480] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:26,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:26,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 14:17:26,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445866761] [2021-06-05 14:17:26,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:17:26,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:26,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:17:26,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:17:26,236 INFO L87 Difference]: Start difference. First operand 265 states and 803 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:17:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:26,715 INFO L93 Difference]: Finished difference Result 313 states and 936 transitions. [2021-06-05 14:17:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:17:26,715 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 17 [2021-06-05 14:17:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:26,715 INFO L225 Difference]: With dead ends: 313 [2021-06-05 14:17:26,715 INFO L226 Difference]: Without dead ends: 303 [2021-06-05 14:17:26,716 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 836.9ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:17:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-06-05 14:17:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 270. [2021-06-05 14:17:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 3.0483271375464684) internal successors, (820), 269 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:17:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 820 transitions. [2021-06-05 14:17:26,718 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 820 transitions. Word has length 17 [2021-06-05 14:17:26,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:26,718 INFO L482 AbstractCegarLoop]: Abstraction has 270 states and 820 transitions. [2021-06-05 14:17:26,718 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:17:26,719 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 820 transitions. [2021-06-05 14:17:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:26,719 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:26,719 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:17:26,919 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 164 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable663 [2021-06-05 14:17:26,920 INFO L430 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:26,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:26,920 INFO L82 PathProgramCache]: Analyzing trace with hash 968096220, now seen corresponding path program 18 times [2021-06-05 14:17:26,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:26,920 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032759316] [2021-06-05 14:17:26,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:27,481 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 14:17:27,698 INFO L134 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:17:27,698 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:27,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032759316] [2021-06-05 14:17:27,698 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032759316] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:27,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064336933] [2021-06-05 14:17:27,698 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 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:17:27,740 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:17:27,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:27,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:17:27,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:27,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:27,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:27,871 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:27,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:27,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:27,877 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:27,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:27,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:17:27,881 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:27,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:17:27,885 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:27,930 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:27,937 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:27,937 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:185, output treesize:155 [2021-06-05 14:17:28,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 27 treesize of output 21 [2021-06-05 14:17:28,125 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:28,174 INFO L628 ElimStorePlain]: treesize reduction 4, result has 96.2 percent of original size [2021-06-05 14:17:28,174 INFO L518 ElimStorePlain]: Eliminatee v_prenex_71 vanished before elimination [2021-06-05 14:17:28,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 14:17:28,185 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:28,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:17:28,188 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:28,214 INFO L628 ElimStorePlain]: treesize reduction 20, result has 77.0 percent of original size [2021-06-05 14:17:28,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:28,217 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:28,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:28,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 12 treesize of output 8 [2021-06-05 14:17:28,232 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:28,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 12 treesize of output 8 [2021-06-05 14:17:28,236 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:28,247 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:28,247 INFO L518 ElimStorePlain]: Eliminatee v_prenex_73 vanished before elimination [2021-06-05 14:17:28,248 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:28,248 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:123, output treesize:32 [2021-06-05 14:17:28,282 INFO L134 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:17:28,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064336933] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:28,282 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:28,282 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 14:17:28,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009941765] [2021-06-05 14:17:28,283 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:17:28,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:28,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:17:28,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:17:28,283 INFO L87 Difference]: Start difference. First operand 270 states and 820 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:17:28,762 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 14:17:29,101 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 69 [2021-06-05 14:17:29,603 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2021-06-05 14:17:30,352 WARN L205 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2021-06-05 14:17:30,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:30,436 INFO L93 Difference]: Finished difference Result 319 states and 954 transitions. [2021-06-05 14:17:30,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:17:30,436 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 17 [2021-06-05 14:17:30,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:30,437 INFO L225 Difference]: With dead ends: 319 [2021-06-05 14:17:30,437 INFO L226 Difference]: Without dead ends: 309 [2021-06-05 14:17:30,437 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2564.0ms TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:17:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-06-05 14:17:30,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 272. [2021-06-05 14:17:30,440 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:17:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 826 transitions. [2021-06-05 14:17:30,441 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 826 transitions. Word has length 17 [2021-06-05 14:17:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:30,441 INFO L482 AbstractCegarLoop]: Abstraction has 272 states and 826 transitions. [2021-06-05 14:17:30,441 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:17:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 826 transitions. [2021-06-05 14:17:30,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:30,441 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:30,441 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:17:30,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 165 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable672 [2021-06-05 14:17:30,649 INFO L430 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:30,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:30,649 INFO L82 PathProgramCache]: Analyzing trace with hash 153290066, now seen corresponding path program 19 times [2021-06-05 14:17:30,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:30,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784238591] [2021-06-05 14:17:30,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:31,087 INFO L134 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:17:31,087 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:31,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784238591] [2021-06-05 14:17:31,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784238591] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:31,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406803792] [2021-06-05 14:17:31,087 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 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:17:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:31,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:17:31,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:31,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 27 treesize of output 21 [2021-06-05 14:17:31,351 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,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 25 treesize of output 19 [2021-06-05 14:17:31,356 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,467 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-06-05 14:17:31,467 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:31,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 15 treesize of output 11 [2021-06-05 14:17:31,472 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,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 25 treesize of output 19 [2021-06-05 14:17:31,476 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,560 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:31,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:31,565 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,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 27 treesize of output 21 [2021-06-05 14:17:31,569 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,656 INFO L628 ElimStorePlain]: treesize reduction 113, result has 55.5 percent of original size [2021-06-05 14:17:31,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:31,660 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,693 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:31,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 15 treesize of output 11 [2021-06-05 14:17:31,697 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:31,730 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:17:31,730 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:312, output treesize:127 [2021-06-05 14:17:31,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 27 treesize of output 21 [2021-06-05 14:17:31,825 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,892 INFO L628 ElimStorePlain]: treesize reduction 59, result has 63.8 percent of original size [2021-06-05 14:17:31,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:31,896 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:31,918 INFO L518 ElimStorePlain]: Eliminatee v_prenex_81 vanished before elimination [2021-06-05 14:17:31,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 19 treesize of output 15 [2021-06-05 14:17:31,921 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 14:17:31,923 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:31,947 INFO L628 ElimStorePlain]: treesize reduction 22, result has 69.0 percent of original size [2021-06-05 14:17:31,948 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 14:17:31,948 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:17:31,948 INFO L518 ElimStorePlain]: Eliminatee v_prenex_84 vanished before elimination [2021-06-05 14:17:31,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 12 treesize of output 8 [2021-06-05 14:17:31,953 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:31,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 13 treesize of output 9 [2021-06-05 14:17:31,956 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:31,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:31,967 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:31,967 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:180, output treesize:32 [2021-06-05 14:17:32,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:17:32,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406803792] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:32,011 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:32,011 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 14:17:32,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193899723] [2021-06-05 14:17:32,011 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:17:32,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:32,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:17:32,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:17:32,011 INFO L87 Difference]: Start difference. First operand 272 states and 826 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:17:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:32,584 INFO L93 Difference]: Finished difference Result 323 states and 962 transitions. [2021-06-05 14:17:32,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:17:32,584 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 17 [2021-06-05 14:17:32,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:32,585 INFO L225 Difference]: With dead ends: 323 [2021-06-05 14:17:32,585 INFO L226 Difference]: Without dead ends: 312 [2021-06-05 14:17:32,585 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 904.8ms TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:17:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-06-05 14:17:32,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 283. [2021-06-05 14:17:32,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 3.0709219858156027) internal successors, (866), 282 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:17:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 866 transitions. [2021-06-05 14:17:32,588 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 866 transitions. Word has length 17 [2021-06-05 14:17:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:32,588 INFO L482 AbstractCegarLoop]: Abstraction has 283 states and 866 transitions. [2021-06-05 14:17:32,588 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:17:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 866 transitions. [2021-06-05 14:17:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:32,588 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:32,588 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:17:32,788 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 166 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable686 [2021-06-05 14:17:32,789 INFO L430 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:32,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:32,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1175189202, now seen corresponding path program 20 times [2021-06-05 14:17:32,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:32,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185549584] [2021-06-05 14:17:32,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:17:33,123 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:33,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185549584] [2021-06-05 14:17:33,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185549584] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:33,123 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098495441] [2021-06-05 14:17:33,123 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 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:17:33,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:17:33,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:33,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:17:33,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:33,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:17:33,269 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:17:33,274 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,312 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:33,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:17:33,318 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:17:33,322 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,359 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:33,360 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:33,360 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:150, output treesize:115 [2021-06-05 14:17:33,441 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:33,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 14:17:33,442 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:33,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:17:33,447 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:33,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 17 treesize of output 13 [2021-06-05 14:17:33,452 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:33,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:33,456 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:33,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 38 treesize of output 30 [2021-06-05 14:17:33,461 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:33,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 25 treesize of output 19 [2021-06-05 14:17:33,466 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:33,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 27 treesize of output 21 [2021-06-05 14:17:33,481 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:17:33,487 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,611 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2021-06-05 14:17:33,612 INFO L628 ElimStorePlain]: treesize reduction 112, result has 53.7 percent of original size [2021-06-05 14:17:33,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:33,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:17:33,617 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:33,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17: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 10 treesize of output 6 [2021-06-05 14:17:33,621 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:33,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:33,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 24 treesize of output 16 [2021-06-05 14:17:33,625 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:33,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 11 treesize of output 7 [2021-06-05 14:17:33,629 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:33,664 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:33,665 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:17:33,665 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:317, output treesize:97 [2021-06-05 14:17:33,821 INFO L134 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:17:33,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098495441] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:33,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:33,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:17:33,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175404065] [2021-06-05 14:17:33,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:33,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:33,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:33,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:33,822 INFO L87 Difference]: Start difference. First operand 283 states and 866 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:34,130 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2021-06-05 14:17:34,295 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 60 [2021-06-05 14:17:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:34,409 INFO L93 Difference]: Finished difference Result 328 states and 991 transitions. [2021-06-05 14:17:34,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:17:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:34,410 INFO L225 Difference]: With dead ends: 328 [2021-06-05 14:17:34,410 INFO L226 Difference]: Without dead ends: 318 [2021-06-05 14:17:34,410 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 824.3ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:17:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-06-05 14:17:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 285. [2021-06-05 14:17:34,413 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:17:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 872 transitions. [2021-06-05 14:17:34,413 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 872 transitions. Word has length 17 [2021-06-05 14:17:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:34,413 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 872 transitions. [2021-06-05 14:17:34,413 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 872 transitions. [2021-06-05 14:17:34,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:34,414 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:34,414 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:17:34,614 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 167 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable725 [2021-06-05 14:17:34,615 INFO L430 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:34,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:34,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1517772714, now seen corresponding path program 21 times [2021-06-05 14:17:34,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:34,615 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620586211] [2021-06-05 14:17:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:34,900 INFO L134 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:17:34,900 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:34,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620586211] [2021-06-05 14:17:34,900 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620586211] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:34,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058258070] [2021-06-05 14:17:34,900 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 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:17:34,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 14:17:34,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:34,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:34,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:35,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:35,017 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:35,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 15 treesize of output 11 [2021-06-05 14:17:35,019 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:35,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:35,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:35,044 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:35,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 27 treesize of output 21 [2021-06-05 14:17:35,047 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:35,065 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:35,066 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:35,066 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:74 [2021-06-05 14:17:35,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 14:17:35,127 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:35,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:17:35,131 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:35,170 INFO L628 ElimStorePlain]: treesize reduction 40, result has 64.3 percent of original size [2021-06-05 14:17:35,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:35,174 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:35,190 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:35,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 11 treesize of output 7 [2021-06-05 14:17:35,195 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:35,210 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17: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 19 treesize of output 15 [2021-06-05 14:17:35,213 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:35,226 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:35,227 INFO L518 ElimStorePlain]: Eliminatee v_prenex_88 vanished before elimination [2021-06-05 14:17: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 11 treesize of output 7 [2021-06-05 14:17:35,231 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:35,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:35,245 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:35,245 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 14:17:35,293 INFO L134 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:17:35,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058258070] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:35,293 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:35,293 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 14:17:35,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519204174] [2021-06-05 14:17:35,293 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:17:35,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:35,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:17:35,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:17:35,294 INFO L87 Difference]: Start difference. First operand 285 states and 872 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:17:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:35,743 INFO L93 Difference]: Finished difference Result 326 states and 985 transitions. [2021-06-05 14:17:35,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 14:17:35,743 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 17 [2021-06-05 14:17:35,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:35,743 INFO L225 Difference]: With dead ends: 326 [2021-06-05 14:17:35,743 INFO L226 Difference]: Without dead ends: 315 [2021-06-05 14:17:35,744 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 578.9ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:17:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-06-05 14:17:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 285. [2021-06-05 14:17:35,746 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:17:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 872 transitions. [2021-06-05 14:17:35,746 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 872 transitions. Word has length 17 [2021-06-05 14:17:35,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:35,747 INFO L482 AbstractCegarLoop]: Abstraction has 285 states and 872 transitions. [2021-06-05 14:17:35,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:17:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 872 transitions. [2021-06-05 14:17:35,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:35,747 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:35,747 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:17:35,947 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable743,168 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:17:35,948 INFO L430 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1096748704, now seen corresponding path program 22 times [2021-06-05 14:17:35,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:35,948 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179867252] [2021-06-05 14:17:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:36,330 INFO L134 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:17:36,330 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:36,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179867252] [2021-06-05 14:17:36,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179867252] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:36,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928781775] [2021-06-05 14:17:36,330 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 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:17:36,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:17:36,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:36,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:36,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:36,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 15 treesize of output 11 [2021-06-05 14:17:36,491 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:36,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 25 treesize of output 19 [2021-06-05 14:17:36,495 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:36,523 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:36,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:36,527 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:36,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:36,530 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:36,552 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:36,554 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:36,554 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:84 [2021-06-05 14:17:36,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 27 treesize of output 21 [2021-06-05 14:17:36,626 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:36,663 INFO L628 ElimStorePlain]: treesize reduction 31, result has 69.9 percent of original size [2021-06-05 14:17:36,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 27 treesize of output 21 [2021-06-05 14:17:36,667 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:36,683 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:36,683 INFO L518 ElimStorePlain]: Eliminatee v_prenex_92 vanished before elimination [2021-06-05 14:17:36,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 29 treesize of output 23 [2021-06-05 14:17:36,686 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:36,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:36,699 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:17:36,699 INFO L518 ElimStorePlain]: Eliminatee v_prenex_95 vanished before elimination [2021-06-05 14:17:36,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:36,700 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:120, output treesize:32 [2021-06-05 14:17:36,741 INFO L134 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:17:36,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928781775] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:36,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:36,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:36,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535518070] [2021-06-05 14:17:36,742 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:36,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:36,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:36,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:36,742 INFO L87 Difference]: Start difference. First operand 285 states and 872 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:37,667 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2021-06-05 14:17:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:37,872 INFO L93 Difference]: Finished difference Result 361 states and 1073 transitions. [2021-06-05 14:17:37,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:17:37,872 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:37,873 INFO L225 Difference]: With dead ends: 361 [2021-06-05 14:17:37,873 INFO L226 Difference]: Without dead ends: 349 [2021-06-05 14:17:37,873 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1250.4ms TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:17:37,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2021-06-05 14:17:37,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 296. [2021-06-05 14:17:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 3.08135593220339) internal successors, (909), 295 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:17:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 909 transitions. [2021-06-05 14:17:37,877 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 909 transitions. Word has length 17 [2021-06-05 14:17:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:37,877 INFO L482 AbstractCegarLoop]: Abstraction has 296 states and 909 transitions. [2021-06-05 14:17:37,877 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 909 transitions. [2021-06-05 14:17:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:37,878 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:37,878 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:17:38,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 169 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable752 [2021-06-05 14:17:38,097 INFO L430 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:38,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1716980722, now seen corresponding path program 23 times [2021-06-05 14:17:38,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:38,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895332699] [2021-06-05 14:17:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:17:38,375 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:38,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895332699] [2021-06-05 14:17:38,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895332699] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:38,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521206058] [2021-06-05 14:17:38,375 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 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:17:38,402 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:17:38,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:38,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:17:38,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:38,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:38,572 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:38,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:17:38,576 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:38,663 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:38,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 25 treesize of output 19 [2021-06-05 14:17:38,668 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:38,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:17:38,672 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:38,750 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:38,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:38,755 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:38,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 27 treesize of output 21 [2021-06-05 14:17:38,767 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:38,862 INFO L628 ElimStorePlain]: treesize reduction 116, result has 56.7 percent of original size [2021-06-05 14:17:38,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 15 treesize of output 11 [2021-06-05 14:17:38,866 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:38,901 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:38,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:38,904 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:38,938 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:38,939 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:17:38,939 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:322, output treesize:134 [2021-06-05 14:17:39,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 14:17:39,039 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:39,089 INFO L628 ElimStorePlain]: treesize reduction 69, result has 59.6 percent of original size [2021-06-05 14:17:39,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 27 treesize of output 21 [2021-06-05 14:17:39,092 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:39,110 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:39,111 INFO L518 ElimStorePlain]: Eliminatee v_prenex_109 vanished before elimination [2021-06-05 14:17:39,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 28 treesize of output 22 [2021-06-05 14:17:39,113 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:39,131 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:39,131 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:17:39,131 INFO L518 ElimStorePlain]: Eliminatee v_prenex_100 vanished before elimination [2021-06-05 14:17:39,131 INFO L518 ElimStorePlain]: Eliminatee v_prenex_101 vanished before elimination [2021-06-05 14:17:39,132 INFO L518 ElimStorePlain]: Eliminatee v_prenex_102 vanished before elimination [2021-06-05 14:17:39,132 INFO L518 ElimStorePlain]: Eliminatee v_prenex_103 vanished before elimination [2021-06-05 14:17:39,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 27 treesize of output 21 [2021-06-05 14:17:39,134 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:39,158 INFO L628 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2021-06-05 14:17:39,158 INFO L518 ElimStorePlain]: Eliminatee v_prenex_105 vanished before elimination [2021-06-05 14:17:39,158 INFO L518 ElimStorePlain]: Eliminatee v_prenex_106 vanished before elimination [2021-06-05 14:17:39,158 INFO L550 ElimStorePlain]: Start of recursive call 1: 12 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:39,158 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:193, output treesize:32 [2021-06-05 14:17:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:17:39,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521206058] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:39,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:39,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:17:39,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263387533] [2021-06-05 14:17:39,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:39,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:39,194 INFO L87 Difference]: Start difference. First operand 296 states and 909 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:39,749 INFO L93 Difference]: Finished difference Result 340 states and 1019 transitions. [2021-06-05 14:17:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:17:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:39,750 INFO L225 Difference]: With dead ends: 340 [2021-06-05 14:17:39,750 INFO L226 Difference]: Without dead ends: 332 [2021-06-05 14:17:39,750 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 708.7ms TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:17:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-06-05 14:17:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 298. [2021-06-05 14:17:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.0774410774410774) internal successors, (914), 297 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:17:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 914 transitions. [2021-06-05 14:17:39,754 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 914 transitions. Word has length 17 [2021-06-05 14:17:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:39,754 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 914 transitions. [2021-06-05 14:17:39,754 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 914 transitions. [2021-06-05 14:17:39,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:39,754 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:39,754 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:17:39,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 170 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable761 [2021-06-05 14:17:39,955 INFO L430 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:39,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:39,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2006531768, now seen corresponding path program 24 times [2021-06-05 14:17:39,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:39,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23189736] [2021-06-05 14:17:39,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:40,229 INFO L134 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:17:40,229 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:40,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23189736] [2021-06-05 14:17:40,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23189736] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:40,229 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052085031] [2021-06-05 14:17:40,229 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 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:17:40,255 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:17:40,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:40,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:17:40,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:40,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 25 treesize of output 19 [2021-06-05 14:17:40,374 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,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 27 treesize of output 21 [2021-06-05 14:17:40,377 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,412 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:40,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 15 treesize of output 11 [2021-06-05 14:17:40,416 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,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 15 treesize of output 11 [2021-06-05 14:17:40,419 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,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 25 treesize of output 19 [2021-06-05 14:17:40,422 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:17:40,425 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,451 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:40,452 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:17:40,453 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:161, output treesize:106 [2021-06-05 14:17:40,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 18 treesize of output 14 [2021-06-05 14:17:40,607 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,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 17 treesize of output 13 [2021-06-05 14:17:40,611 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,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 17 treesize of output 13 [2021-06-05 14:17:40,614 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,669 INFO L628 ElimStorePlain]: treesize reduction 53, result has 66.7 percent of original size [2021-06-05 14:17:40,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:17:40,672 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:40,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:40,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 19 treesize of output 15 [2021-06-05 14:17:40,699 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,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 27 treesize of output 21 [2021-06-05 14:17:40,702 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,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 20 treesize of output 16 [2021-06-05 14:17:40,704 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:40,732 INFO L628 ElimStorePlain]: treesize reduction 20, result has 70.6 percent of original size [2021-06-05 14:17:40,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 11 treesize of output 7 [2021-06-05 14:17:40,736 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:40,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 12 treesize of output 8 [2021-06-05 14:17:40,740 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:40,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:40,754 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:40,754 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:180, output treesize:32 [2021-06-05 14:17:40,797 INFO L134 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:17:40,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052085031] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:40,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:40,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:17:40,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601689444] [2021-06-05 14:17:40,798 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:40,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:40,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:40,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:40,798 INFO L87 Difference]: Start difference. First operand 298 states and 914 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:41,603 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2021-06-05 14:17:41,778 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-06-05 14:17:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:41,828 INFO L93 Difference]: Finished difference Result 382 states and 1120 transitions. [2021-06-05 14:17:41,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:17:41,829 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:41,829 INFO L225 Difference]: With dead ends: 382 [2021-06-05 14:17:41,829 INFO L226 Difference]: Without dead ends: 372 [2021-06-05 14:17:41,829 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1043.8ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:17:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-06-05 14:17:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 298. [2021-06-05 14:17:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.0774410774410774) internal successors, (914), 297 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:17:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 914 transitions. [2021-06-05 14:17:41,834 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 914 transitions. Word has length 17 [2021-06-05 14:17:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:41,834 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 914 transitions. [2021-06-05 14:17:41,834 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 914 transitions. [2021-06-05 14:17:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:41,835 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:41,835 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:17:42,044 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 171 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable791 [2021-06-05 14:17:42,045 INFO L430 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:42,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:42,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1520655850, now seen corresponding path program 25 times [2021-06-05 14:17:42,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:42,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821653508] [2021-06-05 14:17:42,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:42,276 INFO L134 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:17:42,276 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:42,276 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821653508] [2021-06-05 14:17:42,276 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821653508] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:42,276 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192595347] [2021-06-05 14:17:42,277 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:17:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:42,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:42,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:42,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 25 treesize of output 19 [2021-06-05 14:17:42,399 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:42,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:42,402 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:42,423 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:42,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 15 treesize of output 11 [2021-06-05 14:17:42,427 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:42,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:42,429 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:42,447 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:42,448 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:42,448 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:83 [2021-06-05 14:17:42,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 28 treesize of output 22 [2021-06-05 14:17:42,499 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:42,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 30 treesize of output 24 [2021-06-05 14:17:42,502 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:42,555 INFO L628 ElimStorePlain]: treesize reduction 10, result has 87.5 percent of original size [2021-06-05 14:17:42,556 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:17:42,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 27 treesize of output 21 [2021-06-05 14:17:42,559 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:42,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:42,571 INFO L518 ElimStorePlain]: Eliminatee v_prenex_115 vanished before elimination [2021-06-05 14:17: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 27 treesize of output 21 [2021-06-05 14:17:42,573 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:42,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:42,584 INFO L518 ElimStorePlain]: Eliminatee v_prenex_117 vanished before elimination [2021-06-05 14:17:42,585 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:42,585 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:118, output treesize:32 [2021-06-05 14:17:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:17:42,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192595347] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:42,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:42,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 14:17:42,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784055516] [2021-06-05 14:17:42,620 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:17:42,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:42,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:17:42,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:17:42,620 INFO L87 Difference]: Start difference. First operand 298 states and 914 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:17:43,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:43,281 INFO L93 Difference]: Finished difference Result 372 states and 1109 transitions. [2021-06-05 14:17:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:17:43,282 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 17 [2021-06-05 14:17:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:43,282 INFO L225 Difference]: With dead ends: 372 [2021-06-05 14:17:43,282 INFO L226 Difference]: Without dead ends: 356 [2021-06-05 14:17:43,282 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 692.3ms TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:17:43,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-06-05 14:17:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 297. [2021-06-05 14:17:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 3.0878378378378377) internal successors, (914), 296 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:17:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 914 transitions. [2021-06-05 14:17:43,285 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 914 transitions. Word has length 17 [2021-06-05 14:17:43,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:43,285 INFO L482 AbstractCegarLoop]: Abstraction has 297 states and 914 transitions. [2021-06-05 14:17:43,286 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:17:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 914 transitions. [2021-06-05 14:17:43,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:43,286 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:43,286 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:17:43,486 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable810,172 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:17:43,487 INFO L430 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:43,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:43,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1001716564, now seen corresponding path program 26 times [2021-06-05 14:17:43,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:43,487 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35900092] [2021-06-05 14:17:43,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:43,963 INFO L134 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:17:43,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:43,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35900092] [2021-06-05 14:17:43,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35900092] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:43,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819968195] [2021-06-05 14:17:43,964 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 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:17:43,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:17:43,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:43,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:43,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:44,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 25 treesize of output 19 [2021-06-05 14:17:44,080 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:44,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:17:44,082 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:44,099 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:44,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:44,103 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:44,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 27 treesize of output 21 [2021-06-05 14:17:44,105 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:44,119 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:44,119 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:44,120 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:68 [2021-06-05 14:17:44,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 24 [2021-06-05 14:17:44,213 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:44,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 28 treesize of output 22 [2021-06-05 14:17:44,216 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:44,246 INFO L628 ElimStorePlain]: treesize reduction 31, result has 68.0 percent of original size [2021-06-05 14:17:44,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 19 treesize of output 15 [2021-06-05 14:17:44,248 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:44,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:44,260 INFO L518 ElimStorePlain]: Eliminatee v_prenex_120 vanished before elimination [2021-06-05 14:17:44,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:17:44,263 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:44,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:44,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 27 treesize of output 21 [2021-06-05 14:17:44,277 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:44,287 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:44,287 INFO L518 ElimStorePlain]: Eliminatee v_prenex_122 vanished before elimination [2021-06-05 14:17:44,288 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:44,288 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:135, output treesize:32 [2021-06-05 14:17:44,325 INFO L134 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:17:44,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819968195] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:44,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:44,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:44,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306488887] [2021-06-05 14:17:44,325 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:44,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:44,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:44,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:44,326 INFO L87 Difference]: Start difference. First operand 297 states and 914 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:44,858 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-06-05 14:17:45,098 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2021-06-05 14:17:45,335 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2021-06-05 14:17:45,716 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2021-06-05 14:17:45,908 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2021-06-05 14:17:46,165 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2021-06-05 14:17:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:46,297 INFO L93 Difference]: Finished difference Result 447 states and 1309 transitions. [2021-06-05 14:17:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:17:46,297 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:46,298 INFO L225 Difference]: With dead ends: 447 [2021-06-05 14:17:46,298 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 14:17:46,299 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1988.2ms TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:17:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 14:17:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 298. [2021-06-05 14:17:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.0942760942760943) internal successors, (919), 297 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:17:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 919 transitions. [2021-06-05 14:17:46,303 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 919 transitions. Word has length 17 [2021-06-05 14:17:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:46,303 INFO L482 AbstractCegarLoop]: Abstraction has 298 states and 919 transitions. [2021-06-05 14:17:46,304 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 919 transitions. [2021-06-05 14:17:46,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:46,304 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:46,304 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:17:46,517 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable819,173 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:17:46,517 INFO L430 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:46,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:46,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1965452058, now seen corresponding path program 27 times [2021-06-05 14:17:46,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:46,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034061485] [2021-06-05 14:17:46,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:46,935 INFO L134 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:17:46,935 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:46,935 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034061485] [2021-06-05 14:17:46,935 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034061485] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:46,935 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353543108] [2021-06-05 14:17:46,935 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 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:17:46,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:17:46,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:46,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:46,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:47,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:47,075 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:47,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 25 treesize of output 19 [2021-06-05 14:17:47,079 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:47,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:47,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 25 treesize of output 19 [2021-06-05 14:17:47,110 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:47,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 15 treesize of output 11 [2021-06-05 14:17:47,114 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:47,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:47,137 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:47,137 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:74 [2021-06-05 14:17:47,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 19 treesize of output 15 [2021-06-05 14:17:47,209 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:47,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 21 treesize of output 17 [2021-06-05 14:17:47,213 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:47,254 INFO L628 ElimStorePlain]: treesize reduction 40, result has 64.3 percent of original size [2021-06-05 14:17:47,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 11 treesize of output 7 [2021-06-05 14:17:47,259 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:47,276 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:47,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 19 treesize of output 15 [2021-06-05 14:17:47,280 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:47,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:47,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 10 treesize of output 6 [2021-06-05 14:17:47,299 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:47,314 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:47,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:47,318 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:47,330 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:47,331 INFO L518 ElimStorePlain]: Eliminatee v_prenex_127 vanished before elimination [2021-06-05 14:17:47,332 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:47,332 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 14:17:47,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:17:47,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353543108] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:47,373 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:47,373 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:47,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868272263] [2021-06-05 14:17:47,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:47,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:47,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:47,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:47,374 INFO L87 Difference]: Start difference. First operand 298 states and 919 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:47,977 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2021-06-05 14:17:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:48,103 INFO L93 Difference]: Finished difference Result 352 states and 1066 transitions. [2021-06-05 14:17:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:17:48,103 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:48,104 INFO L225 Difference]: With dead ends: 352 [2021-06-05 14:17:48,104 INFO L226 Difference]: Without dead ends: 342 [2021-06-05 14:17:48,104 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 877.2ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:17:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2021-06-05 14:17:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 300. [2021-06-05 14:17:48,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.096989966555184) internal successors, (926), 299 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:17:48,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 926 transitions. [2021-06-05 14:17:48,108 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 926 transitions. Word has length 17 [2021-06-05 14:17:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:48,108 INFO L482 AbstractCegarLoop]: Abstraction has 300 states and 926 transitions. [2021-06-05 14:17:48,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 926 transitions. [2021-06-05 14:17:48,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:48,109 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:48,109 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:17:48,316 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable828,174 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:17:48,317 INFO L430 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:48,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:48,317 INFO L82 PathProgramCache]: Analyzing trace with hash -848277368, now seen corresponding path program 28 times [2021-06-05 14:17:48,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:48,317 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598236225] [2021-06-05 14:17:48,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:48,592 INFO L134 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:17:48,592 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:48,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598236225] [2021-06-05 14:17:48,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598236225] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:48,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106868308] [2021-06-05 14:17:48,592 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 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:17:48,627 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:17:48,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:48,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:17:48,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:48,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 25 treesize of output 19 [2021-06-05 14:17:48,766 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:48,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 35 treesize of output 27 [2021-06-05 14:17:48,771 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:48,815 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:48,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 25 treesize of output 19 [2021-06-05 14:17:48,820 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:48,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 15 treesize of output 11 [2021-06-05 14:17:48,824 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:48,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:48,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:48,863 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:152, output treesize:117 [2021-06-05 14:17:48,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:48,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:17:48,960 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:48,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:48,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 28 treesize of output 22 [2021-06-05 14:17:48,965 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:48,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:48,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:17:48,970 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:48,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:48,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:17:48,975 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:48,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:48,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 25 treesize of output 19 [2021-06-05 14:17:48,980 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:48,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:48,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 38 treesize of output 30 [2021-06-05 14:17:48,987 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:48,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:48,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:17:48,993 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:48,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 25 treesize of output 19 [2021-06-05 14:17:48,998 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:49,118 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2021-06-05 14:17:49,119 INFO L628 ElimStorePlain]: treesize reduction 110, result has 55.6 percent of original size [2021-06-05 14:17:49,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:49,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 22 treesize of output 14 [2021-06-05 14:17:49,123 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:49,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:49,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 11 treesize of output 7 [2021-06-05 14:17:49,131 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:49,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:49,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 10 treesize of output 6 [2021-06-05 14:17:49,137 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:49,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 24 treesize of output 16 [2021-06-05 14:17:49,141 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:49,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:49,189 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:17:49,189 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:321, output treesize:99 [2021-06-05 14:17:49,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:17:49,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106868308] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:49,343 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:49,343 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:17:49,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070172047] [2021-06-05 14:17:49,343 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:49,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:49,345 INFO L87 Difference]: Start difference. First operand 300 states and 926 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:49,814 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2021-06-05 14:17:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:50,667 INFO L93 Difference]: Finished difference Result 350 states and 1062 transitions. [2021-06-05 14:17:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:17:50,667 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:50,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:50,668 INFO L225 Difference]: With dead ends: 350 [2021-06-05 14:17:50,668 INFO L226 Difference]: Without dead ends: 340 [2021-06-05 14:17:50,668 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 729.2ms TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:17:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-06-05 14:17:50,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 299. [2021-06-05 14:17:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 3.0939597315436242) internal successors, (922), 298 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:17:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 922 transitions. [2021-06-05 14:17:50,672 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 922 transitions. Word has length 17 [2021-06-05 14:17:50,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:50,672 INFO L482 AbstractCegarLoop]: Abstraction has 299 states and 922 transitions. [2021-06-05 14:17:50,672 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 922 transitions. [2021-06-05 14:17:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:50,673 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:50,673 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:17:50,880 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 175 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable837 [2021-06-05 14:17:50,881 INFO L430 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash -299360958, now seen corresponding path program 29 times [2021-06-05 14:17:50,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:50,881 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762122444] [2021-06-05 14:17:50,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:51,282 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 14:17:51,406 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2021-06-05 14:17:51,542 INFO L134 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:17:51,542 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:51,542 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762122444] [2021-06-05 14:17:51,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762122444] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:51,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085037786] [2021-06-05 14:17:51,543 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 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:17:51,588 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:17:51,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:51,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:51,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:51,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 25 treesize of output 19 [2021-06-05 14:17:51,713 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:51,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 15 treesize of output 11 [2021-06-05 14:17:51,716 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:51,743 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:51,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 27 treesize of output 21 [2021-06-05 14:17:51,748 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:51,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 25 treesize of output 19 [2021-06-05 14:17:51,751 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:51,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:51,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:51,773 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:76 [2021-06-05 14:17:51,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 17 treesize of output 13 [2021-06-05 14:17:51,859 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:51,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 19 treesize of output 15 [2021-06-05 14:17:51,863 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:51,907 INFO L628 ElimStorePlain]: treesize reduction 66, result has 52.9 percent of original size [2021-06-05 14:17:51,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:17:51,911 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:51,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:51,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:17:51,929 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:51,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:51,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 10 treesize of output 6 [2021-06-05 14:17:51,948 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:51,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:51,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 14:17:51,965 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:51,978 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:51,978 INFO L518 ElimStorePlain]: Eliminatee v_prenex_133 vanished before elimination [2021-06-05 14:17:51,979 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:51,979 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:154, output treesize:32 [2021-06-05 14:17:52,020 INFO L134 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:17:52,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085037786] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:52,020 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:52,020 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:17:52,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813186854] [2021-06-05 14:17:52,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:52,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:52,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:52,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:52,021 INFO L87 Difference]: Start difference. First operand 299 states and 922 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:52,492 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2021-06-05 14:17:52,662 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2021-06-05 14:17:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:52,771 INFO L93 Difference]: Finished difference Result 349 states and 1060 transitions. [2021-06-05 14:17:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:17:52,771 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:52,772 INFO L225 Difference]: With dead ends: 349 [2021-06-05 14:17:52,772 INFO L226 Difference]: Without dead ends: 339 [2021-06-05 14:17:52,772 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1153.9ms TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:17:52,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-06-05 14:17:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 301. [2021-06-05 14:17:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:17:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 14:17:52,775 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 14:17:52,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:52,775 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 14:17:52,775 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 14:17:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:52,775 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:52,776 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:17:52,981 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 176 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable853 [2021-06-05 14:17:52,982 INFO L430 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:52,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1114167112, now seen corresponding path program 30 times [2021-06-05 14:17:52,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:52,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677421291] [2021-06-05 14:17:52,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:53,397 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2021-06-05 14:17:53,638 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-06-05 14:17:53,888 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2021-06-05 14:17:54,172 INFO L134 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:17:54,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:54,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677421291] [2021-06-05 14:17:54,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677421291] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:54,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551443158] [2021-06-05 14:17:54,173 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 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:17:54,205 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:17:54,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:54,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:17:54,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:54,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:17:54,329 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,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 25 treesize of output 19 [2021-06-05 14:17:54,333 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:54,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 25 treesize of output 19 [2021-06-05 14:17:54,380 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,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 35 treesize of output 27 [2021-06-05 14:17:54,384 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:54,421 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:54,421 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:149, output treesize:111 [2021-06-05 14:17:54,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:54,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:54,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:54,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:17:54,530 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:54,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:17:54,536 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:54,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 25 treesize of output 19 [2021-06-05 14:17:54,540 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,568 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:54,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 29 treesize of output 23 [2021-06-05 14:17:54,575 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:54,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 14:17:54,580 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:54,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 17 treesize of output 13 [2021-06-05 14:17:54,584 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,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 27 treesize of output 21 [2021-06-05 14:17:54,587 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,694 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2021-06-05 14:17:54,694 INFO L628 ElimStorePlain]: treesize reduction 111, result has 53.8 percent of original size [2021-06-05 14:17:54,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:54,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 24 treesize of output 16 [2021-06-05 14:17:54,698 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:54,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:54,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:17:54,702 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:54,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:54,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:17:54,706 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:54,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:17:54,710 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:55,159 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-06-05 14:17:55,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:55,161 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:17:55,161 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:309, output treesize:96 [2021-06-05 14:17:55,420 INFO L134 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:17:55,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551443158] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:55,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:55,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2021-06-05 14:17:55,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545435662] [2021-06-05 14:17:55,424 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:17:55,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:55,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:17:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:17:55,426 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:17:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:55,955 INFO L93 Difference]: Finished difference Result 363 states and 1106 transitions. [2021-06-05 14:17:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:17:55,956 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 17 [2021-06-05 14:17:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:55,957 INFO L225 Difference]: With dead ends: 363 [2021-06-05 14:17:55,957 INFO L226 Difference]: Without dead ends: 352 [2021-06-05 14:17:55,957 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1591.7ms TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:17:55,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-06-05 14:17:55,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 301. [2021-06-05 14:17:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.1033333333333335) internal successors, (931), 300 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:17:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 931 transitions. [2021-06-05 14:17:55,962 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 931 transitions. Word has length 17 [2021-06-05 14:17:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:55,962 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 931 transitions. [2021-06-05 14:17:55,962 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:17:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 931 transitions. [2021-06-05 14:17:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:55,963 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:55,963 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:17:56,172 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 177 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable862 [2021-06-05 14:17:56,173 INFO L430 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:56,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:56,173 INFO L82 PathProgramCache]: Analyzing trace with hash -92267976, now seen corresponding path program 31 times [2021-06-05 14:17:56,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:56,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926307163] [2021-06-05 14:17:56,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:56,551 INFO L134 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:17:56,551 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:56,551 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926307163] [2021-06-05 14:17:56,551 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926307163] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:56,551 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599950485] [2021-06-05 14:17:56,551 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 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:17:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:56,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:17:56,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:56,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:56,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:17:56,692 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:56,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:56,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:17:56,697 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:56,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:17:56,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 25 treesize of output 19 [2021-06-05 14:17:56,703 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:56,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:56,708 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:56,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:56,763 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:56,763 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:167, output treesize:132 [2021-06-05 14:17:56,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 18 treesize of output 14 [2021-06-05 14:17:56,968 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:56,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 20 treesize of output 16 [2021-06-05 14:17:56,972 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:57,029 INFO L628 ElimStorePlain]: treesize reduction 69, result has 57.1 percent of original size [2021-06-05 14:17:57,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 10 treesize of output 6 [2021-06-05 14:17:57,034 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:57,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 12 treesize of output 8 [2021-06-05 14:17:57,039 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:57,062 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:57,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 19 treesize of output 15 [2021-06-05 14:17:57,066 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:57,097 INFO L628 ElimStorePlain]: treesize reduction 17, result has 77.9 percent of original size [2021-06-05 14:17:57,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 11 treesize of output 7 [2021-06-05 14:17:57,101 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:57,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:57,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 27 treesize of output 21 [2021-06-05 14:17:57,119 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:57,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:57,132 INFO L518 ElimStorePlain]: Eliminatee v_prenex_138 vanished before elimination [2021-06-05 14:17:57,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:57,133 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:175, output treesize:32 [2021-06-05 14:17:57,176 INFO L134 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:17:57,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599950485] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:57,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:57,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:17:57,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348844679] [2021-06-05 14:17:57,177 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:17:57,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:57,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:17:57,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:17:57,177 INFO L87 Difference]: Start difference. First operand 301 states and 931 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:57,511 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2021-06-05 14:17:57,726 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2021-06-05 14:17:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:57,813 INFO L93 Difference]: Finished difference Result 350 states and 1067 transitions. [2021-06-05 14:17:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:17:57,814 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:17:57,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:57,814 INFO L225 Difference]: With dead ends: 350 [2021-06-05 14:17:57,814 INFO L226 Difference]: Without dead ends: 340 [2021-06-05 14:17:57,815 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 942.7ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:17:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-06-05 14:17:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 303. [2021-06-05 14:17:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.1026490066225167) internal successors, (937), 302 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:17:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 937 transitions. [2021-06-05 14:17:57,819 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 937 transitions. Word has length 17 [2021-06-05 14:17:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:57,819 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 937 transitions. [2021-06-05 14:17:57,819 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:17:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 937 transitions. [2021-06-05 14:17:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:57,820 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:57,820 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:17:58,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable880,178 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:17:58,021 INFO L430 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:58,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:58,021 INFO L82 PathProgramCache]: Analyzing trace with hash 250315536, now seen corresponding path program 32 times [2021-06-05 14:17:58,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:58,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186306981] [2021-06-05 14:17:58,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:17:58,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:17:58,531 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:17:58,531 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186306981] [2021-06-05 14:17:58,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186306981] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:58,531 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968245615] [2021-06-05 14:17:58,531 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 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:17:58,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:17:58,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:17:58,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:17:58,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:17:58,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 25 treesize of output 19 [2021-06-05 14:17:58,687 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:58,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:17:58,692 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:58,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:58,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:17:58,722 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:58,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:17:58,725 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:58,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:58,750 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:58,750 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:74 [2021-06-05 14:17:58,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 17 treesize of output 13 [2021-06-05 14:17:58,813 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:58,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 19 treesize of output 15 [2021-06-05 14:17:58,817 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:58,855 INFO L628 ElimStorePlain]: treesize reduction 41, result has 64.3 percent of original size [2021-06-05 14:17:58,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 19 treesize of output 15 [2021-06-05 14:17:58,858 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:58,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:58,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 13 treesize of output 9 [2021-06-05 14:17:58,878 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:58,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:58,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:17:58,897 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:17:58,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:58,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 27 treesize of output 21 [2021-06-05 14:17:58,916 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:17:58,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:17:58,928 INFO L518 ElimStorePlain]: Eliminatee v_prenex_143 vanished before elimination [2021-06-05 14:17:58,929 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:17:58,929 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:125, output treesize:32 [2021-06-05 14:17:58,977 INFO L134 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:17:58,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968245615] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:17:58,977 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:17:58,977 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 14:17:58,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874685310] [2021-06-05 14:17:58,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:17:58,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:17:58,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:17:58,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:17:58,997 INFO L87 Difference]: Start difference. First operand 303 states and 937 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:17:59,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:17:59,531 INFO L93 Difference]: Finished difference Result 348 states and 1061 transitions. [2021-06-05 14:17:59,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 14:17:59,532 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 17 [2021-06-05 14:17:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:17:59,532 INFO L225 Difference]: With dead ends: 348 [2021-06-05 14:17:59,532 INFO L226 Difference]: Without dead ends: 337 [2021-06-05 14:17:59,533 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 781.9ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:17:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-06-05 14:17:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 301. [2021-06-05 14:17:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.1033333333333335) internal successors, (931), 300 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:17:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 931 transitions. [2021-06-05 14:17:59,537 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 931 transitions. Word has length 17 [2021-06-05 14:17:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:17:59,537 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 931 transitions. [2021-06-05 14:17:59,537 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:17:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 931 transitions. [2021-06-05 14:17:59,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:17:59,537 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:17:59,537 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:17:59,744 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 179 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable894 [2021-06-05 14:17:59,745 INFO L430 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:17:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:17:59,745 INFO L82 PathProgramCache]: Analyzing trace with hash -326980856, now seen corresponding path program 33 times [2021-06-05 14:17:59,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:17:59,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800211354] [2021-06-05 14:17:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:17:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:00,001 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2021-06-05 14:18:00,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:18:00,241 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:00,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800211354] [2021-06-05 14:18:00,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800211354] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:00,242 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938941777] [2021-06-05 14:18:00,242 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 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:18:00,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:18:00,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:00,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:18:00,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:00,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:00,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 25 treesize of output 19 [2021-06-05 14:18:00,387 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:00,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:00,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 25 treesize of output 19 [2021-06-05 14:18:00,392 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:00,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:00,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:18:00,396 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:00,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:18:00,400 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:00,451 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:00,453 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:00,453 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:163, output treesize:128 [2021-06-05 14:18:00,644 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_144], 1=[array_4, v_prenex_145]} [2021-06-05 14:18:00,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 27 treesize of output 21 [2021-06-05 14:18:00,649 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:00,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 38 treesize of output 30 [2021-06-05 14:18:00,654 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:00,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 25 treesize of output 19 [2021-06-05 14:18:00,659 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:00,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 35 treesize of output 27 [2021-06-05 14:18:00,663 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:00,780 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-06-05 14:18:00,780 INFO L628 ElimStorePlain]: treesize reduction 148, result has 53.8 percent of original size [2021-06-05 14:18:00,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 7 treesize of output 5 [2021-06-05 14:18:00,785 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18: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 28 treesize of output 22 [2021-06-05 14:18:00,789 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:00,922 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-06-05 14:18:00,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:00,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:00,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 22 treesize of output 14 [2021-06-05 14:18:00,927 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:00,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:00,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:18:00,932 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:00,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 14:18:00,936 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:00,987 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18: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 10 treesize of output 6 [2021-06-05 14:18:00,997 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:01,047 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:01,049 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:18:01,049 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:351, output treesize:113 [2021-06-05 14:18:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:18:01,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938941777] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:01,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:01,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:18:01,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440709081] [2021-06-05 14:18:01,207 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:18:01,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:01,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:18:01,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:18:01,208 INFO L87 Difference]: Start difference. First operand 301 states and 931 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:18:01,645 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2021-06-05 14:18:01,847 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2021-06-05 14:18:02,084 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2021-06-05 14:18:02,525 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2021-06-05 14:18:02,846 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2021-06-05 14:18:03,100 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 71 [2021-06-05 14:18:03,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:03,188 INFO L93 Difference]: Finished difference Result 407 states and 1230 transitions. [2021-06-05 14:18:03,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:18:03,188 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:18:03,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:03,189 INFO L225 Difference]: With dead ends: 407 [2021-06-05 14:18:03,189 INFO L226 Difference]: Without dead ends: 391 [2021-06-05 14:18:03,189 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2113.5ms TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:18:03,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-06-05 14:18:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 303. [2021-06-05 14:18:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.1026490066225167) internal successors, (937), 302 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 937 transitions. [2021-06-05 14:18:03,193 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 937 transitions. Word has length 17 [2021-06-05 14:18:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:03,193 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 937 transitions. [2021-06-05 14:18:03,193 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:18:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 937 transitions. [2021-06-05 14:18:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:03,193 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:03,193 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:18:03,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable903,180 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:18:03,394 INFO L430 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:03,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:03,394 INFO L82 PathProgramCache]: Analyzing trace with hash 947967822, now seen corresponding path program 34 times [2021-06-05 14:18:03,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:03,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98155775] [2021-06-05 14:18:03,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:03,781 INFO L134 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:18:03,781 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:03,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98155775] [2021-06-05 14:18:03,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98155775] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:03,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323317282] [2021-06-05 14:18:03,782 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 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:18:03,822 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:18:03,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:03,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:18:03,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:03,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:03,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 15 treesize of output 11 [2021-06-05 14:18:03,994 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:04,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:04,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 35 treesize of output 27 [2021-06-05 14:18:04,020 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:04,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:04,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 25 treesize of output 19 [2021-06-05 14:18:04,026 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:04,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:04,031 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:04,091 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:04,092 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:04,092 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:167, output treesize:132 [2021-06-05 14:18:04,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 18 treesize of output 14 [2021-06-05 14:18:04,286 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:04,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 20 treesize of output 16 [2021-06-05 14:18:04,291 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:04,342 INFO L628 ElimStorePlain]: treesize reduction 32, result has 74.2 percent of original size [2021-06-05 14:18:04,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 10 treesize of output 6 [2021-06-05 14:18:04,347 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:04,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:18:04,351 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:04,376 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:04,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 19 treesize of output 15 [2021-06-05 14:18:04,380 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:04,401 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:04,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 11 treesize of output 7 [2021-06-05 14:18:04,406 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:04,427 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:04,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:18:04,431 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:04,458 INFO L628 ElimStorePlain]: treesize reduction 14, result has 74.1 percent of original size [2021-06-05 14:18:04,458 INFO L518 ElimStorePlain]: Eliminatee v_prenex_149 vanished before elimination [2021-06-05 14:18:04,459 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:04,459 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:138, output treesize:32 [2021-06-05 14:18:04,495 INFO L134 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:18:04,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323317282] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:04,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:04,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:18:04,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144511655] [2021-06-05 14:18:04,496 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:18:04,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:04,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:18:04,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:18:04,496 INFO L87 Difference]: Start difference. First operand 303 states and 937 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:18:05,084 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 63 [2021-06-05 14:18:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:05,154 INFO L93 Difference]: Finished difference Result 363 states and 1105 transitions. [2021-06-05 14:18:05,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:18:05,155 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:18:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:05,155 INFO L225 Difference]: With dead ends: 363 [2021-06-05 14:18:05,155 INFO L226 Difference]: Without dead ends: 353 [2021-06-05 14:18:05,155 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 984.5ms TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:18:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-06-05 14:18:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 305. [2021-06-05 14:18:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.101973684210526) internal successors, (943), 304 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:18:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 943 transitions. [2021-06-05 14:18:05,158 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 943 transitions. Word has length 17 [2021-06-05 14:18:05,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:05,158 INFO L482 AbstractCegarLoop]: Abstraction has 305 states and 943 transitions. [2021-06-05 14:18:05,158 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:18:05,159 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 943 transitions. [2021-06-05 14:18:05,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:05,159 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:05,159 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:18:05,359 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable915,181 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:18:05,359 INFO L430 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:05,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1290551334, now seen corresponding path program 35 times [2021-06-05 14:18:05,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:05,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431522192] [2021-06-05 14:18:05,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:05,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:18:05,666 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:05,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431522192] [2021-06-05 14:18:05,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431522192] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:05,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926735889] [2021-06-05 14:18:05,666 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 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:18:05,693 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-05 14:18:05,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:05,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:18:05,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:05,801 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:05,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:05,802 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:05,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:05,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 15 treesize of output 11 [2021-06-05 14:18:05,806 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:05,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:05,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 25 treesize of output 19 [2021-06-05 14:18:05,812 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:05,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 35 treesize of output 27 [2021-06-05 14:18:05,815 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:05,856 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:05,858 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:05,858 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:175, output treesize:141 [2021-06-05 14:18:05,939 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_150, v_prenex_152, v_prenex_154], 1=[v_prenex_151, array_2, v_prenex_153, v_prenex_155]} [2021-06-05 14:18:05,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 23 [2021-06-05 14:18:05,948 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:05,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 39 treesize of output 31 [2021-06-05 14:18:05,952 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:06,062 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:18:06,062 INFO L628 ElimStorePlain]: treesize reduction 140, result has 55.1 percent of original size [2021-06-05 14:18:06,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:18:06,066 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:06,110 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:06,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 27 treesize of output 21 [2021-06-05 14:18:06,113 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:06,154 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:06,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 27 treesize of output 21 [2021-06-05 14:18:06,158 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:06,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:06,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_151 vanished before elimination [2021-06-05 14:18:06,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:06,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 14:18:06,202 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:06,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 22 treesize of output 14 [2021-06-05 14:18:06,205 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:06,243 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:06,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:18:06,247 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:06,283 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:06,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:18:06,287 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:06,322 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:06,324 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:18:06,324 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:329, output treesize:100 [2021-06-05 14:18:06,445 INFO L134 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:18:06,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926735889] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:06,445 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:06,445 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 14:18:06,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566429887] [2021-06-05 14:18:06,446 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:18:06,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:06,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:18:06,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:18:06,446 INFO L87 Difference]: Start difference. First operand 305 states and 943 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:18:06,987 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2021-06-05 14:18:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:07,201 INFO L93 Difference]: Finished difference Result 361 states and 1099 transitions. [2021-06-05 14:18:07,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:18:07,202 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:18:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:07,202 INFO L225 Difference]: With dead ends: 361 [2021-06-05 14:18:07,202 INFO L226 Difference]: Without dead ends: 350 [2021-06-05 14:18:07,202 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 931.4ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:18:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-06-05 14:18:07,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 303. [2021-06-05 14:18:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.1026490066225167) internal successors, (937), 302 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 937 transitions. [2021-06-05 14:18:07,206 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 937 transitions. Word has length 17 [2021-06-05 14:18:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:07,206 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 937 transitions. [2021-06-05 14:18:07,206 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:18:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 937 transitions. [2021-06-05 14:18:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:07,206 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:07,206 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:18:07,407 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable929,182 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:18:07,407 INFO L430 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:07,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:07,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2132806164, now seen corresponding path program 36 times [2021-06-05 14:18:07,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:07,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134221523] [2021-06-05 14:18:07,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:07,710 INFO L134 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:18:07,710 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:07,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134221523] [2021-06-05 14:18:07,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134221523] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:07,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352476860] [2021-06-05 14:18:07,710 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 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:18:07,737 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:18:07,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:07,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:18:07,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:07,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:07,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:07,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:18:07,935 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:07,939 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:07,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:07,940 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,010 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:08,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:08,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:08,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 25 treesize of output 19 [2021-06-05 14:18:08,015 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:08,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 15 treesize of output 11 [2021-06-05 14:18:08,019 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,075 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:08,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:08,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:08,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 27 treesize of output 21 [2021-06-05 14:18:08,081 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:08,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 25 treesize of output 19 [2021-06-05 14:18:08,085 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,134 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:08,137 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 14:18:08,137 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:241, output treesize:201 [2021-06-05 14:18:08,515 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_171, array_2, v_prenex_163, v_prenex_165, v_prenex_167, v_prenex_169], 1=[v_prenex_170, v_prenex_172, array_4, v_prenex_164, v_prenex_166, v_prenex_168]} [2021-06-05 14:18:08,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 27 treesize of output 21 [2021-06-05 14:18:08,523 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,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 25 treesize of output 19 [2021-06-05 14:18:08,531 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,718 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 92 [2021-06-05 14:18:08,718 INFO L628 ElimStorePlain]: treesize reduction 197, result has 52.6 percent of original size [2021-06-05 14:18:08,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 7 treesize of output 5 [2021-06-05 14:18:08,723 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,777 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:08,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 27 treesize of output 21 [2021-06-05 14:18:08,782 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,834 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:08,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 7 treesize of output 5 [2021-06-05 14:18:08,839 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:08,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 27 treesize of output 21 [2021-06-05 14:18:08,893 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:08,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 29 treesize of output 23 [2021-06-05 14:18:08,949 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 14:18:08,954 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:08,998 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:09,002 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:09,003 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:09,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 22 treesize of output 14 [2021-06-05 14:18:09,004 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:09,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:09,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 14:18:09,008 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:09,052 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:09,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:09,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:18:09,058 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:09,100 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:09,100 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:18:09,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:09,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:18:09,105 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:09,148 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:09,148 INFO L518 ElimStorePlain]: Eliminatee v_prenex_166 vanished before elimination [2021-06-05 14:18:09,151 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:09,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:18:09,152 INFO L550 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:09,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:09,195 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:18:09,195 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:435, output treesize:67 [2021-06-05 14:18:09,246 INFO L134 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:18:09,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352476860] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:09,246 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:09,246 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:18:09,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150292171] [2021-06-05 14:18:09,247 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:18:09,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:09,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:18:09,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:18:09,247 INFO L87 Difference]: Start difference. First operand 303 states and 937 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:10,087 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 125 [2021-06-05 14:18:10,309 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2021-06-05 14:18:10,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:10,349 INFO L93 Difference]: Finished difference Result 384 states and 1130 transitions. [2021-06-05 14:18:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:18:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:18:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:10,349 INFO L225 Difference]: With dead ends: 384 [2021-06-05 14:18:10,350 INFO L226 Difference]: Without dead ends: 370 [2021-06-05 14:18:10,350 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1350.0ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:18:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-06-05 14:18:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 306. [2021-06-05 14:18:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 3.095081967213115) internal successors, (944), 305 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 944 transitions. [2021-06-05 14:18:10,353 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 944 transitions. Word has length 17 [2021-06-05 14:18:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:10,353 INFO L482 AbstractCegarLoop]: Abstraction has 306 states and 944 transitions. [2021-06-05 14:18:10,353 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 944 transitions. [2021-06-05 14:18:10,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:10,354 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:10,354 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:18:10,554 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 183 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable942 [2021-06-05 14:18:10,554 INFO L430 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:10,555 INFO L82 PathProgramCache]: Analyzing trace with hash 213094778, now seen corresponding path program 37 times [2021-06-05 14:18:10,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:10,555 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51699936] [2021-06-05 14:18:10,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:10,883 INFO L134 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:18:10,883 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:10,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51699936] [2021-06-05 14:18:10,883 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51699936] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:10,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725038404] [2021-06-05 14:18:10,883 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 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:18:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:10,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:18:10,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:11,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:11,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:11,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 35 treesize of output 27 [2021-06-05 14:18:11,102 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:11,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:11,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:11,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:18:11,106 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:11,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:11,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:11,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:11,111 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:11,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:11,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:11,115 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:11,170 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:11,172 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:11,172 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:195, output treesize:161 [2021-06-05 14:18:11,619 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_181, v_prenex_183, array_2, v_prenex_185, v_prenex_187, v_prenex_189], 1=[v_prenex_190, v_prenex_182, v_prenex_184, array_4, v_prenex_186, v_prenex_188]} [2021-06-05 14:18:11,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 19 treesize of output 15 [2021-06-05 14:18:11,627 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:11,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 17 treesize of output 13 [2021-06-05 14:18:11,634 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:11,844 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2021-06-05 14:18:11,845 INFO L628 ElimStorePlain]: treesize reduction 206, result has 51.1 percent of original size [2021-06-05 14:18:11,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 27 treesize of output 21 [2021-06-05 14:18:11,851 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:11,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:11,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 27 treesize of output 21 [2021-06-05 14:18:11,927 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:11,980 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:11,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:18:11,985 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:12,037 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:12,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 19 treesize of output 15 [2021-06-05 14:18:12,042 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:12,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 31 treesize of output 25 [2021-06-05 14:18:12,047 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:12,103 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:12,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 7 treesize of output 5 [2021-06-05 14:18:12,108 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:12,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:12,153 INFO L518 ElimStorePlain]: Eliminatee v_prenex_190 vanished before elimination [2021-06-05 14:18:12,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:12,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 11 treesize of output 7 [2021-06-05 14:18:12,159 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:12,203 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:12,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:12,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:18:12,210 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:12,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:12,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:12,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:18:12,267 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:12,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:12,310 INFO L518 ElimStorePlain]: Eliminatee v_prenex_186 vanished before elimination [2021-06-05 14:18:12,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:12,314 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:12,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 12 treesize of output 8 [2021-06-05 14:18:12,315 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:12,319 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:12,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:18:12,320 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:12,362 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:12,365 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 14:18:12,365 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:435, output treesize:81 [2021-06-05 14:18:12,421 INFO L134 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:18:12,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725038404] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:12,421 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:12,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:18:12,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672932106] [2021-06-05 14:18:12,422 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:18:12,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:12,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:18:12,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:18:12,422 INFO L87 Difference]: Start difference. First operand 306 states and 944 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:13,296 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2021-06-05 14:18:13,565 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 108 [2021-06-05 14:18:13,845 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 114 [2021-06-05 14:18:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:13,916 INFO L93 Difference]: Finished difference Result 375 states and 1128 transitions. [2021-06-05 14:18:13,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 14:18:13,916 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:18:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:13,917 INFO L225 Difference]: With dead ends: 375 [2021-06-05 14:18:13,917 INFO L226 Difference]: Without dead ends: 356 [2021-06-05 14:18:13,917 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1733.0ms TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:18:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-06-05 14:18:13,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 308. [2021-06-05 14:18:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 3.0912052117263844) internal successors, (949), 307 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 949 transitions. [2021-06-05 14:18:13,920 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 949 transitions. Word has length 17 [2021-06-05 14:18:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:13,920 INFO L482 AbstractCegarLoop]: Abstraction has 308 states and 949 transitions. [2021-06-05 14:18:13,920 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 949 transitions. [2021-06-05 14:18:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:13,921 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:13,921 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:18:14,121 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 184 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable986 [2021-06-05 14:18:14,121 INFO L430 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1694332648, now seen corresponding path program 38 times [2021-06-05 14:18:14,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:14,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534796917] [2021-06-05 14:18:14,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:14,346 INFO L134 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:18:14,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:14,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534796917] [2021-06-05 14:18:14,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534796917] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:14,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602020565] [2021-06-05 14:18:14,347 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 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:18:14,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:18:14,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:14,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:18:14,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:14,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 15 treesize of output 11 [2021-06-05 14:18:14,467 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:14,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 25 treesize of output 19 [2021-06-05 14:18:14,470 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:14,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:14,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:18:14,501 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:14,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 25 treesize of output 19 [2021-06-05 14:18:14,504 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:14,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:14,529 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:14,529 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:96 [2021-06-05 14:18:14,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:14,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 25 treesize of output 19 [2021-06-05 14:18:14,703 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:14,788 INFO L628 ElimStorePlain]: treesize reduction 114, result has 48.6 percent of original size [2021-06-05 14:18:14,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:14,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 27 treesize of output 21 [2021-06-05 14:18:14,794 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:14,822 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:14,823 INFO L518 ElimStorePlain]: Eliminatee v_prenex_193 vanished before elimination [2021-06-05 14:18:14,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:14,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 28 treesize of output 22 [2021-06-05 14:18:14,828 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:14,855 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:14,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18: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 21 treesize of output 13 [2021-06-05 14:18:14,860 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:14,886 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:14,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:14,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 11 treesize of output 7 [2021-06-05 14:18:14,891 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:14,914 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:14,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:14,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 15 [2021-06-05 14:18:14,919 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:14,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:14,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:14,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 11 treesize of output 7 [2021-06-05 14:18:14,941 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:14,960 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:14,961 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:14,961 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:233, output treesize:38 [2021-06-05 14:18:15,000 INFO L134 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:18:15,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602020565] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:15,000 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:15,000 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:18:15,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596312723] [2021-06-05 14:18:15,000 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:18:15,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:18:15,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:18:15,000 INFO L87 Difference]: Start difference. First operand 308 states and 949 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:18:15,913 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2021-06-05 14:18:16,048 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2021-06-05 14:18:16,248 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2021-06-05 14:18:16,389 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2021-06-05 14:18:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:16,467 INFO L93 Difference]: Finished difference Result 370 states and 1110 transitions. [2021-06-05 14:18:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 14:18:16,467 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:18:16,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:16,467 INFO L225 Difference]: With dead ends: 370 [2021-06-05 14:18:16,467 INFO L226 Difference]: Without dead ends: 357 [2021-06-05 14:18:16,468 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1458.4ms TimeCoverageRelationStatistics Valid=131, Invalid=519, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:18:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-06-05 14:18:16,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 301. [2021-06-05 14:18:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 14:18:16,471 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 14:18:16,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:16,471 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 14:18:16,471 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:18:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 14:18:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:16,471 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:16,471 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:18:16,672 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 185 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1017 [2021-06-05 14:18:16,672 INFO L430 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:16,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:16,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1115333512, now seen corresponding path program 39 times [2021-06-05 14:18:16,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:16,672 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778105091] [2021-06-05 14:18:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:16,928 INFO L134 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:18:16,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:16,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778105091] [2021-06-05 14:18:16,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778105091] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:16,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940248117] [2021-06-05 14:18:16,929 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 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:18:16,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:18:16,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:16,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:18:16,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:17,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:17,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:17,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 25 treesize of output 19 [2021-06-05 14:18:17,026 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:17,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:17,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:17,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:18:17,032 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:17,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:17,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:17,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 15 treesize of output 11 [2021-06-05 14:18:17,037 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:17,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:17,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:17,041 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:17,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:17,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:17,098 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:143 [2021-06-05 14:18:17,602 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_208, array_2, v_prenex_210, v_prenex_212, v_prenex_214, v_prenex_216], 1=[v_prenex_217, v_prenex_209, array_4, v_prenex_211, v_prenex_213, v_prenex_215]} [2021-06-05 14:18: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 15 treesize of output 11 [2021-06-05 14:18:17,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:17,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 25 treesize of output 19 [2021-06-05 14:18:17,617 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:17,817 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 90 [2021-06-05 14:18:17,818 INFO L628 ElimStorePlain]: treesize reduction 206, result has 51.5 percent of original size [2021-06-05 14:18:17,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 27 treesize of output 21 [2021-06-05 14:18:17,823 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:17,881 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:17,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:18:17,886 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:17,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:17,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 27 treesize of output 21 [2021-06-05 14:18:17,948 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:18,002 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:18,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:18:18,007 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:18,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:18,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 19 treesize of output 15 [2021-06-05 14:18:18,064 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:18,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 25 [2021-06-05 14:18:18,069 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:18,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:18,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:18,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:18,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 12 treesize of output 8 [2021-06-05 14:18:18,134 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:18,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:18,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 12 treesize of output 8 [2021-06-05 14:18:18,139 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:18,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:18,185 INFO L518 ElimStorePlain]: Eliminatee v_prenex_209 vanished before elimination [2021-06-05 14:18:18,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:18,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 14:18:18,190 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:18,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:18,236 INFO L518 ElimStorePlain]: Eliminatee v_prenex_211 vanished before elimination [2021-06-05 14:18:18,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:18,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 21 treesize of output 13 [2021-06-05 14:18:18,241 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:18,287 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:18,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:18,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:18:18,292 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:18,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:18,340 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:18:18,340 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:439, output treesize:71 [2021-06-05 14:18:18,392 INFO L134 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:18:18,392 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940248117] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:18,392 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:18,392 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:18:18,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070204183] [2021-06-05 14:18:18,392 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:18:18,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:18,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:18:18,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:18:18,392 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:18,685 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2021-06-05 14:18:19,033 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2021-06-05 14:18:19,209 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2021-06-05 14:18:19,823 WARN L205 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 131 [2021-06-05 14:18:20,145 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 110 [2021-06-05 14:18:20,303 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-06-05 14:18:20,687 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2021-06-05 14:18:20,969 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 96 [2021-06-05 14:18:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:21,079 INFO L93 Difference]: Finished difference Result 489 states and 1426 transitions. [2021-06-05 14:18:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 14:18:21,079 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:18:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:21,080 INFO L225 Difference]: With dead ends: 489 [2021-06-05 14:18:21,080 INFO L226 Difference]: Without dead ends: 458 [2021-06-05 14:18:21,080 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2845.9ms TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2021-06-05 14:18:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-06-05 14:18:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 301. [2021-06-05 14:18:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 14:18:21,083 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 14:18:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:21,083 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 14:18:21,083 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 14:18:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:21,084 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:21,084 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:18:21,284 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 186 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1058 [2021-06-05 14:18:21,284 INFO L430 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash 672434372, now seen corresponding path program 40 times [2021-06-05 14:18:21,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:21,285 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538333099] [2021-06-05 14:18:21,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:18:21,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:21,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538333099] [2021-06-05 14:18:21,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538333099] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:21,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153946816] [2021-06-05 14:18:21,747 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 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:18:21,773 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:18:21,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:21,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:18:21,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:21,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:21,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:21,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 25 treesize of output 19 [2021-06-05 14:18:21,851 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:21,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:21,854 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:21,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 35 treesize of output 27 [2021-06-05 14:18:21,855 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:21,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:21,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:21,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 15 treesize of output 11 [2021-06-05 14:18:21,859 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:21,861 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:21,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 25 treesize of output 19 [2021-06-05 14:18:21,862 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:21,905 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:21,906 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:21,906 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:143 [2021-06-05 14:18:22,367 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_229, array_2, v_prenex_231, v_prenex_233, v_prenex_225, v_prenex_227], 1=[v_prenex_228, array_4, v_prenex_230, v_prenex_232, v_prenex_234, v_prenex_226]} [2021-06-05 14:18:22,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 25 treesize of output 19 [2021-06-05 14:18:22,375 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:22,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:18:22,383 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:22,588 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2021-06-05 14:18:22,588 INFO L628 ElimStorePlain]: treesize reduction 204, result has 51.2 percent of original size [2021-06-05 14:18:22,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 27 treesize of output 21 [2021-06-05 14:18:22,593 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:22,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:22,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 27 treesize of output 21 [2021-06-05 14:18:22,656 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:22,712 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:22,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 7 treesize of output 5 [2021-06-05 14:18:22,717 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:22,771 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:22,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 19 treesize of output 15 [2021-06-05 14:18:22,776 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:22,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 31 treesize of output 25 [2021-06-05 14:18:22,781 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:22,830 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:22,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:18:22,835 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:22,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:22,882 INFO L518 ElimStorePlain]: Eliminatee v_prenex_228 vanished before elimination [2021-06-05 14:18:22,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:22,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 21 treesize of output 13 [2021-06-05 14:18:22,887 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:22,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:22,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:22,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 10 treesize of output 6 [2021-06-05 14:18:22,942 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:22,987 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:22,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:22,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:18:22,992 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:23,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:23,042 INFO L518 ElimStorePlain]: Eliminatee v_prenex_234 vanished before elimination [2021-06-05 14:18:23,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:23,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:23,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 11 treesize of output 7 [2021-06-05 14:18:23,047 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:23,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:23,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 12 treesize of output 8 [2021-06-05 14:18:23,052 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:23,095 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:23,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 14:18:23,098 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:439, output treesize:81 [2021-06-05 14:18:23,155 INFO L134 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:18:23,155 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153946816] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:23,156 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:23,156 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:18:23,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641217404] [2021-06-05 14:18:23,156 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:18:23,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:18:23,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:18:23,156 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:23,545 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-06-05 14:18:23,942 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 98 [2021-06-05 14:18:24,158 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2021-06-05 14:18:24,808 WARN L205 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 138 [2021-06-05 14:18:25,215 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 125 [2021-06-05 14:18:25,398 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-06-05 14:18:25,839 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 110 [2021-06-05 14:18:26,167 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2021-06-05 14:18:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:26,298 INFO L93 Difference]: Finished difference Result 483 states and 1377 transitions. [2021-06-05 14:18:26,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 14:18:26,298 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:18:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:26,299 INFO L225 Difference]: With dead ends: 483 [2021-06-05 14:18:26,299 INFO L226 Difference]: Without dead ends: 437 [2021-06-05 14:18:26,299 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 3333.1ms TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:18:26,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-06-05 14:18:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 305. [2021-06-05 14:18:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.0921052631578947) internal successors, (940), 304 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:18:26,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 940 transitions. [2021-06-05 14:18:26,302 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 940 transitions. Word has length 17 [2021-06-05 14:18:26,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:26,302 INFO L482 AbstractCegarLoop]: Abstraction has 305 states and 940 transitions. [2021-06-05 14:18:26,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 940 transitions. [2021-06-05 14:18:26,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:26,303 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:26,303 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:18:26,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1092,187 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:18:26,503 INFO L430 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:26,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:26,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1633532686, now seen corresponding path program 41 times [2021-06-05 14:18:26,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:26,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624610450] [2021-06-05 14:18:26,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:26,912 INFO L134 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:18:26,912 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:26,912 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624610450] [2021-06-05 14:18:26,912 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624610450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:26,912 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495176296] [2021-06-05 14:18:26,912 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 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:18:26,937 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:18:26,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:26,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 14:18:26,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:27,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:27,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:27,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:27,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:27,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:27,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 27 treesize of output 21 [2021-06-05 14:18:27,108 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:27,142 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:27,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:27,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:27,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 25 treesize of output 19 [2021-06-05 14:18:27,146 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:27,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:27,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 15 treesize of output 11 [2021-06-05 14:18:27,150 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:27,181 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:27,184 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:18:27,184 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:107 [2021-06-05 14:18:27,353 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_240, v_prenex_242, v_prenex_244], 1=[v_prenex_241, array_4, v_prenex_243, v_prenex_245]} [2021-06-05 14:18:27,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 25 treesize of output 19 [2021-06-05 14:18:27,358 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:27,423 INFO L628 ElimStorePlain]: treesize reduction 113, result has 48.6 percent of original size [2021-06-05 14:18:27,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 19 treesize of output 15 [2021-06-05 14:18:27,426 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:27,449 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:27,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 27 treesize of output 21 [2021-06-05 14:18:27,452 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:27,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:27,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 27 treesize of output 21 [2021-06-05 14:18:27,476 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:27,496 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:27,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:27,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 11 treesize of output 7 [2021-06-05 14:18:27,500 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:27,519 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:27,519 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:18:27,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:27,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:18:27,523 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:27,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:27,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:27,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 11 treesize of output 7 [2021-06-05 14:18:27,546 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:27,565 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:27,566 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:27,566 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:231, output treesize:38 [2021-06-05 14:18:27,603 INFO L134 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:18:27,603 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495176296] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:27,603 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:27,603 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:18:27,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234691015] [2021-06-05 14:18:27,603 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:18:27,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:27,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:18:27,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:18:27,604 INFO L87 Difference]: Start difference. First operand 305 states and 940 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:28,040 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2021-06-05 14:18:28,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:28,604 INFO L93 Difference]: Finished difference Result 380 states and 1151 transitions. [2021-06-05 14:18:28,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:18:28,604 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:18:28,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:28,605 INFO L225 Difference]: With dead ends: 380 [2021-06-05 14:18:28,605 INFO L226 Difference]: Without dead ends: 370 [2021-06-05 14:18:28,605 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1170.6ms TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:18:28,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2021-06-05 14:18:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 307. [2021-06-05 14:18:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 3.0915032679738563) internal successors, (946), 306 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:18:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 946 transitions. [2021-06-05 14:18:28,608 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 946 transitions. Word has length 17 [2021-06-05 14:18:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:28,608 INFO L482 AbstractCegarLoop]: Abstraction has 307 states and 946 transitions. [2021-06-05 14:18:28,608 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 946 transitions. [2021-06-05 14:18:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:28,609 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:28,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:18:28,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 188 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1126 [2021-06-05 14:18:28,810 INFO L430 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:28,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:28,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1560160206, now seen corresponding path program 42 times [2021-06-05 14:18:28,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:28,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883602466] [2021-06-05 14:18:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:29,047 INFO L134 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:18:29,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:29,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883602466] [2021-06-05 14:18:29,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883602466] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:29,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012331133] [2021-06-05 14:18:29,047 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 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:18:29,072 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:18:29,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:29,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:18:29,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:29,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:29,308 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:18:29,313 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,370 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:29,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:18:29,377 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,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 25 treesize of output 19 [2021-06-05 14:18:29,382 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,436 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:29,441 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:18:29,441 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:192, output treesize:162 [2021-06-05 14:18:29,600 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 14:18:29,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,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 25 treesize of output 19 [2021-06-05 14:18:29,606 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,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 35 treesize of output 27 [2021-06-05 14:18:29,612 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,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 29 treesize of output 23 [2021-06-05 14:18:29,619 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,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 35 treesize of output 27 [2021-06-05 14:18:29,625 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:29,632 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,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 25 treesize of output 19 [2021-06-05 14:18:29,639 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:18:29,646 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,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 39 treesize of output 31 [2021-06-05 14:18:29,652 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,803 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2021-06-05 14:18:29,803 INFO L628 ElimStorePlain]: treesize reduction 146, result has 56.5 percent of original size [2021-06-05 14:18:29,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,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 21 treesize of output 13 [2021-06-05 14:18:29,817 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,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 22 treesize of output 14 [2021-06-05 14:18:29,822 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,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 24 treesize of output 16 [2021-06-05 14:18:29,827 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:29,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:29,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 11 treesize of output 7 [2021-06-05 14:18:29,832 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:29,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:29,888 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:18:29,888 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:411, output treesize:103 [2021-06-05 14:18:30,017 INFO L134 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:18:30,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012331133] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:30,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:30,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:18:30,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309906860] [2021-06-05 14:18:30,018 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:18:30,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:18:30,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:18:30,018 INFO L87 Difference]: Start difference. First operand 307 states and 946 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:30,594 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2021-06-05 14:18:30,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:30,718 INFO L93 Difference]: Finished difference Result 358 states and 1087 transitions. [2021-06-05 14:18:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:18:30,718 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:18:30,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:30,719 INFO L225 Difference]: With dead ends: 358 [2021-06-05 14:18:30,719 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 14:18:30,719 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 865.4ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:18:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 14:18:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 301. [2021-06-05 14:18:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 3.0933333333333333) internal successors, (928), 300 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 928 transitions. [2021-06-05 14:18:30,723 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 928 transitions. Word has length 17 [2021-06-05 14:18:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:30,723 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 928 transitions. [2021-06-05 14:18:30,723 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 928 transitions. [2021-06-05 14:18:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:30,724 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:30,724 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:18:30,945 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1151,189 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:18:30,946 INFO L430 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1698524914, now seen corresponding path program 43 times [2021-06-05 14:18:30,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:30,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664361187] [2021-06-05 14:18:30,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:31,555 INFO L134 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:18:31,555 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:31,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664361187] [2021-06-05 14:18:31,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664361187] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:31,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611491893] [2021-06-05 14:18:31,556 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 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:18:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:31,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:18:31,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:31,827 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_252], 3=[array_0]} [2021-06-05 14:18:31,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:31,832 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:31,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 25 treesize of output 19 [2021-06-05 14:18:31,833 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:31,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:31,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 27 treesize of output 21 [2021-06-05 14:18:31,848 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:31,901 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:31,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:31,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:31,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:18:31,907 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:31,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:31,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 25 treesize of output 19 [2021-06-05 14:18:31,911 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:31,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:31,966 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:18:31,966 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:149, output treesize:113 [2021-06-05 14:18:32,110 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_255, v_prenex_257, v_prenex_259], 1=[v_prenex_260, array_4, v_prenex_256, v_prenex_258]} [2021-06-05 14:18:32,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 21 treesize of output 17 [2021-06-05 14:18:32,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:32,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 19 treesize of output 15 [2021-06-05 14:18:32,120 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:32,213 INFO L628 ElimStorePlain]: treesize reduction 96, result has 60.2 percent of original size [2021-06-05 14:18:32,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 19 treesize of output 15 [2021-06-05 14:18:32,217 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:32,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:32,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:18:32,255 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:32,287 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:32,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 7 treesize of output 5 [2021-06-05 14:18:32,290 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:32,321 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:32,322 INFO L518 ElimStorePlain]: Eliminatee v_prenex_260 vanished before elimination [2021-06-05 14:18:32,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:32,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:32,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:18:32,326 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:32,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:32,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 14 treesize of output 10 [2021-06-05 14:18:32,331 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:32,361 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:32,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:32,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:18:32,374 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:32,402 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:32,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:32,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 21 treesize of output 13 [2021-06-05 14:18:32,406 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:32,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:32,436 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:18:32,436 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:253, output treesize:48 [2021-06-05 14:18:32,486 INFO L134 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:18:32,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611491893] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:32,486 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:32,486 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:18:32,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493692792] [2021-06-05 14:18:32,486 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:18:32,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:32,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:18:32,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:18:32,487 INFO L87 Difference]: Start difference. First operand 301 states and 928 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:33,073 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 14:18:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:33,172 INFO L93 Difference]: Finished difference Result 357 states and 1080 transitions. [2021-06-05 14:18:33,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:18:33,172 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:18:33,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:33,173 INFO L225 Difference]: With dead ends: 357 [2021-06-05 14:18:33,173 INFO L226 Difference]: Without dead ends: 347 [2021-06-05 14:18:33,173 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1091.4ms TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:18:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-06-05 14:18:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 303. [2021-06-05 14:18:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.096026490066225) internal successors, (935), 302 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 935 transitions. [2021-06-05 14:18:33,176 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 935 transitions. Word has length 17 [2021-06-05 14:18:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:33,176 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 935 transitions. [2021-06-05 14:18:33,176 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 935 transitions. [2021-06-05 14:18:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:33,177 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:33,177 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:18:33,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1175,190 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:18:33,377 INFO L430 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash -217287044, now seen corresponding path program 44 times [2021-06-05 14:18:33,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:33,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055707492] [2021-06-05 14:18:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:18:33,562 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:33,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055707492] [2021-06-05 14:18:33,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055707492] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:33,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337243658] [2021-06-05 14:18:33,562 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 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:18:33,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:18:33,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:33,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:18:33,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:33,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 25 treesize of output 19 [2021-06-05 14:18:33,675 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:33,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 15 treesize of output 11 [2021-06-05 14:18:33,677 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:33,705 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:33,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 27 treesize of output 21 [2021-06-05 14:18:33,708 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:33,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 25 treesize of output 19 [2021-06-05 14:18:33,711 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:33,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:33,736 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:33,736 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:90 [2021-06-05 14:18:33,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,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 25 treesize of output 19 [2021-06-05 14:18:33,823 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:33,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,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 18 treesize of output 14 [2021-06-05 14:18:33,828 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:33,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,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 17 treesize of output 13 [2021-06-05 14:18:33,832 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:33,897 INFO L628 ElimStorePlain]: treesize reduction 125, result has 44.2 percent of original size [2021-06-05 14:18:33,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,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 27 treesize of output 21 [2021-06-05 14:18:33,901 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:33,903 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,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 27 treesize of output 21 [2021-06-05 14:18:33,904 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:33,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:33,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,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 11 treesize of output 7 [2021-06-05 14:18:33,929 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:33,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,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 22 treesize of output 14 [2021-06-05 14:18:33,933 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:33,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:33,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:33,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:18:33,957 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:33,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:33,978 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:33,978 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:245, output treesize:38 [2021-06-05 14:18:34,015 INFO L134 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:18:34,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337243658] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:34,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:34,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:18:34,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092822220] [2021-06-05 14:18:34,016 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:18:34,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:34,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:18:34,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:18:34,016 INFO L87 Difference]: Start difference. First operand 303 states and 935 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:18:34,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:34,666 INFO L93 Difference]: Finished difference Result 355 states and 1076 transitions. [2021-06-05 14:18:34,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:18:34,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:18:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:34,667 INFO L225 Difference]: With dead ends: 355 [2021-06-05 14:18:34,667 INFO L226 Difference]: Without dead ends: 345 [2021-06-05 14:18:34,667 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 699.0ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:18:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-06-05 14:18:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 302. [2021-06-05 14:18:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 3.0930232558139537) internal successors, (931), 301 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 931 transitions. [2021-06-05 14:18:34,671 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 931 transitions. Word has length 17 [2021-06-05 14:18:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:34,671 INFO L482 AbstractCegarLoop]: Abstraction has 302 states and 931 transitions. [2021-06-05 14:18:34,671 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:18:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 931 transitions. [2021-06-05 14:18:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:34,672 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:34,672 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:18:34,872 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1204,191 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:18:34,872 INFO L430 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:34,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:34,873 INFO L82 PathProgramCache]: Analyzing trace with hash 331629366, now seen corresponding path program 45 times [2021-06-05 14:18:34,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:34,873 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116422221] [2021-06-05 14:18:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:35,307 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 14:18:35,586 INFO L134 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:18:35,587 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:35,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116422221] [2021-06-05 14:18:35,587 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116422221] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:35,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518784863] [2021-06-05 14:18:35,587 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 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:18:35,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:18:35,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:35,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:18:35,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:35,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:35,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:35,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 25 treesize of output 19 [2021-06-05 14:18:35,820 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:35,823 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:35,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 27 treesize of output 21 [2021-06-05 14:18:35,825 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:35,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:35,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:35,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:35,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:18:35,879 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:35,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:35,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:35,909 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:35,945 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:35,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:18:35,950 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 14:18:36,368 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_271, array_2, v_prenex_273, v_prenex_269], 1=[v_prenex_270, v_prenex_272, array_4, v_prenex_274]} [2021-06-05 14:18:36,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 15 treesize of output 11 [2021-06-05 14:18:36,374 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:36,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:18:36,379 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:36,489 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2021-06-05 14:18:36,489 INFO L628 ElimStorePlain]: treesize reduction 85, result has 62.2 percent of original size [2021-06-05 14:18:36,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:18:36,494 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:36,537 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:36,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:18:36,543 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:36,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 14:18:36,547 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:36,593 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:36,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 27 treesize of output 21 [2021-06-05 14:18:36,597 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:36,633 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:36,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:36,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 21 treesize of output 13 [2021-06-05 14:18:36,639 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:36,674 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:36,674 INFO L518 ElimStorePlain]: Eliminatee v_prenex_272 vanished before elimination [2021-06-05 14:18:36,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:36,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 11 treesize of output 7 [2021-06-05 14:18:36,679 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:36,714 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:36,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:36,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:36,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 12 treesize of output 8 [2021-06-05 14:18:36,720 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:36,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:36,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 12 treesize of output 8 [2021-06-05 14:18:36,728 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:36,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:36,764 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:18:36,764 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:243, output treesize:48 [2021-06-05 14:18:36,826 INFO L134 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:18:36,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518784863] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:36,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:36,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:18:36,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205352051] [2021-06-05 14:18:36,827 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:18:36,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:36,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:18:36,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:18:36,828 INFO L87 Difference]: Start difference. First operand 302 states and 931 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:37,417 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2021-06-05 14:18:37,644 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 85 [2021-06-05 14:18:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:37,769 INFO L93 Difference]: Finished difference Result 354 states and 1074 transitions. [2021-06-05 14:18:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:18:37,769 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:18:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:37,769 INFO L225 Difference]: With dead ends: 354 [2021-06-05 14:18:37,769 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 14:18:37,770 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1614.7ms TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:18:37,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 14:18:37,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 304. [2021-06-05 14:18:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 3.092409240924092) internal successors, (937), 303 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 937 transitions. [2021-06-05 14:18:37,774 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 937 transitions. Word has length 17 [2021-06-05 14:18:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:37,774 INFO L482 AbstractCegarLoop]: Abstraction has 304 states and 937 transitions. [2021-06-05 14:18:37,774 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 937 transitions. [2021-06-05 14:18:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:37,775 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:37,775 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:18:37,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1217,192 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:18:37,985 INFO L430 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:37,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:37,985 INFO L82 PathProgramCache]: Analyzing trace with hash -483176788, now seen corresponding path program 46 times [2021-06-05 14:18:37,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:37,985 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221863375] [2021-06-05 14:18:37,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:38,298 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2021-06-05 14:18:38,669 INFO L134 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:18:38,669 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:38,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221863375] [2021-06-05 14:18:38,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221863375] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:38,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491289754] [2021-06-05 14:18:38,670 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:18:38,706 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:18:38,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:38,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:18:38,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:38,922 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:38,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:38,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 15 treesize of output 11 [2021-06-05 14:18:38,924 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:38,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:38,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 25 treesize of output 19 [2021-06-05 14:18:38,929 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:38,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:38,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:38,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:38,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 25 treesize of output 19 [2021-06-05 14:18:38,978 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:38,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:38,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 27 treesize of output 21 [2021-06-05 14:18:38,983 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:39,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:39,026 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:18:39,026 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:109 [2021-06-05 14:18:39,161 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_281, array_2, v_prenex_283, v_prenex_285], 1=[v_prenex_280, array_0, v_prenex_282, v_prenex_284]} [2021-06-05 14:18:39,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 25 treesize of output 19 [2021-06-05 14:18:39,167 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:39,256 INFO L628 ElimStorePlain]: treesize reduction 119, result has 47.8 percent of original size [2021-06-05 14:18:39,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:18:39,261 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:39,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:39,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:18:39,294 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:39,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:39,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 14:18:39,324 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:39,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:39,348 INFO L518 ElimStorePlain]: Eliminatee v_prenex_280 vanished before elimination [2021-06-05 14:18:39,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:39,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 12 treesize of output 8 [2021-06-05 14:18:39,354 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:39,378 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:39,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:39,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 14:18:39,383 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:39,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:39,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:39,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:18:39,410 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:39,432 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:39,435 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:39,435 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 14:18:39,485 INFO L134 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:18:39,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491289754] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:39,485 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:39,486 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:18:39,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671308880] [2021-06-05 14:18:39,486 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:18:39,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:39,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:18:39,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:18:39,486 INFO L87 Difference]: Start difference. First operand 304 states and 937 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:40,217 INFO L93 Difference]: Finished difference Result 368 states and 1120 transitions. [2021-06-05 14:18:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:18:40,217 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:18:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:40,218 INFO L225 Difference]: With dead ends: 368 [2021-06-05 14:18:40,218 INFO L226 Difference]: Without dead ends: 357 [2021-06-05 14:18:40,218 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1124.3ms TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:18:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-06-05 14:18:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 303. [2021-06-05 14:18:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.096026490066225) internal successors, (935), 302 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 935 transitions. [2021-06-05 14:18:40,223 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 935 transitions. Word has length 17 [2021-06-05 14:18:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:40,223 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 935 transitions. [2021-06-05 14:18:40,223 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 935 transitions. [2021-06-05 14:18:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:40,223 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:40,223 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:18:40,424 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 193 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1242 [2021-06-05 14:18:40,424 INFO L430 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:40,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:40,424 INFO L82 PathProgramCache]: Analyzing trace with hash 538722348, now seen corresponding path program 47 times [2021-06-05 14:18:40,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:40,424 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988333187] [2021-06-05 14:18:40,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:40,782 INFO L134 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:18:40,782 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:40,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988333187] [2021-06-05 14:18:40,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988333187] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:40,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217884283] [2021-06-05 14:18:40,782 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:18:40,809 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:18:40,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:40,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:18:40,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:40,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 27 treesize of output 21 [2021-06-05 14:18:40,895 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:40,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 25 treesize of output 19 [2021-06-05 14:18:40,898 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:40,926 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:40,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 25 treesize of output 19 [2021-06-05 14:18:40,929 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:40,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:18:40,932 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:40,956 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:40,957 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:40,957 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:96 [2021-06-05 14:18:41,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 14:18:41,438 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:41,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,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 17 treesize of output 13 [2021-06-05 14:18:41,444 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:41,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,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 25 treesize of output 19 [2021-06-05 14:18:41,449 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:41,527 INFO L628 ElimStorePlain]: treesize reduction 131, result has 43.0 percent of original size [2021-06-05 14:18:41,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,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 10 treesize of output 6 [2021-06-05 14:18:41,532 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:41,561 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:41,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,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 27 treesize of output 21 [2021-06-05 14:18:41,566 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:41,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,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 27 treesize of output 21 [2021-06-05 14:18:41,571 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:41,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:41,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,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 14 [2021-06-05 14:18:41,600 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:41,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:41,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 11 treesize of output 7 [2021-06-05 14:18:41,605 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:41,637 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:41,639 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:41,639 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:257, output treesize:38 [2021-06-05 14:18:41,685 INFO L134 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:18:41,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217884283] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:41,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:41,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:18:41,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396233439] [2021-06-05 14:18:41,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:18:41,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:18:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:18:41,686 INFO L87 Difference]: Start difference. First operand 303 states and 935 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:18:42,303 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2021-06-05 14:18:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:42,393 INFO L93 Difference]: Finished difference Result 354 states and 1076 transitions. [2021-06-05 14:18:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:18:42,393 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:18:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:42,394 INFO L225 Difference]: With dead ends: 354 [2021-06-05 14:18:42,394 INFO L226 Difference]: Without dead ends: 344 [2021-06-05 14:18:42,394 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 853.3ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:18:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-06-05 14:18:42,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 305. [2021-06-05 14:18:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 3.0953947368421053) internal successors, (941), 304 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:18:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 941 transitions. [2021-06-05 14:18:42,398 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 941 transitions. Word has length 17 [2021-06-05 14:18:42,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:42,398 INFO L482 AbstractCegarLoop]: Abstraction has 305 states and 941 transitions. [2021-06-05 14:18:42,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:18:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 941 transitions. [2021-06-05 14:18:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:42,399 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:42,399 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:18:42,599 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 194 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1267 [2021-06-05 14:18:42,600 INFO L430 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:42,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:42,600 INFO L82 PathProgramCache]: Analyzing trace with hash 881305860, now seen corresponding path program 48 times [2021-06-05 14:18:42,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:42,600 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219363739] [2021-06-05 14:18:42,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:42,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:18:42,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:42,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219363739] [2021-06-05 14:18:42,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219363739] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:42,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529939463] [2021-06-05 14:18:42,867 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 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:18:42,897 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 14:18:42,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:42,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:18:42,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:43,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,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 25 treesize of output 19 [2021-06-05 14:18:43,008 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:43,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,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 35 treesize of output 27 [2021-06-05 14:18:43,015 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:43,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,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 25 treesize of output 19 [2021-06-05 14:18:43,020 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:43,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,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:18:43,040 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:43,103 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:43,105 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:43,105 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:159 [2021-06-05 14:18:43,229 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_291, v_prenex_293, array_2, v_prenex_295], 1=[v_prenex_290, array_0, v_prenex_292, v_prenex_294]} [2021-06-05 14:18:43,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:18:43,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:43,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:18:43,240 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:43,398 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2021-06-05 14:18:43,398 INFO L628 ElimStorePlain]: treesize reduction 155, result has 55.6 percent of original size [2021-06-05 14:18:43,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 39 treesize of output 31 [2021-06-05 14:18:43,407 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:43,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 19 treesize of output 15 [2021-06-05 14:18:43,411 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:43,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:43,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:18:43,472 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:43,536 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:43,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 7 treesize of output 5 [2021-06-05 14:18:43,542 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:43,602 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:43,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:18:43,608 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:43,668 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:43,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,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 10 treesize of output 6 [2021-06-05 14:18:43,673 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:43,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:43,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,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 24 treesize of output 16 [2021-06-05 14:18:43,742 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:43,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:43,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 12 treesize of output 8 [2021-06-05 14:18:43,747 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:43,803 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:43,803 INFO L518 ElimStorePlain]: Eliminatee v_prenex_294 vanished before elimination [2021-06-05 14:18:43,805 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:18:43,805 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:367, output treesize:124 [2021-06-05 14:18:43,994 INFO L134 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:18:43,994 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529939463] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:43,994 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:43,994 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:18:43,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064891688] [2021-06-05 14:18:43,994 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:18:43,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:43,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:18:43,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:18:43,995 INFO L87 Difference]: Start difference. First operand 305 states and 941 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:44,413 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2021-06-05 14:18:44,573 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2021-06-05 14:18:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:44,643 INFO L93 Difference]: Finished difference Result 352 states and 1070 transitions. [2021-06-05 14:18:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:18:44,643 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:18:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:44,643 INFO L225 Difference]: With dead ends: 352 [2021-06-05 14:18:44,643 INFO L226 Difference]: Without dead ends: 341 [2021-06-05 14:18:44,644 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 908.6ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:18:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-06-05 14:18:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 303. [2021-06-05 14:18:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 302 states have (on average 3.096026490066225) internal successors, (935), 302 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 935 transitions. [2021-06-05 14:18:44,647 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 935 transitions. Word has length 17 [2021-06-05 14:18:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:44,647 INFO L482 AbstractCegarLoop]: Abstraction has 303 states and 935 transitions. [2021-06-05 14:18:44,647 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 935 transitions. [2021-06-05 14:18:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:44,647 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:44,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:18:44,848 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 195 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1280 [2021-06-05 14:18:44,848 INFO L430 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:44,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:44,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1017508532, now seen corresponding path program 49 times [2021-06-05 14:18:44,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:44,849 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986604292] [2021-06-05 14:18:44,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:45,277 INFO L134 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:18:45,277 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:45,277 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986604292] [2021-06-05 14:18:45,277 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986604292] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:45,277 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172802155] [2021-06-05 14:18:45,277 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 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:18:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:45,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:18:45,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:45,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:45,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:45,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 25 treesize of output 19 [2021-06-05 14:18:45,488 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:45,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:45,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:45,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:45,493 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:45,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:45,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:45,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:18:45,498 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:45,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:45,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 35 treesize of output 27 [2021-06-05 14:18:45,502 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:45,556 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:45,559 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:18:45,560 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:193, output treesize:155 [2021-06-05 14:18:45,721 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-06-05 14:18:46,460 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_307, v_prenex_309, array_2, v_prenex_311, v_prenex_313, v_prenex_315], 1=[v_prenex_316, v_prenex_308, array_4, v_prenex_310, v_prenex_312, v_prenex_314]} [2021-06-05 14:18:46,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 14:18:46,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:46,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 14:18:46,479 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:46,715 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 90 [2021-06-05 14:18:46,715 INFO L628 ElimStorePlain]: treesize reduction 196, result has 50.5 percent of original size [2021-06-05 14:18:46,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 7 treesize of output 5 [2021-06-05 14:18:46,721 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:46,791 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:46,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:18:46,797 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:46,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:46,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 27 treesize of output 21 [2021-06-05 14:18:46,867 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:46,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:46,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:18:46,936 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:46,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:47,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 7 treesize of output 5 [2021-06-05 14:18:47,003 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:47,061 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:47,061 INFO L518 ElimStorePlain]: Eliminatee v_prenex_316 vanished before elimination [2021-06-05 14:18:47,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:47,066 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:47,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 11 treesize of output 7 [2021-06-05 14:18:47,068 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:47,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:47,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:18:47,074 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:47,135 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:47,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:47,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 11 treesize of output 7 [2021-06-05 14:18:47,141 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:47,197 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:47,198 INFO L518 ElimStorePlain]: Eliminatee v_prenex_310 vanished before elimination [2021-06-05 14:18:47,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:47,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 11 treesize of output 7 [2021-06-05 14:18:47,204 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:47,259 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:47,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:47,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 13 treesize of output 9 [2021-06-05 14:18:47,265 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:47,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:47,323 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 14:18:47,323 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 18 variables, input treesize:423, output treesize:79 [2021-06-05 14:18:47,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:18:47,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172802155] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:47,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:47,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:18:47,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951224544] [2021-06-05 14:18:47,394 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:18:47,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:47,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:18:47,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:18:47,394 INFO L87 Difference]: Start difference. First operand 303 states and 935 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:47,667 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2021-06-05 14:18:48,058 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2021-06-05 14:18:48,569 WARN L205 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 99 [2021-06-05 14:18:49,485 WARN L205 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 148 [2021-06-05 14:18:50,082 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 113 [2021-06-05 14:18:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:50,170 INFO L93 Difference]: Finished difference Result 483 states and 1414 transitions. [2021-06-05 14:18:50,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:18:50,171 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:18:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:50,172 INFO L225 Difference]: With dead ends: 483 [2021-06-05 14:18:50,172 INFO L226 Difference]: Without dead ends: 427 [2021-06-05 14:18:50,172 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3186.7ms TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:18:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-06-05 14:18:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 327. [2021-06-05 14:18:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 3.1165644171779143) internal successors, (1016), 326 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 1016 transitions. [2021-06-05 14:18:50,177 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 1016 transitions. Word has length 17 [2021-06-05 14:18:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:50,177 INFO L482 AbstractCegarLoop]: Abstraction has 327 states and 1016 transitions. [2021-06-05 14:18:50,177 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 1016 transitions. [2021-06-05 14:18:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:50,177 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:50,177 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:18:50,396 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 196 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1300 [2021-06-05 14:18:50,397 INFO L430 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1698860488, now seen corresponding path program 50 times [2021-06-05 14:18:50,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:50,397 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568951773] [2021-06-05 14:18:50,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:50,638 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2021-06-05 14:18:50,973 INFO L134 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:18:50,973 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:50,974 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568951773] [2021-06-05 14:18:50,974 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568951773] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:50,974 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358124767] [2021-06-05 14:18:50,974 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 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:18:51,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:18:51,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:51,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:18:51,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:51,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:51,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:51,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 25 treesize of output 19 [2021-06-05 14:18:51,126 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:51,129 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:51,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 27 treesize of output 21 [2021-06-05 14:18:51,130 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:51,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:51,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:51,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:51,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:18:51,164 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:51,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:51,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 25 treesize of output 19 [2021-06-05 14:18:51,168 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:51,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:51,196 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:18:51,196 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:101 [2021-06-05 14:18:51,475 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_321, v_prenex_323, v_prenex_325], 1=[array_4, v_prenex_322, v_prenex_324, v_prenex_326]} [2021-06-05 14:18:51,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:51,480 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:51,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:18:51,485 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:51,574 INFO L628 ElimStorePlain]: treesize reduction 115, result has 46.0 percent of original size [2021-06-05 14:18:51,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 23 [2021-06-05 14:18:51,579 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:51,604 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:51,604 INFO L518 ElimStorePlain]: Eliminatee v_prenex_323 vanished before elimination [2021-06-05 14:18:51,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 19 treesize of output 15 [2021-06-05 14:18:51,608 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:51,633 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:51,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:51,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 11 treesize of output 7 [2021-06-05 14:18:51,638 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:51,660 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:51,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:51,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 11 treesize of output 7 [2021-06-05 14:18:51,664 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:51,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:51,684 INFO L518 ElimStorePlain]: Eliminatee v_prenex_324 vanished before elimination [2021-06-05 14:18:51,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:51,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 10 treesize of output 6 [2021-06-05 14:18:51,689 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:51,708 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:51,710 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:51,710 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 14:18:51,750 INFO L134 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:18:51,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358124767] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:51,751 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:51,751 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:18:51,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299642596] [2021-06-05 14:18:51,751 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:18:51,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:51,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:18:51,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:18:51,751 INFO L87 Difference]: Start difference. First operand 327 states and 1016 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:52,056 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2021-06-05 14:18:52,369 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 102 [2021-06-05 14:18:52,913 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 117 [2021-06-05 14:18:53,442 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 115 [2021-06-05 14:18:53,720 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 116 [2021-06-05 14:18:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:54,041 INFO L93 Difference]: Finished difference Result 544 states and 1579 transitions. [2021-06-05 14:18:54,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:18:54,041 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:18:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:54,042 INFO L225 Difference]: With dead ends: 544 [2021-06-05 14:18:54,042 INFO L226 Difference]: Without dead ends: 512 [2021-06-05 14:18:54,042 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2435.3ms TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:18:54,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-06-05 14:18:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 336. [2021-06-05 14:18:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 3.1671641791044776) internal successors, (1061), 335 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 1061 transitions. [2021-06-05 14:18:54,046 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 1061 transitions. Word has length 17 [2021-06-05 14:18:54,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:54,046 INFO L482 AbstractCegarLoop]: Abstraction has 336 states and 1061 transitions. [2021-06-05 14:18:54,046 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:54,046 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 1061 transitions. [2021-06-05 14:18:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:54,047 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:54,047 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:18:54,247 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 197 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1333 [2021-06-05 14:18:54,247 INFO L430 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:54,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:54,248 INFO L82 PathProgramCache]: Analyzing trace with hash -56410218, now seen corresponding path program 51 times [2021-06-05 14:18:54,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:54,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998236162] [2021-06-05 14:18:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:54,573 INFO L134 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:18:54,573 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:54,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998236162] [2021-06-05 14:18:54,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998236162] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:54,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414984694] [2021-06-05 14:18:54,573 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 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:18:54,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:18:54,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:54,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:18:54,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:54,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:54,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:54,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:54,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:54,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:54,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 27 treesize of output 21 [2021-06-05 14:18:54,775 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:54,809 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:54,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:54,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:54,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:18:54,813 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:54,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:54,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 25 treesize of output 19 [2021-06-05 14:18:54,817 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:54,847 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:54,850 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:18:54,850 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:109 [2021-06-05 14:18:55,010 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_331, v_prenex_333, v_prenex_335], 1=[array_4, v_prenex_332, v_prenex_334, v_prenex_336]} [2021-06-05 14:18:55,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 25 treesize of output 19 [2021-06-05 14:18:55,015 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:55,090 INFO L628 ElimStorePlain]: treesize reduction 115, result has 48.7 percent of original size [2021-06-05 14:18:55,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 14:18:55,094 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:55,118 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:55,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 27 treesize of output 21 [2021-06-05 14:18:55,122 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:55,144 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:55,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 19 treesize of output 15 [2021-06-05 14:18:55,147 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:55,169 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:55,169 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:18:55,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:55,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 11 treesize of output 7 [2021-06-05 14:18:55,173 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:55,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:55,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:55,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:18:55,197 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:55,216 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:55,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:55,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 14:18:55,220 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:55,239 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:55,241 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:55,241 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 14:18:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:18:55,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414984694] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:55,278 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:55,278 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:18:55,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062080818] [2021-06-05 14:18:55,278 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:18:55,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:55,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:18:55,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:18:55,279 INFO L87 Difference]: Start difference. First operand 336 states and 1061 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:55,738 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2021-06-05 14:18:55,922 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2021-06-05 14:18:56,165 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 87 [2021-06-05 14:18:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:56,414 INFO L93 Difference]: Finished difference Result 447 states and 1358 transitions. [2021-06-05 14:18:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:18:56,415 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:18:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:56,415 INFO L225 Difference]: With dead ends: 447 [2021-06-05 14:18:56,415 INFO L226 Difference]: Without dead ends: 435 [2021-06-05 14:18:56,415 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1146.4ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:18:56,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-06-05 14:18:56,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 340. [2021-06-05 14:18:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 3.1799410029498527) internal successors, (1078), 339 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1078 transitions. [2021-06-05 14:18:56,419 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 1078 transitions. Word has length 17 [2021-06-05 14:18:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:56,419 INFO L482 AbstractCegarLoop]: Abstraction has 340 states and 1078 transitions. [2021-06-05 14:18:56,419 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:18:56,420 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 1078 transitions. [2021-06-05 14:18:56,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:56,420 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:56,420 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:18:56,620 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 198 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1358 [2021-06-05 14:18:56,621 INFO L430 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash -129782698, now seen corresponding path program 52 times [2021-06-05 14:18:56,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:56,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715291508] [2021-06-05 14:18:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:18:56,878 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:56,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715291508] [2021-06-05 14:18:56,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715291508] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:56,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001762914] [2021-06-05 14:18:56,878 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 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:18:56,909 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:18:56,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:56,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:18:56,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:57,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:57,081 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,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 35 treesize of output 27 [2021-06-05 14:18:57,086 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:57,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,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:18:57,137 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,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 25 treesize of output 19 [2021-06-05 14:18:57,141 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,183 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:57,187 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:18:57,187 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:187, output treesize:153 [2021-06-05 14:18:57,316 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 14:18:57,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,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 27 treesize of output 21 [2021-06-05 14:18:57,321 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:18:57,326 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:18:57,331 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 14:18:57,336 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,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 35 treesize of output 27 [2021-06-05 14:18:57,341 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:57,346 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 14:18:57,352 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:18:57,357 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,493 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2021-06-05 14:18:57,493 INFO L628 ElimStorePlain]: treesize reduction 141, result has 56.9 percent of original size [2021-06-05 14:18:57,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,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 25 treesize of output 17 [2021-06-05 14:18:57,498 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,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 11 treesize of output 7 [2021-06-05 14:18:57,504 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:57,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,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 22 treesize of output 14 [2021-06-05 14:18:57,509 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:57,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 21 treesize of output 13 [2021-06-05 14:18:57,513 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:57,565 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:57,567 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:18:57,567 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:393, output treesize:101 [2021-06-05 14:18:57,686 INFO L134 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:18:57,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001762914] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:57,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:57,686 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:18:57,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604111541] [2021-06-05 14:18:57,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:18:57,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:57,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:18:57,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:18:57,687 INFO L87 Difference]: Start difference. First operand 340 states and 1078 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:58,262 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2021-06-05 14:18:58,434 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2021-06-05 14:18:58,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:18:58,609 INFO L93 Difference]: Finished difference Result 446 states and 1363 transitions. [2021-06-05 14:18:58,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 14:18:58,609 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:18:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:18:58,610 INFO L225 Difference]: With dead ends: 446 [2021-06-05 14:18:58,610 INFO L226 Difference]: Without dead ends: 433 [2021-06-05 14:18:58,610 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1024.9ms TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:18:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2021-06-05 14:18:58,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 341. [2021-06-05 14:18:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.1852941176470586) internal successors, (1083), 340 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:18:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1083 transitions. [2021-06-05 14:18:58,614 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 1083 transitions. Word has length 17 [2021-06-05 14:18:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:18:58,614 INFO L482 AbstractCegarLoop]: Abstraction has 341 states and 1083 transitions. [2021-06-05 14:18:58,614 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:18:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 1083 transitions. [2021-06-05 14:18:58,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:18:58,614 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:18:58,614 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:18:58,815 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1383,199 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:18:58,815 INFO L430 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:18:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:18:58,815 INFO L82 PathProgramCache]: Analyzing trace with hash -28866952, now seen corresponding path program 53 times [2021-06-05 14:18:58,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:18:58,815 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168021004] [2021-06-05 14:18:58,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:18:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:18:59,189 INFO L134 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:18:59,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:18:59,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168021004] [2021-06-05 14:18:59,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168021004] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:59,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474193060] [2021-06-05 14:18:59,190 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 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:18:59,216 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:18:59,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:18:59,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 14:18:59,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:18:59,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:59,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:59,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 25 treesize of output 19 [2021-06-05 14:18:59,403 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:59,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:59,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:18:59,407 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:59,441 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:59,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:59,444 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:59,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:18:59,445 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:59,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:59,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 25 treesize of output 19 [2021-06-05 14:18:59,448 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:59,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:59,480 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:18:59,480 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 14:18:59,637 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_350, v_prenex_346, v_prenex_348], 1=[v_prenex_349, v_prenex_351, array_4, v_prenex_347]} [2021-06-05 14:18:59,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 17 treesize of output 13 [2021-06-05 14:18:59,642 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:59,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 19 treesize of output 15 [2021-06-05 14:18:59,646 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:59,712 INFO L628 ElimStorePlain]: treesize reduction 113, result has 45.7 percent of original size [2021-06-05 14:18:59,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 27 treesize of output 21 [2021-06-05 14:18:59,716 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:59,737 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:59,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 19 treesize of output 15 [2021-06-05 14:18:59,741 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:18:59,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:59,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_348 vanished before elimination [2021-06-05 14:18:59,761 INFO L518 ElimStorePlain]: Eliminatee v_prenex_349 vanished before elimination [2021-06-05 14:18:59,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:59,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 11 treesize of output 7 [2021-06-05 14:18:59,766 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:59,785 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:59,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:59,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:18:59,793 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:59,812 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:59,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:18:59,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 11 treesize of output 7 [2021-06-05 14:18:59,816 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:18:59,834 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:18:59,836 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:18:59,836 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:223, output treesize:38 [2021-06-05 14:18:59,872 INFO L134 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:18:59,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474193060] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:18:59,873 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:18:59,873 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:18:59,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230624235] [2021-06-05 14:18:59,873 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:18:59,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:18:59,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:18:59,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:18:59,873 INFO L87 Difference]: Start difference. First operand 341 states and 1083 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:00,299 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2021-06-05 14:19:00,477 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2021-06-05 14:19:00,711 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 63 [2021-06-05 14:19:00,917 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2021-06-05 14:19:01,283 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2021-06-05 14:19:01,492 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2021-06-05 14:19:01,884 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 109 [2021-06-05 14:19:02,057 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-06-05 14:19:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:02,369 INFO L93 Difference]: Finished difference Result 671 states and 2008 transitions. [2021-06-05 14:19:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:19:02,370 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:19:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:02,371 INFO L225 Difference]: With dead ends: 671 [2021-06-05 14:19:02,371 INFO L226 Difference]: Without dead ends: 655 [2021-06-05 14:19:02,371 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2453.8ms TimeCoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:19:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2021-06-05 14:19:02,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 355. [2021-06-05 14:19:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 3.189265536723164) internal successors, (1129), 354 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1129 transitions. [2021-06-05 14:19:02,376 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 1129 transitions. Word has length 17 [2021-06-05 14:19:02,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:02,376 INFO L482 AbstractCegarLoop]: Abstraction has 355 states and 1129 transitions. [2021-06-05 14:19:02,376 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 1129 transitions. [2021-06-05 14:19:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:02,376 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:02,376 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:19:02,576 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 200 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1407 [2021-06-05 14:19:02,577 INFO L430 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash -102239432, now seen corresponding path program 54 times [2021-06-05 14:19:02,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:02,577 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138980132] [2021-06-05 14:19:02,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:02,867 INFO L134 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:19:02,867 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:02,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138980132] [2021-06-05 14:19:02,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138980132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:02,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54018194] [2021-06-05 14:19:02,868 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 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:19:02,897 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:19:02,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:02,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:19:02,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:03,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:03,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:03,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 25 treesize of output 19 [2021-06-05 14:19:03,188 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:03,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:03,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 27 treesize of output 21 [2021-06-05 14:19:03,193 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:03,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:03,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:03,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:03,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:03,266 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:03,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:03,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 15 treesize of output 11 [2021-06-05 14:19:03,271 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:03,333 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:03,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:03,338 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:03,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 15 treesize of output 11 [2021-06-05 14:19:03,339 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:03,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:03,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 25 treesize of output 19 [2021-06-05 14:19:03,343 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:03,401 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:03,405 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 14:19:03,406 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:229, output treesize:175 [2021-06-05 14:19:03,701 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_360, array_2, v_prenex_362, v_prenex_364, v_prenex_366, v_prenex_368], 1=[array_0, v_prenex_361, v_prenex_363, v_prenex_365, v_prenex_367, v_prenex_359]} [2021-06-05 14:19:03,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 15 treesize of output 11 [2021-06-05 14:19:03,707 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:03,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 25 treesize of output 19 [2021-06-05 14:19:03,713 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:03,873 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 86 [2021-06-05 14:19:03,873 INFO L628 ElimStorePlain]: treesize reduction 188, result has 51.7 percent of original size [2021-06-05 14:19:03,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 27 treesize of output 21 [2021-06-05 14:19:03,878 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:03,935 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:03,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 19 treesize of output 15 [2021-06-05 14:19:03,940 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:03,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:04,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:19:04,001 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:04,053 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:04,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 21 treesize of output 17 [2021-06-05 14:19:04,058 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:04,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:19:04,063 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:04,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:04,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 19 treesize of output 15 [2021-06-05 14:19:04,116 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:04,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:04,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:04,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 14:19:04,167 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:04,213 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:04,216 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:04,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 12 treesize of output 8 [2021-06-05 14:19:04,218 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:04,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:04,263 INFO L518 ElimStorePlain]: Eliminatee v_prenex_363 vanished before elimination [2021-06-05 14:19:04,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:04,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:04,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 14 treesize of output 10 [2021-06-05 14:19:04,269 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:04,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:04,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:19:04,274 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:04,318 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:04,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:04,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 13 treesize of output 9 [2021-06-05 14:19:04,323 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:04,366 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:04,367 INFO L518 ElimStorePlain]: Eliminatee v_prenex_359 vanished before elimination [2021-06-05 14:19:04,369 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 14:19:04,369 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:403, output treesize:77 [2021-06-05 14:19:04,435 INFO L134 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:19:04,436 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54018194] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:04,436 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:04,436 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:19:04,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043937349] [2021-06-05 14:19:04,436 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:19:04,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:04,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:19:04,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:19:04,436 INFO L87 Difference]: Start difference. First operand 355 states and 1129 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:05,127 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2021-06-05 14:19:05,280 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2021-06-05 14:19:05,440 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2021-06-05 14:19:05,848 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 82 [2021-06-05 14:19:06,087 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 88 [2021-06-05 14:19:06,237 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2021-06-05 14:19:06,688 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 137 [2021-06-05 14:19:06,895 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2021-06-05 14:19:07,037 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-06-05 14:19:07,319 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2021-06-05 14:19:07,517 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2021-06-05 14:19:07,645 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-06-05 14:19:07,927 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2021-06-05 14:19:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:07,997 INFO L93 Difference]: Finished difference Result 630 states and 1888 transitions. [2021-06-05 14:19:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 14:19:07,997 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:19:07,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:07,998 INFO L225 Difference]: With dead ends: 630 [2021-06-05 14:19:07,998 INFO L226 Difference]: Without dead ends: 613 [2021-06-05 14:19:07,998 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3507.9ms TimeCoverageRelationStatistics Valid=240, Invalid=1092, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 14:19:07,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-06-05 14:19:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 366. [2021-06-05 14:19:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.2) internal successors, (1168), 365 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1168 transitions. [2021-06-05 14:19:08,003 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1168 transitions. Word has length 17 [2021-06-05 14:19:08,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:08,003 INFO L482 AbstractCegarLoop]: Abstraction has 366 states and 1168 transitions. [2021-06-05 14:19:08,003 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1168 transitions. [2021-06-05 14:19:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:08,003 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:08,004 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:19:08,204 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 201 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1432 [2021-06-05 14:19:08,204 INFO L430 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:08,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:08,204 INFO L82 PathProgramCache]: Analyzing trace with hash -99613656, now seen corresponding path program 55 times [2021-06-05 14:19:08,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:08,204 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983149639] [2021-06-05 14:19:08,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:08,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:19:08,610 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:08,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983149639] [2021-06-05 14:19:08,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983149639] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:08,610 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158776290] [2021-06-05 14:19:08,610 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:19:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:08,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:08,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:08,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:08,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:08,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:19:08,793 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:08,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:08,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:08,797 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:08,826 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:08,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:08,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:08,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 25 treesize of output 19 [2021-06-05 14:19:08,830 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:08,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:08,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 15 treesize of output 11 [2021-06-05 14:19:08,834 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:08,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:08,862 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:19:08,862 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:105 [2021-06-05 14:19:09,022 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_375, v_prenex_377, v_prenex_379], 1=[array_0, v_prenex_374, v_prenex_376, v_prenex_378]} [2021-06-05 14:19:09,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 27 treesize of output 21 [2021-06-05 14:19:09,027 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:09,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:09,031 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:09,094 INFO L628 ElimStorePlain]: treesize reduction 119, result has 47.6 percent of original size [2021-06-05 14:19:09,094 INFO L518 ElimStorePlain]: Eliminatee v_prenex_375 vanished before elimination [2021-06-05 14:19:09,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 23 [2021-06-05 14:19:09,098 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:09,119 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:09,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:09,123 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:09,142 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:09,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:09,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 22 treesize of output 14 [2021-06-05 14:19:09,145 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:09,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:09,164 INFO L518 ElimStorePlain]: Eliminatee v_prenex_374 vanished before elimination [2021-06-05 14:19:09,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:09,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 11 treesize of output 7 [2021-06-05 14:19:09,168 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:09,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:09,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:09,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 10 treesize of output 6 [2021-06-05 14:19:09,190 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:09,207 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:09,209 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:09,209 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:243, output treesize:38 [2021-06-05 14:19:09,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:19:09,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158776290] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:09,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:09,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:19:09,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460469123] [2021-06-05 14:19:09,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:19:09,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:09,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:19:09,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:19:09,252 INFO L87 Difference]: Start difference. First operand 366 states and 1168 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:09,770 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2021-06-05 14:19:10,136 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2021-06-05 14:19:10,439 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 112 [2021-06-05 14:19:10,672 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 102 [2021-06-05 14:19:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:10,744 INFO L93 Difference]: Finished difference Result 600 states and 1826 transitions. [2021-06-05 14:19:10,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:19:10,744 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:19:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:10,745 INFO L225 Difference]: With dead ends: 600 [2021-06-05 14:19:10,745 INFO L226 Difference]: Without dead ends: 582 [2021-06-05 14:19:10,745 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1580.6ms TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:19:10,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-06-05 14:19:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 375. [2021-06-05 14:19:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 3.2085561497326203) internal successors, (1200), 374 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1200 transitions. [2021-06-05 14:19:10,750 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 1200 transitions. Word has length 17 [2021-06-05 14:19:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:10,750 INFO L482 AbstractCegarLoop]: Abstraction has 375 states and 1200 transitions. [2021-06-05 14:19:10,750 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 1200 transitions. [2021-06-05 14:19:10,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:10,750 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:10,750 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:19:10,950 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 202 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1503 [2021-06-05 14:19:10,951 INFO L430 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:10,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:10,951 INFO L82 PathProgramCache]: Analyzing trace with hash 61528026, now seen corresponding path program 56 times [2021-06-05 14:19:10,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:10,951 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283068722] [2021-06-05 14:19:10,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:11,289 INFO L134 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:19:11,289 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:11,289 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283068722] [2021-06-05 14:19:11,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283068722] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:11,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010444664] [2021-06-05 14:19:11,290 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 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:19:11,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:19:11,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:11,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:11,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:11,449 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_381], 3=[array_0]} [2021-06-05 14:19:11,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:11,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:11,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 27 treesize of output 21 [2021-06-05 14:19:11,454 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:11,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:11,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 25 treesize of output 19 [2021-06-05 14:19:11,458 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:11,490 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:11,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:11,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:11,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 25 treesize of output 19 [2021-06-05 14:19:11,495 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:11,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:11,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 15 treesize of output 11 [2021-06-05 14:19:11,498 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:11,527 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:11,530 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:19:11,530 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:149, output treesize:117 [2021-06-05 14:19:11,660 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_384, v_prenex_386, v_prenex_388], 1=[array_4, v_prenex_385, v_prenex_387, v_prenex_389]} [2021-06-05 14:19:11,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 21 treesize of output 17 [2021-06-05 14:19:11,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:11,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 19 treesize of output 15 [2021-06-05 14:19:11,669 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:11,755 INFO L628 ElimStorePlain]: treesize reduction 100, result has 59.7 percent of original size [2021-06-05 14:19:11,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 7 treesize of output 5 [2021-06-05 14:19:11,759 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:11,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:11,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:11,797 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:11,829 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:11,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:11,833 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:11,863 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:11,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:11,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:11,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 14:19:11,868 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:11,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:11,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 11 treesize of output 7 [2021-06-05 14:19:11,872 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:11,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:11,910 INFO L518 ElimStorePlain]: Eliminatee v_prenex_385 vanished before elimination [2021-06-05 14:19:11,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:11,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 21 treesize of output 13 [2021-06-05 14:19:11,915 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:11,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:11,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:11,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 22 treesize of output 14 [2021-06-05 14:19:11,948 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:11,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:11,979 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:19:11,979 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:261, output treesize:48 [2021-06-05 14:19:12,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:19:12,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010444664] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:12,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:12,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:19:12,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976030419] [2021-06-05 14:19:12,028 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:19:12,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:12,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:19:12,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:19:12,028 INFO L87 Difference]: Start difference. First operand 375 states and 1200 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:12,529 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-06-05 14:19:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:12,627 INFO L93 Difference]: Finished difference Result 435 states and 1364 transitions. [2021-06-05 14:19:12,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:19:12,627 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:19:12,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:12,628 INFO L225 Difference]: With dead ends: 435 [2021-06-05 14:19:12,628 INFO L226 Difference]: Without dead ends: 425 [2021-06-05 14:19:12,628 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 784.1ms TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:19:12,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-06-05 14:19:12,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 378. [2021-06-05 14:19:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2095490716180373) internal successors, (1210), 377 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1210 transitions. [2021-06-05 14:19:12,632 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1210 transitions. Word has length 17 [2021-06-05 14:19:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:12,632 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1210 transitions. [2021-06-05 14:19:12,632 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1210 transitions. [2021-06-05 14:19:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:12,633 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:12,633 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:19:12,833 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1528,203 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:19:12,833 INFO L430 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:12,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1542765896, now seen corresponding path program 57 times [2021-06-05 14:19:12,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:12,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903878359] [2021-06-05 14:19:12,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:13,004 INFO L134 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:19:13,005 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:13,005 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903878359] [2021-06-05 14:19:13,005 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903878359] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:13,005 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350886461] [2021-06-05 14:19:13,005 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 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:19:13,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:19:13,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:13,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:13,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:13,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 15 treesize of output 11 [2021-06-05 14:19:13,114 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:13,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 25 treesize of output 19 [2021-06-05 14:19:13,117 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:13,149 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:13,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 27 treesize of output 21 [2021-06-05 14:19:13,153 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:13,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 25 treesize of output 19 [2021-06-05 14:19:13,155 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:13,178 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:13,179 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:13,179 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:94 [2021-06-05 14:19:13,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:13,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:13,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:13,330 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:13,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:13,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:19:13,335 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:13,396 INFO L628 ElimStorePlain]: treesize reduction 116, result has 46.5 percent of original size [2021-06-05 14:19:13,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:13,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:19:13,400 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:13,426 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:13,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:13,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:19:13,431 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:13,452 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:13,452 INFO L518 ElimStorePlain]: Eliminatee v_prenex_394 vanished before elimination [2021-06-05 14:19:13,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:13,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:19:13,457 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:13,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:13,477 INFO L518 ElimStorePlain]: Eliminatee v_prenex_395 vanished before elimination [2021-06-05 14:19:13,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:13,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:19:13,480 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:13,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:13,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:13,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 10 treesize of output 6 [2021-06-05 14:19:13,502 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:13,520 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:13,522 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:13,522 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:229, output treesize:38 [2021-06-05 14:19:13,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:19:13,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350886461] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:13,560 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:13,560 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:19:13,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166018003] [2021-06-05 14:19:13,560 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:19:13,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:19:13,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:19:13,560 INFO L87 Difference]: Start difference. First operand 378 states and 1210 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:19:14,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:14,148 INFO L93 Difference]: Finished difference Result 433 states and 1360 transitions. [2021-06-05 14:19:14,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:19:14,148 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:19:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:14,149 INFO L225 Difference]: With dead ends: 433 [2021-06-05 14:19:14,149 INFO L226 Difference]: Without dead ends: 423 [2021-06-05 14:19:14,149 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 639.9ms TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:19:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-06-05 14:19:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 377. [2021-06-05 14:19:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 3.2074468085106385) internal successors, (1206), 376 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1206 transitions. [2021-06-05 14:19:14,153 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1206 transitions. Word has length 17 [2021-06-05 14:19:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:14,153 INFO L482 AbstractCegarLoop]: Abstraction has 377 states and 1206 transitions. [2021-06-05 14:19:14,153 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:19:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1206 transitions. [2021-06-05 14:19:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:14,153 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:14,153 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:19:14,353 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 204 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1557 [2021-06-05 14:19:14,354 INFO L430 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2091682306, now seen corresponding path program 58 times [2021-06-05 14:19:14,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:14,354 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098889912] [2021-06-05 14:19:14,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:19:14,870 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:14,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098889912] [2021-06-05 14:19:14,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098889912] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:14,870 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459615657] [2021-06-05 14:19:14,870 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 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:19:14,896 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:19:14,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:14,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:19:14,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:15,000 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:15,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:15,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 25 treesize of output 19 [2021-06-05 14:19:15,002 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:15,005 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:15,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 35 treesize of output 27 [2021-06-05 14:19:15,006 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:15,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:15,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:15,011 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,013 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:15,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:19:15,014 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,062 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:15,063 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:15,064 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:195, output treesize:157 [2021-06-05 14:19:15,441 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_416, v_prenex_408, array_2, v_prenex_410, v_prenex_412, v_prenex_414], 1=[v_prenex_415, v_prenex_417, v_prenex_409, array_4, v_prenex_411, v_prenex_413]} [2021-06-05 14:19:15,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:15,448 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:19:15,454 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,613 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2021-06-05 14:19:15,613 INFO L628 ElimStorePlain]: treesize reduction 186, result has 53.3 percent of original size [2021-06-05 14:19:15,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 29 treesize of output 23 [2021-06-05 14:19:15,621 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,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 31 treesize of output 25 [2021-06-05 14:19:15,626 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:15,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 7 treesize of output 5 [2021-06-05 14:19:15,682 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,730 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:15,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 7 treesize of output 5 [2021-06-05 14:19:15,735 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,782 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:15,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 19 treesize of output 15 [2021-06-05 14:19:15,787 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,833 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:15,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 27 treesize of output 21 [2021-06-05 14:19:15,838 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:15,881 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:15,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:15,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 10 treesize of output 6 [2021-06-05 14:19:15,887 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:15,930 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:15,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:15,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:19:15,935 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:15,985 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:15,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:15,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19: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 11 treesize of output 7 [2021-06-05 14:19:15,991 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:15,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:15,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 12 treesize of output 8 [2021-06-05 14:19:15,995 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:16,035 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:16,035 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:19:16,036 INFO L518 ElimStorePlain]: Eliminatee v_prenex_411 vanished before elimination [2021-06-05 14:19:16,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:16,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 11 treesize of output 7 [2021-06-05 14:19:16,040 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:16,079 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:16,081 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 14:19:16,081 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:411, output treesize:77 [2021-06-05 14:19:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:19:16,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459615657] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:16,140 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:16,140 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:19:16,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407396528] [2021-06-05 14:19:16,140 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:19:16,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:16,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:19:16,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:19:16,141 INFO L87 Difference]: Start difference. First operand 377 states and 1206 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:16,603 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2021-06-05 14:19:16,797 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2021-06-05 14:19:17,111 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 123 [2021-06-05 14:19:17,416 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 116 [2021-06-05 14:19:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:17,503 INFO L93 Difference]: Finished difference Result 436 states and 1366 transitions. [2021-06-05 14:19:17,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:19:17,504 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:19:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:17,504 INFO L225 Difference]: With dead ends: 436 [2021-06-05 14:19:17,504 INFO L226 Difference]: Without dead ends: 426 [2021-06-05 14:19:17,504 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1790.6ms TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:19:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-06-05 14:19:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 379. [2021-06-05 14:19:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2063492063492065) internal successors, (1212), 378 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1212 transitions. [2021-06-05 14:19:17,508 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1212 transitions. Word has length 17 [2021-06-05 14:19:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:17,508 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1212 transitions. [2021-06-05 14:19:17,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1212 transitions. [2021-06-05 14:19:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:17,509 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:17,509 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:19:17,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1598,205 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:19:17,709 INFO L430 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:17,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1276876152, now seen corresponding path program 59 times [2021-06-05 14:19:17,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:17,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861321364] [2021-06-05 14:19:17,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:17,945 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2021-06-05 14:19:18,245 INFO L134 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:19:18,246 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:18,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861321364] [2021-06-05 14:19:18,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861321364] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:18,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772658414] [2021-06-05 14:19:18,246 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 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:19:18,273 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:19:18,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:18,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:18,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:18,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:18,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:18,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:18,405 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:18,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:18,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 27 treesize of output 21 [2021-06-05 14:19:18,408 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:18,442 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:18,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:18,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:18,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:19:18,446 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:18,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:18,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:18,450 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:18,481 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:18,484 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:19:18,484 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 14:19:18,595 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_426, v_prenex_428, array_2, v_prenex_424], 1=[v_prenex_427, array_0, v_prenex_423, v_prenex_425]} [2021-06-05 14:19:18,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 25 treesize of output 19 [2021-06-05 14:19:18,600 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:18,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:18,605 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:18,665 INFO L628 ElimStorePlain]: treesize reduction 113, result has 44.6 percent of original size [2021-06-05 14:19:18,666 INFO L518 ElimStorePlain]: Eliminatee v_prenex_428 vanished before elimination [2021-06-05 14:19:18,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:19:18,669 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:18,690 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:18,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 19 treesize of output 15 [2021-06-05 14:19:18,693 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:18,714 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:18,714 INFO L518 ElimStorePlain]: Eliminatee v_prenex_427 vanished before elimination [2021-06-05 14:19:18,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:18,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:19:18,718 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:18,738 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:18,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:18,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 12 treesize of output 8 [2021-06-05 14:19:18,742 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:18,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:18,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:18,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 10 treesize of output 6 [2021-06-05 14:19:18,765 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:18,784 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:18,785 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:18,786 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:223, output treesize:38 [2021-06-05 14:19:18,824 INFO L134 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:19:18,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772658414] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:18,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:18,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:19:18,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853438530] [2021-06-05 14:19:18,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:19:18,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:18,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:19:18,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:19:18,825 INFO L87 Difference]: Start difference. First operand 379 states and 1212 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:19,263 INFO L93 Difference]: Finished difference Result 429 states and 1350 transitions. [2021-06-05 14:19:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:19:19,263 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:19:19,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:19,263 INFO L225 Difference]: With dead ends: 429 [2021-06-05 14:19:19,264 INFO L226 Difference]: Without dead ends: 418 [2021-06-05 14:19:19,264 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 853.1ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:19:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2021-06-05 14:19:19,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 378. [2021-06-05 14:19:19,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2095490716180373) internal successors, (1210), 377 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1210 transitions. [2021-06-05 14:19:19,268 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1210 transitions. Word has length 17 [2021-06-05 14:19:19,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:19,268 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1210 transitions. [2021-06-05 14:19:19,268 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1210 transitions. [2021-06-05 14:19:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:19,268 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:19,268 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:19:19,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1629,206 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:19:19,469 INFO L430 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:19,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1996192008, now seen corresponding path program 60 times [2021-06-05 14:19:19,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:19,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938270981] [2021-06-05 14:19:19,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:19,781 INFO L134 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:19:19,781 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:19,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938270981] [2021-06-05 14:19:19,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938270981] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:19,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274059486] [2021-06-05 14:19:19,781 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 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:19:19,809 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:19:19,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:19,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:19,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:19,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 25 treesize of output 19 [2021-06-05 14:19:19,899 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:19,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 15 treesize of output 11 [2021-06-05 14:19:19,903 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:19,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:19,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 27 treesize of output 21 [2021-06-05 14:19:19,941 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:19,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 25 treesize of output 19 [2021-06-05 14:19:19,945 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:19,974 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:19,976 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:19,976 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:90 [2021-06-05 14:19:20,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 14:19:20,096 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:20,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,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 25 treesize of output 19 [2021-06-05 14:19:20,102 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:20,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:19:20,108 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:20,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,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 35 treesize of output 27 [2021-06-05 14:19:20,113 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:20,175 INFO L628 ElimStorePlain]: treesize reduction 123, result has 42.3 percent of original size [2021-06-05 14:19:20,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,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 11 treesize of output 7 [2021-06-05 14:19:20,180 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:20,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,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 14 [2021-06-05 14:19:20,183 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:20,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:20,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,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 18 treesize of output 14 [2021-06-05 14:19:20,207 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:20,227 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:20,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:20,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 10 treesize of output 6 [2021-06-05 14:19:20,231 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:20,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:20,252 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:20,252 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:245, output treesize:38 [2021-06-05 14:19:20,295 INFO L134 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:19:20,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274059486] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:20,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:20,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:19:20,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779954503] [2021-06-05 14:19:20,296 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:19:20,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:20,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:19:20,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:19:20,296 INFO L87 Difference]: Start difference. First operand 378 states and 1210 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:19:20,840 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2021-06-05 14:19:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:20,914 INFO L93 Difference]: Finished difference Result 432 states and 1360 transitions. [2021-06-05 14:19:20,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:19:20,914 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:19:20,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:20,915 INFO L225 Difference]: With dead ends: 432 [2021-06-05 14:19:20,915 INFO L226 Difference]: Without dead ends: 422 [2021-06-05 14:19:20,915 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 804.4ms TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:19:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-06-05 14:19:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2021-06-05 14:19:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.20844327176781) internal successors, (1216), 379 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1216 transitions. [2021-06-05 14:19:20,919 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1216 transitions. Word has length 17 [2021-06-05 14:19:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:20,919 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1216 transitions. [2021-06-05 14:19:20,919 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:19:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1216 transitions. [2021-06-05 14:19:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:20,919 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:20,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:19:21,120 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 207 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1654 [2021-06-05 14:19:21,120 INFO L430 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:21,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:21,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1653608496, now seen corresponding path program 61 times [2021-06-05 14:19:21,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:21,120 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074361496] [2021-06-05 14:19:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:21,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:19:21,365 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:21,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074361496] [2021-06-05 14:19:21,365 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074361496] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:21,365 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809678636] [2021-06-05 14:19:21,365 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 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:19:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:21,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:21,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:21,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:21,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:21,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 27 treesize of output 21 [2021-06-05 14:19:21,500 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:21,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:21,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 25 treesize of output 19 [2021-06-05 14:19:21,503 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:21,536 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:21,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:21,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:21,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:21,541 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:21,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:21,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:19:21,549 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:21,579 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:21,582 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:19:21,582 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:107 [2021-06-05 14:19:21,689 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_438, array_2, v_prenex_440, v_prenex_442], 1=[v_prenex_437, v_prenex_439, array_0, v_prenex_441]} [2021-06-05 14:19:21,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 21 treesize of output 17 [2021-06-05 14:19:21,700 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:21,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 19 treesize of output 15 [2021-06-05 14:19:21,704 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:21,769 INFO L628 ElimStorePlain]: treesize reduction 117, result has 46.1 percent of original size [2021-06-05 14:19:21,769 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:19: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 27 treesize of output 21 [2021-06-05 14:19:21,772 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:21,794 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:21,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:21,797 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:21,819 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:21,822 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:21,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 11 treesize of output 7 [2021-06-05 14:19:21,824 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:21,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:21,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:21,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 10 treesize of output 6 [2021-06-05 14:19:21,847 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:21,867 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:21,867 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 14:19:21,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:21,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 22 treesize of output 14 [2021-06-05 14:19:21,870 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:21,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:21,890 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:21,890 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:231, output treesize:38 [2021-06-05 14:19:21,930 INFO L134 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:19:21,930 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809678636] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:21,930 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:21,930 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:19:21,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441722341] [2021-06-05 14:19:21,930 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:19:21,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:21,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:19:21,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:19:21,930 INFO L87 Difference]: Start difference. First operand 380 states and 1216 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:19:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:22,419 INFO L93 Difference]: Finished difference Result 430 states and 1354 transitions. [2021-06-05 14:19:22,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:19:22,420 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:19:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:22,421 INFO L225 Difference]: With dead ends: 430 [2021-06-05 14:19:22,421 INFO L226 Difference]: Without dead ends: 419 [2021-06-05 14:19:22,421 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 622.7ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:19:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-06-05 14:19:22,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 378. [2021-06-05 14:19:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2095490716180373) internal successors, (1210), 377 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1210 transitions. [2021-06-05 14:19:22,425 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1210 transitions. Word has length 17 [2021-06-05 14:19:22,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:22,425 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1210 transitions. [2021-06-05 14:19:22,426 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:19:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1210 transitions. [2021-06-05 14:19:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:22,426 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:22,426 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:19:22,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1666,208 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:19:22,627 INFO L430 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:22,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1205884026, now seen corresponding path program 62 times [2021-06-05 14:19:22,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:22,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478541568] [2021-06-05 14:19:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:23,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:19:23,010 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:23,010 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478541568] [2021-06-05 14:19:23,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478541568] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:23,010 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287769002] [2021-06-05 14:19:23,010 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 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:19:23,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:19:23,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:23,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:23,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:23,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 15 treesize of output 11 [2021-06-05 14:19:23,129 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:23,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 25 treesize of output 19 [2021-06-05 14:19:23,132 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:23,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:23,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 27 treesize of output 21 [2021-06-05 14:19:23,156 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:23,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 25 treesize of output 19 [2021-06-05 14:19:23,159 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:23,177 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:23,178 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:23,178 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:80 [2021-06-05 14:19:23,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:19:23,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:23,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 19 treesize of output 15 [2021-06-05 14:19:23,242 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:23,274 INFO L628 ElimStorePlain]: treesize reduction 47, result has 63.0 percent of original size [2021-06-05 14:19:23,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 13 treesize of output 9 [2021-06-05 14:19:23,278 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:23,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:23,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:23,295 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:23,307 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:23,307 INFO L518 ElimStorePlain]: Eliminatee v_prenex_445 vanished before elimination [2021-06-05 14:19:23,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 23 [2021-06-05 14:19:23,310 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:23,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:23,320 INFO L518 ElimStorePlain]: Eliminatee v_prenex_447 vanished before elimination [2021-06-05 14:19:23,321 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:23,321 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:137, output treesize:32 [2021-06-05 14:19:23,354 INFO L134 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:19:23,354 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287769002] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:23,354 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:23,354 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:19:23,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545476934] [2021-06-05 14:19:23,354 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:19:23,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:23,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:19:23,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:19:23,355 INFO L87 Difference]: Start difference. First operand 378 states and 1210 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:19:23,802 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2021-06-05 14:19:23,989 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2021-06-05 14:19:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:24,066 INFO L93 Difference]: Finished difference Result 456 states and 1422 transitions. [2021-06-05 14:19:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:19:24,066 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:19:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:24,067 INFO L225 Difference]: With dead ends: 456 [2021-06-05 14:19:24,067 INFO L226 Difference]: Without dead ends: 444 [2021-06-05 14:19:24,067 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 905.5ms TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:19:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2021-06-05 14:19:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 382. [2021-06-05 14:19:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.2073490813648293) internal successors, (1222), 381 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1222 transitions. [2021-06-05 14:19:24,071 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1222 transitions. Word has length 17 [2021-06-05 14:19:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:24,071 INFO L482 AbstractCegarLoop]: Abstraction has 382 states and 1222 transitions. [2021-06-05 14:19:24,071 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:19:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1222 transitions. [2021-06-05 14:19:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:24,072 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:24,072 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:19:24,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 209 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1699 [2021-06-05 14:19:24,272 INFO L430 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash 391077872, now seen corresponding path program 63 times [2021-06-05 14:19:24,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:24,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193726103] [2021-06-05 14:19:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:24,569 INFO L134 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:19:24,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:24,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193726103] [2021-06-05 14:19:24,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193726103] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:24,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264304286] [2021-06-05 14:19:24,569 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 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:19:24,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:19:24,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:24,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:19:24,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:24,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:24,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:24,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:24,777 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:24,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:24,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:19:24,783 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:24,833 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:24,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:24,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:24,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 25 treesize of output 19 [2021-06-05 14:19:24,838 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:24,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:24,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 35 treesize of output 27 [2021-06-05 14:19:24,842 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:24,886 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:24,889 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:19:24,890 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:192, output treesize:162 [2021-06-05 14:19:25,015 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 14:19:25,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,020 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:19:25,021 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:25,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:25,026 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:25,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,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 35 treesize of output 27 [2021-06-05 14:19:25,031 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:25,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,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 29 treesize of output 23 [2021-06-05 14:19:25,037 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:25,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,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 25 treesize of output 19 [2021-06-05 14:19:25,042 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:25,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,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 39 treesize of output 31 [2021-06-05 14:19:25,047 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:25,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:25,053 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:25,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:19:25,057 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:25,196 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 70 [2021-06-05 14:19:25,196 INFO L628 ElimStorePlain]: treesize reduction 138, result has 57.9 percent of original size [2021-06-05 14:19:25,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 14:19:25,201 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:25,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,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 22 treesize of output 14 [2021-06-05 14:19:25,206 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:25,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,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 11 treesize of output 7 [2021-06-05 14:19:25,211 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:25,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:25,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 14:19:25,215 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:25,267 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:25,270 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:19:25,270 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:411, output treesize:103 [2021-06-05 14:19:25,391 INFO L134 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:19:25,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264304286] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:25,391 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:25,391 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:19:25,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247650955] [2021-06-05 14:19:25,391 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:19:25,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:25,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:19:25,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:19:25,392 INFO L87 Difference]: Start difference. First operand 382 states and 1222 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:25,995 INFO L93 Difference]: Finished difference Result 456 states and 1426 transitions. [2021-06-05 14:19:25,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:19:25,995 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:19:25,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:25,996 INFO L225 Difference]: With dead ends: 456 [2021-06-05 14:19:25,996 INFO L226 Difference]: Without dead ends: 443 [2021-06-05 14:19:25,996 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 822.1ms TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:19:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-06-05 14:19:25,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 380. [2021-06-05 14:19:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.20844327176781) internal successors, (1216), 379 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1216 transitions. [2021-06-05 14:19:26,000 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1216 transitions. Word has length 17 [2021-06-05 14:19:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:26,000 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1216 transitions. [2021-06-05 14:19:26,000 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1216 transitions. [2021-06-05 14:19:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:26,001 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:26,001 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:19:26,201 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1708,210 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:19:26,201 INFO L430 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:26,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:26,201 INFO L82 PathProgramCache]: Analyzing trace with hash 981448970, now seen corresponding path program 64 times [2021-06-05 14:19:26,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:26,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312708] [2021-06-05 14:19:26,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:26,457 INFO L134 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:19:26,458 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:26,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312708] [2021-06-05 14:19:26,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312708] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:26,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683838842] [2021-06-05 14:19:26,458 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 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:19:26,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:19:26,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:26,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:19:26,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:26,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,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 25 treesize of output 19 [2021-06-05 14:19:26,628 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:26,631 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:19:26,632 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:26,668 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:26,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,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:19:26,673 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:26,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,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 25 treesize of output 19 [2021-06-05 14:19:26,677 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:26,709 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:26,712 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:19:26,712 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:160, output treesize:122 [2021-06-05 14:19:26,894 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 14:19:26,898 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,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 15 treesize of output 11 [2021-06-05 14:19:26,899 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:26,903 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,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 29 treesize of output 23 [2021-06-05 14:19:26,904 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:26,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,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 17 treesize of output 13 [2021-06-05 14:19:26,910 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:26,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,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 17 treesize of output 13 [2021-06-05 14:19:26,915 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:26,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,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 25 treesize of output 19 [2021-06-05 14:19:26,920 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:26,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,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 27 treesize of output 21 [2021-06-05 14:19:26,925 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:26,929 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:26,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 31 [2021-06-05 14:19:26,930 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:26,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 27 treesize of output 21 [2021-06-05 14:19:26,948 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:27,090 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2021-06-05 14:19:27,091 INFO L628 ElimStorePlain]: treesize reduction 142, result has 57.2 percent of original size [2021-06-05 14:19:27,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:27,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:27,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 14:19:27,096 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:27,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:27,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:27,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 22 treesize of output 14 [2021-06-05 14:19:27,107 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:27,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:27,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:27,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:19:27,112 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:27,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:27,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 14:19:27,116 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:27,168 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:27,170 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:19:27,171 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:395, output treesize:103 [2021-06-05 14:19:27,291 INFO L134 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:19:27,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683838842] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:27,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:27,291 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:19:27,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996016735] [2021-06-05 14:19:27,291 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:19:27,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:27,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:19:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:19:27,292 INFO L87 Difference]: Start difference. First operand 380 states and 1216 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:27,959 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2021-06-05 14:19:28,144 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2021-06-05 14:19:28,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:28,214 INFO L93 Difference]: Finished difference Result 508 states and 1579 transitions. [2021-06-05 14:19:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:19:28,214 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:19:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:28,215 INFO L225 Difference]: With dead ends: 508 [2021-06-05 14:19:28,215 INFO L226 Difference]: Without dead ends: 494 [2021-06-05 14:19:28,215 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1051.3ms TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:19:28,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-06-05 14:19:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 379. [2021-06-05 14:19:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2116402116402116) internal successors, (1214), 378 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:19:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1214 transitions. [2021-06-05 14:19:28,221 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1214 transitions. Word has length 17 [2021-06-05 14:19:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:28,221 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1214 transitions. [2021-06-05 14:19:28,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1214 transitions. [2021-06-05 14:19:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:28,222 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:28,222 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:19:28,422 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1726,211 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:19:28,423 INFO L430 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:28,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:28,423 INFO L82 PathProgramCache]: Analyzing trace with hash 527178728, now seen corresponding path program 65 times [2021-06-05 14:19:28,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:28,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540959538] [2021-06-05 14:19:28,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:28,859 INFO L134 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:19:28,859 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:28,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540959538] [2021-06-05 14:19:28,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540959538] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:28,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759167384] [2021-06-05 14:19:28,860 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 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:19:28,889 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:19:28,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:28,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:28,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:28,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 27 treesize of output 21 [2021-06-05 14:19:28,997 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:29,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 25 treesize of output 19 [2021-06-05 14:19:29,001 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:29,036 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:29,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:19:29,040 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:29,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:29,043 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:29,072 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:29,074 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:29,074 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:96 [2021-06-05 14:19:29,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:29,191 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:29,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:19:29,196 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:29,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,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 28 treesize of output 22 [2021-06-05 14:19:29,201 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:29,284 INFO L628 ElimStorePlain]: treesize reduction 127, result has 45.3 percent of original size [2021-06-05 14:19:29,287 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,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 27 treesize of output 21 [2021-06-05 14:19:29,289 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:29,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,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 27 treesize of output 21 [2021-06-05 14:19:29,293 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:29,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:29,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,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 11 treesize of output 7 [2021-06-05 14:19:29,325 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:29,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,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 22 treesize of output 14 [2021-06-05 14:19:29,328 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:29,353 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:29,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:29,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 14:19:29,358 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:29,382 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:29,384 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:29,384 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:257, output treesize:38 [2021-06-05 14:19:29,428 INFO L134 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:19:29,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759167384] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:29,429 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:29,429 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:19:29,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608325704] [2021-06-05 14:19:29,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:19:29,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:29,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:19:29,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:19:29,429 INFO L87 Difference]: Start difference. First operand 379 states and 1214 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:19:30,078 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2021-06-05 14:19:30,397 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2021-06-05 14:19:30,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:30,486 INFO L93 Difference]: Finished difference Result 451 states and 1418 transitions. [2021-06-05 14:19:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:19:30,486 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:19:30,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:30,487 INFO L225 Difference]: With dead ends: 451 [2021-06-05 14:19:30,487 INFO L226 Difference]: Without dead ends: 441 [2021-06-05 14:19:30,488 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1237.5ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:19:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2021-06-05 14:19:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 383. [2021-06-05 14:19:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 3.2094240837696337) internal successors, (1226), 382 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1226 transitions. [2021-06-05 14:19:30,493 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 1226 transitions. Word has length 17 [2021-06-05 14:19:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:30,493 INFO L482 AbstractCegarLoop]: Abstraction has 383 states and 1226 transitions. [2021-06-05 14:19:30,493 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:19:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 1226 transitions. [2021-06-05 14:19:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:30,494 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:30,494 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:19:30,694 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 212 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1750 [2021-06-05 14:19:30,695 INFO L430 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:30,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:30,695 INFO L82 PathProgramCache]: Analyzing trace with hash 869762240, now seen corresponding path program 66 times [2021-06-05 14:19:30,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:30,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11505387] [2021-06-05 14:19:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:19:31,002 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:31,002 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11505387] [2021-06-05 14:19:31,002 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11505387] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:31,002 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314712830] [2021-06-05 14:19:31,002 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 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:19:31,033 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 14:19:31,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:31,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:19:31,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:31,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,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 25 treesize of output 19 [2021-06-05 14:19:31,155 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:31,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:19:31,162 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:31,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,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 25 treesize of output 19 [2021-06-05 14:19:31,168 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:31,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,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 15 treesize of output 11 [2021-06-05 14:19:31,172 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:31,248 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:31,250 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:31,250 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:159 [2021-06-05 14:19:31,372 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_462, v_prenex_464, v_prenex_466], 1=[array_0, v_prenex_461, v_prenex_463, v_prenex_465]} [2021-06-05 14:19:31,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 25 treesize of output 19 [2021-06-05 14:19:31,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:31,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:19:31,383 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:31,547 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2021-06-05 14:19:31,547 INFO L628 ElimStorePlain]: treesize reduction 151, result has 56.4 percent of original size [2021-06-05 14:19:31,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 19 treesize of output 15 [2021-06-05 14:19:31,552 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:31,619 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:31,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 29 treesize of output 23 [2021-06-05 14:19:31,625 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:31,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 39 treesize of output 31 [2021-06-05 14:19:31,630 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:31,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:31,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 7 treesize of output 5 [2021-06-05 14:19:31,697 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:31,758 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:31,762 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,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 10 treesize of output 6 [2021-06-05 14:19:31,763 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:31,822 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:31,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,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 12 treesize of output 8 [2021-06-05 14:19:31,828 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:31,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:31,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,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 25 treesize of output 17 [2021-06-05 14:19:31,890 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:31,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:31,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 11 treesize of output 7 [2021-06-05 14:19:31,895 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:31,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:31,949 INFO L518 ElimStorePlain]: Eliminatee v_prenex_465 vanished before elimination [2021-06-05 14:19:31,951 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:19:31,951 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:367, output treesize:122 [2021-06-05 14:19:32,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:19:32,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314712830] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:32,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:32,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:19:32,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102209812] [2021-06-05 14:19:32,259 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:19:32,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:32,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:19:32,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:19:32,260 INFO L87 Difference]: Start difference. First operand 383 states and 1226 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:33,048 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2021-06-05 14:19:33,232 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2021-06-05 14:19:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:33,334 INFO L93 Difference]: Finished difference Result 449 states and 1412 transitions. [2021-06-05 14:19:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:19:33,335 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:19:33,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:33,336 INFO L225 Difference]: With dead ends: 449 [2021-06-05 14:19:33,336 INFO L226 Difference]: Without dead ends: 438 [2021-06-05 14:19:33,336 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1127.0ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:19:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-06-05 14:19:33,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 381. [2021-06-05 14:19:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.210526315789474) internal successors, (1220), 380 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1220 transitions. [2021-06-05 14:19:33,341 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1220 transitions. Word has length 17 [2021-06-05 14:19:33,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:33,341 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1220 transitions. [2021-06-05 14:19:33,341 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1220 transitions. [2021-06-05 14:19:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:33,342 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:33,342 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:19:33,542 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1763,213 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:19:33,543 INFO L430 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:33,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:33,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1237021880, now seen corresponding path program 67 times [2021-06-05 14:19:33,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:33,543 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585305439] [2021-06-05 14:19:33,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:33,860 INFO L134 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:19:33,860 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:33,860 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585305439] [2021-06-05 14:19:33,861 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585305439] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:33,861 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972207661] [2021-06-05 14:19:33,861 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 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:19:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:33,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:33,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:33,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 25 treesize of output 19 [2021-06-05 14:19:33,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:33,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:33,985 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:34,017 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:34,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:34,022 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:34,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:19:34,026 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:34,056 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:34,059 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:19:34,059 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:131, output treesize:99 [2021-06-05 14:19:34,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:34,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:34,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:19:34,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:34,266 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:34,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:34,267 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:34,359 INFO L628 ElimStorePlain]: treesize reduction 117, result has 46.3 percent of original size [2021-06-05 14:19:34,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:34,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 21 treesize of output 13 [2021-06-05 14:19:34,364 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:34,395 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:34,398 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:34,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 15 [2021-06-05 14:19:34,399 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:34,424 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:34,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:34,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:19:34,429 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:34,454 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:34,454 INFO L518 ElimStorePlain]: Eliminatee v_prenex_473 vanished before elimination [2021-06-05 14:19:34,454 INFO L518 ElimStorePlain]: Eliminatee v_prenex_474 vanished before elimination [2021-06-05 14:19:34,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:34,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 27 treesize of output 21 [2021-06-05 14:19:34,458 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:34,481 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:34,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:34,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:19:34,485 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:34,507 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:34,510 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:34,510 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:231, output treesize:38 [2021-06-05 14:19:34,558 INFO L134 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:19:34,558 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972207661] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:34,558 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:34,558 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:19:34,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814293001] [2021-06-05 14:19:34,558 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:19:34,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:34,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:19:34,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:19:34,558 INFO L87 Difference]: Start difference. First operand 381 states and 1220 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:19:35,025 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-06-05 14:19:35,577 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 86 [2021-06-05 14:19:35,759 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2021-06-05 14:19:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:35,975 INFO L93 Difference]: Finished difference Result 487 states and 1515 transitions. [2021-06-05 14:19:35,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:19:35,976 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 17 [2021-06-05 14:19:35,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:35,976 INFO L225 Difference]: With dead ends: 487 [2021-06-05 14:19:35,976 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 14:19:35,977 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1481.2ms TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:19:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 14:19:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 381. [2021-06-05 14:19:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.210526315789474) internal successors, (1220), 380 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1220 transitions. [2021-06-05 14:19:35,982 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1220 transitions. Word has length 17 [2021-06-05 14:19:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:35,982 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1220 transitions. [2021-06-05 14:19:35,982 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:19:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1220 transitions. [2021-06-05 14:19:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:35,982 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:35,982 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:19:36,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 214 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1783 [2021-06-05 14:19:36,193 INFO L430 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:36,193 INFO L82 PathProgramCache]: Analyzing trace with hash -176185004, now seen corresponding path program 68 times [2021-06-05 14:19:36,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:36,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580261505] [2021-06-05 14:19:36,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:19:36,481 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:36,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580261505] [2021-06-05 14:19:36,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580261505] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:36,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285983717] [2021-06-05 14:19:36,481 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 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:19:36,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:19:36,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:36,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:19:36,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:36,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:36,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 35 treesize of output 27 [2021-06-05 14:19:36,610 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:36,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:36,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:19:36,614 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:36,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:36,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 25 treesize of output 19 [2021-06-05 14:19:36,618 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:36,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:36,621 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:36,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:36,675 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:36,675 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:159 [2021-06-05 14:19:36,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:36,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:36,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 25 treesize of output 19 [2021-06-05 14:19:36,966 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:36,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:36,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:36,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:19:36,972 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:36,976 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:36,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:36,977 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:37,090 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2021-06-05 14:19:37,091 INFO L628 ElimStorePlain]: treesize reduction 151, result has 49.3 percent of original size [2021-06-05 14:19:37,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:37,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 21 treesize of output 13 [2021-06-05 14:19:37,096 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:37,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:37,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:37,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 19 treesize of output 15 [2021-06-05 14:19:37,142 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:37,182 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:37,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:37,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:19:37,186 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:37,226 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:37,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:37,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:37,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 21 treesize of output 17 [2021-06-05 14:19:37,231 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:37,234 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:37,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 19 treesize of output 15 [2021-06-05 14:19:37,234 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:37,269 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:37,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:37,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:37,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 14:19:37,274 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:37,277 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:37,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:19:37,278 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:37,312 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:37,312 INFO L518 ElimStorePlain]: Eliminatee v_prenex_477 vanished before elimination [2021-06-05 14:19:37,312 INFO L518 ElimStorePlain]: Eliminatee v_prenex_478 vanished before elimination [2021-06-05 14:19:37,314 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:19:37,314 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:330, output treesize:67 [2021-06-05 14:19:37,369 INFO L134 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:19:37,369 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285983717] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:37,369 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:37,369 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:19:37,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380914948] [2021-06-05 14:19:37,369 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:19:37,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:37,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:19:37,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:19:37,369 INFO L87 Difference]: Start difference. First operand 381 states and 1220 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:38,231 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2021-06-05 14:19:38,560 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 66 [2021-06-05 14:19:38,769 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2021-06-05 14:19:39,113 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2021-06-05 14:19:39,513 WARN L205 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 78 [2021-06-05 14:19:39,856 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 74 [2021-06-05 14:19:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:39,920 INFO L93 Difference]: Finished difference Result 476 states and 1470 transitions. [2021-06-05 14:19:39,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 14:19:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:19:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:39,921 INFO L225 Difference]: With dead ends: 476 [2021-06-05 14:19:39,921 INFO L226 Difference]: Without dead ends: 464 [2021-06-05 14:19:39,921 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2660.6ms TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2021-06-05 14:19:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-06-05 14:19:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 384. [2021-06-05 14:19:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.1984334203655354) internal successors, (1225), 383 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:19:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1225 transitions. [2021-06-05 14:19:39,925 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1225 transitions. Word has length 17 [2021-06-05 14:19:39,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:39,925 INFO L482 AbstractCegarLoop]: Abstraction has 384 states and 1225 transitions. [2021-06-05 14:19:39,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1225 transitions. [2021-06-05 14:19:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:39,926 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:39,926 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:19:40,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1813,215 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:19:40,126 INFO L430 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:40,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1305052866, now seen corresponding path program 69 times [2021-06-05 14:19:40,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:40,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039142810] [2021-06-05 14:19:40,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:19:40,381 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:40,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039142810] [2021-06-05 14:19:40,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039142810] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:40,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955051388] [2021-06-05 14:19:40,381 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 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:19:40,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:19:40,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:40,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:40,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:40,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:40,529 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:40,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:40,530 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:40,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:40,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:19:40,533 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:40,608 INFO L628 ElimStorePlain]: treesize reduction 8, result has 94.0 percent of original size [2021-06-05 14:19:40,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:40,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:40,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 25 treesize of output 19 [2021-06-05 14:19:40,612 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:40,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:40,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 27 treesize of output 21 [2021-06-05 14:19:40,621 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:40,649 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:40,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:19:40,652 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:147, output treesize:106 [2021-06-05 14:19:40,759 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_490, array_0, v_prenex_492, v_prenex_494], 1=[v_prenex_491, v_prenex_493, array_4, v_prenex_495]} [2021-06-05 14:19:40,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 25 treesize of output 19 [2021-06-05 14:19:40,764 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:40,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 27 treesize of output 21 [2021-06-05 14:19:40,769 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:40,859 INFO L628 ElimStorePlain]: treesize reduction 93, result has 60.8 percent of original size [2021-06-05 14:19:40,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 7 treesize of output 5 [2021-06-05 14:19:40,864 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:40,899 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:40,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:19:40,904 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:40,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 14:19:40,907 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:40,938 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:40,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 27 treesize of output 21 [2021-06-05 14:19:40,942 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:40,971 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:40,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:40,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:19:40,975 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:41,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:41,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:41,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:41,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 12 treesize of output 8 [2021-06-05 14:19:41,008 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:41,010 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:41,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:19:41,012 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:41,040 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:41,040 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:19:41,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:41,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:19:41,044 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:41,072 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:41,074 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:19:41,074 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:249, output treesize:48 [2021-06-05 14:19:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:19:41,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955051388] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:41,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:41,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:19:41,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958043306] [2021-06-05 14:19:41,127 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:19:41,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:41,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:19:41,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:19:41,127 INFO L87 Difference]: Start difference. First operand 384 states and 1225 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:19:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:42,108 INFO L93 Difference]: Finished difference Result 475 states and 1475 transitions. [2021-06-05 14:19:42,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:19:42,108 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:19:42,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:42,109 INFO L225 Difference]: With dead ends: 475 [2021-06-05 14:19:42,109 INFO L226 Difference]: Without dead ends: 459 [2021-06-05 14:19:42,109 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1056.2ms TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:19:42,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-06-05 14:19:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 381. [2021-06-05 14:19:42,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.2) internal successors, (1216), 380 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1216 transitions. [2021-06-05 14:19:42,113 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1216 transitions. Word has length 17 [2021-06-05 14:19:42,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:42,113 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1216 transitions. [2021-06-05 14:19:42,113 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:19:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1216 transitions. [2021-06-05 14:19:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:42,113 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:42,113 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:19:42,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 216 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1856 [2021-06-05 14:19:42,314 INFO L430 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:42,314 INFO L82 PathProgramCache]: Analyzing trace with hash 733598060, now seen corresponding path program 70 times [2021-06-05 14:19:42,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:42,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872263231] [2021-06-05 14:19:42,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:42,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:42,577 INFO L134 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:19:42,578 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:42,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872263231] [2021-06-05 14:19:42,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872263231] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:42,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738085208] [2021-06-05 14:19:42,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:19:42,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:19:42,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:42,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:19:42,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:42,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:42,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:42,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:19:42,780 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:42,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:42,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 25 treesize of output 19 [2021-06-05 14:19:42,784 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:42,848 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:42,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:42,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:42,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 27 treesize of output 21 [2021-06-05 14:19:42,853 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:42,856 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:42,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:42,857 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:42,914 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:42,917 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:42,917 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:42,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:42,919 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:42,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:42,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 15 treesize of output 11 [2021-06-05 14:19:42,922 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:42,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:42,975 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 14:19:42,975 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:239, output treesize:198 [2021-06-05 14:19:43,253 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_503, v_prenex_505, array_0, v_prenex_507, v_prenex_509, v_prenex_511], 1=[v_prenex_504, v_prenex_506, v_prenex_508, array_4, v_prenex_510, v_prenex_512]} [2021-06-05 14:19:43,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 30 treesize of output 24 [2021-06-05 14:19:43,261 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:43,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 28 treesize of output 22 [2021-06-05 14:19:43,268 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:43,429 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 95 [2021-06-05 14:19:43,429 INFO L628 ElimStorePlain]: treesize reduction 205, result has 50.6 percent of original size [2021-06-05 14:19:43,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 7 treesize of output 5 [2021-06-05 14:19:43,435 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:43,489 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:43,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:43,494 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:43,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:43,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:43,548 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:43,597 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:43,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 7 treesize of output 5 [2021-06-05 14:19:43,617 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:43,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:43,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 27 treesize of output 21 [2021-06-05 14:19:43,675 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:43,721 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:43,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:43,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:43,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 12 treesize of output 8 [2021-06-05 14:19:43,727 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:43,731 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:43,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 21 treesize of output 13 [2021-06-05 14:19:43,732 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:43,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:43,776 INFO L518 ElimStorePlain]: Eliminatee v_prenex_506 vanished before elimination [2021-06-05 14:19:43,779 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:43,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:19:43,781 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:43,825 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:43,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:43,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 22 treesize of output 14 [2021-06-05 14:19:43,829 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:43,872 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:43,872 INFO L518 ElimStorePlain]: Eliminatee v_prenex_510 vanished before elimination [2021-06-05 14:19:43,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:43,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:19:43,876 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:43,917 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:43,920 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 14:19:43,920 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 18 variables, input treesize:435, output treesize:75 [2021-06-05 14:19:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:19:43,979 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738085208] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:43,979 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:43,979 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:19:43,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450030173] [2021-06-05 14:19:43,979 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:19:43,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:43,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:19:43,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:19:43,980 INFO L87 Difference]: Start difference. First operand 381 states and 1216 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:44,902 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 127 [2021-06-05 14:19:45,096 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2021-06-05 14:19:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:45,164 INFO L93 Difference]: Finished difference Result 488 states and 1491 transitions. [2021-06-05 14:19:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:19:45,165 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:19:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:45,165 INFO L225 Difference]: With dead ends: 488 [2021-06-05 14:19:45,165 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 14:19:45,166 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1269.0ms TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:19:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 14:19:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 379. [2021-06-05 14:19:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2037037037037037) internal successors, (1211), 378 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1211 transitions. [2021-06-05 14:19:45,170 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1211 transitions. Word has length 17 [2021-06-05 14:19:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:45,170 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1211 transitions. [2021-06-05 14:19:45,170 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:45,170 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1211 transitions. [2021-06-05 14:19:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:45,170 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:45,170 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:19:45,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 217 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1886 [2021-06-05 14:19:45,371 INFO L430 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:45,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:45,371 INFO L82 PathProgramCache]: Analyzing trace with hash -271217144, now seen corresponding path program 71 times [2021-06-05 14:19:45,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:45,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726843717] [2021-06-05 14:19:45,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:45,726 INFO L134 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:19:45,726 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:45,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726843717] [2021-06-05 14:19:45,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726843717] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:45,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089256774] [2021-06-05 14:19:45,726 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 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:19:45,754 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:19:45,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:45,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:19:45,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:45,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:45,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:45,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 15 treesize of output 11 [2021-06-05 14:19:45,874 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:45,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:45,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:45,878 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:45,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:45,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:45,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19: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 25 treesize of output 19 [2021-06-05 14:19:45,916 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:45,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:45,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 27 treesize of output 21 [2021-06-05 14:19:45,920 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:45,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:45,951 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:19:45,952 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:149, output treesize:112 [2021-06-05 14:19:46,151 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 14:19:46,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:19:46,156 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:46,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 14:19:46,161 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:46,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,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 25 treesize of output 19 [2021-06-05 14:19:46,165 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:46,169 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:19:46,170 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:46,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,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:19:46,175 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:46,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:46,180 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:46,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,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 18 treesize of output 14 [2021-06-05 14:19:46,185 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:46,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 25 treesize of output 19 [2021-06-05 14:19:46,189 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:46,337 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2021-06-05 14:19:46,338 INFO L628 ElimStorePlain]: treesize reduction 151, result has 56.2 percent of original size [2021-06-05 14:19:46,341 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,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 11 treesize of output 7 [2021-06-05 14:19:46,343 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:46,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:19:46,348 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:46,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,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 10 treesize of output 6 [2021-06-05 14:19:46,353 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:46,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:46,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:19:46,358 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:46,418 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:46,421 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:19:46,421 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:415, output treesize:128 [2021-06-05 14:19:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:19:46,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089256774] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:46,595 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:46,595 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:19:46,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462478682] [2021-06-05 14:19:46,595 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:19:46,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:46,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:19:46,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:19:46,595 INFO L87 Difference]: Start difference. First operand 379 states and 1211 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:47,377 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2021-06-05 14:19:47,534 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 92 [2021-06-05 14:19:47,766 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 99 [2021-06-05 14:19:48,023 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2021-06-05 14:19:48,351 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 111 [2021-06-05 14:19:48,711 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 109 [2021-06-05 14:19:48,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:48,853 INFO L93 Difference]: Finished difference Result 587 states and 1781 transitions. [2021-06-05 14:19:48,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 14:19:48,854 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:19:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:48,855 INFO L225 Difference]: With dead ends: 587 [2021-06-05 14:19:48,855 INFO L226 Difference]: Without dead ends: 566 [2021-06-05 14:19:48,855 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2228.1ms TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:19:48,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2021-06-05 14:19:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 378. [2021-06-05 14:19:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 3.2015915119363396) internal successors, (1207), 377 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:48,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1207 transitions. [2021-06-05 14:19:48,861 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1207 transitions. Word has length 17 [2021-06-05 14:19:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:48,861 INFO L482 AbstractCegarLoop]: Abstraction has 378 states and 1207 transitions. [2021-06-05 14:19:48,861 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1207 transitions. [2021-06-05 14:19:48,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:48,862 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:48,862 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:19:49,073 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1930,218 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:19:49,073 INFO L430 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:49,073 INFO L82 PathProgramCache]: Analyzing trace with hash 692518350, now seen corresponding path program 72 times [2021-06-05 14:19:49,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:49,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748996011] [2021-06-05 14:19:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:49,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:19:49,523 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:49,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748996011] [2021-06-05 14:19:49,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748996011] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:49,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257053125] [2021-06-05 14:19:49,523 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 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:19:49,554 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:19:49,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:49,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:49,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:49,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:19:49,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:49,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:49,674 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:49,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:49,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 27 treesize of output 21 [2021-06-05 14:19:49,715 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:49,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 25 treesize of output 19 [2021-06-05 14:19:49,719 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:49,748 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:49,749 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:49,749 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:97 [2021-06-05 14:19:49,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:49,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 25 treesize of output 19 [2021-06-05 14:19:49,957 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:50,040 INFO L628 ElimStorePlain]: treesize reduction 115, result has 48.7 percent of original size [2021-06-05 14:19:50,044 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:50,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 27 treesize of output 21 [2021-06-05 14:19:50,045 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:50,073 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:50,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:50,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 14:19:50,077 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:50,104 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:50,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:50,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 21 treesize of output 13 [2021-06-05 14:19:50,109 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:50,134 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:50,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:50,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 11 treesize of output 7 [2021-06-05 14:19:50,139 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:50,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:50,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:50,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 19 treesize of output 15 [2021-06-05 14:19:50,168 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:50,190 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:50,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:50,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 11 treesize of output 7 [2021-06-05 14:19:50,195 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:50,216 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:50,216 INFO L518 ElimStorePlain]: Eliminatee v_prenex_524 vanished before elimination [2021-06-05 14:19:50,218 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:50,219 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 14:19:50,261 INFO L134 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:19:50,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257053125] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:50,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:50,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:19:50,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957649024] [2021-06-05 14:19:50,261 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:19:50,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:50,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:19:50,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:19:50,262 INFO L87 Difference]: Start difference. First operand 378 states and 1207 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:50,954 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2021-06-05 14:19:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:51,057 INFO L93 Difference]: Finished difference Result 445 states and 1384 transitions. [2021-06-05 14:19:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:19:51,057 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:19:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:51,058 INFO L225 Difference]: With dead ends: 445 [2021-06-05 14:19:51,058 INFO L226 Difference]: Without dead ends: 435 [2021-06-05 14:19:51,058 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1037.2ms TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:19:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2021-06-05 14:19:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 380. [2021-06-05 14:19:51,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.203166226912929) internal successors, (1214), 379 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:19:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1214 transitions. [2021-06-05 14:19:51,062 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1214 transitions. Word has length 17 [2021-06-05 14:19:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:51,062 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1214 transitions. [2021-06-05 14:19:51,062 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1214 transitions. [2021-06-05 14:19:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:51,063 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:51,063 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:19:51,263 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 219 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1956 [2021-06-05 14:19:51,264 INFO L430 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:51,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:51,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2121211076, now seen corresponding path program 73 times [2021-06-05 14:19:51,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:51,264 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330498165] [2021-06-05 14:19:51,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:51,528 INFO L134 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:19:51,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:51,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330498165] [2021-06-05 14:19:51,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330498165] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:51,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701215454] [2021-06-05 14:19:51,529 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 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:19:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:51,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:19:51,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:51,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:51,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:51,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:19:51,870 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:51,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:51,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:51,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 25 treesize of output 19 [2021-06-05 14:19:51,875 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:51,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:51,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:19:51,880 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:52,030 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-06-05 14:19:52,030 INFO L628 ElimStorePlain]: treesize reduction 8, result has 96.3 percent of original size [2021-06-05 14:19:52,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:52,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:52,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 25 treesize of output 19 [2021-06-05 14:19:52,035 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:52,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:52,038 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:52,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 25 treesize of output 19 [2021-06-05 14:19:52,039 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:52,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:52,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:52,043 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:52,098 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:52,103 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 14:19:52,103 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:239, output treesize:184 [2021-06-05 14:19:52,500 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_537, array_0, v_prenex_539, v_prenex_541, v_prenex_533, v_prenex_535], 1=[v_prenex_536, v_prenex_538, array_4, v_prenex_540, v_prenex_542, v_prenex_534]} [2021-06-05 14:19:52,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:19:52,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:52,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 14:19:52,515 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:52,701 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2021-06-05 14:19:52,702 INFO L628 ElimStorePlain]: treesize reduction 208, result has 49.5 percent of original size [2021-06-05 14:19:52,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 27 treesize of output 21 [2021-06-05 14:19:52,708 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:52,766 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:52,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 27 treesize of output 21 [2021-06-05 14:19:52,771 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:52,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:52,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 27 treesize of output 21 [2021-06-05 14:19:52,829 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:52,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:52,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 7 treesize of output 5 [2021-06-05 14:19:52,885 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:52,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:52,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:19:52,947 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:53,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:53,004 INFO L518 ElimStorePlain]: Eliminatee v_prenex_536 vanished before elimination [2021-06-05 14:19:53,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:53,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:53,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:19:53,011 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:53,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:53,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:19:53,018 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:53,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:53,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:53,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 11 treesize of output 7 [2021-06-05 14:19:53,080 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:53,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:53,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:53,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 11 treesize of output 7 [2021-06-05 14:19:53,144 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:53,202 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:53,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:53,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 22 treesize of output 14 [2021-06-05 14:19:53,208 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:53,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:53,262 INFO L518 ElimStorePlain]: Eliminatee v_prenex_534 vanished before elimination [2021-06-05 14:19:53,265 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 14:19:53,266 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 18 variables, input treesize:426, output treesize:75 [2021-06-05 14:19:53,334 INFO L134 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:19:53,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701215454] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:53,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:53,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:19:53,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670631499] [2021-06-05 14:19:53,334 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:19:53,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:53,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:19:53,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:19:53,335 INFO L87 Difference]: Start difference. First operand 380 states and 1214 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:54,068 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2021-06-05 14:19:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:54,121 INFO L93 Difference]: Finished difference Result 418 states and 1305 transitions. [2021-06-05 14:19:54,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:19:54,122 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:19:54,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:54,122 INFO L225 Difference]: With dead ends: 418 [2021-06-05 14:19:54,122 INFO L226 Difference]: Without dead ends: 414 [2021-06-05 14:19:54,123 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 777.1ms TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:19:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-06-05 14:19:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 380. [2021-06-05 14:19:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.203166226912929) internal successors, (1214), 379 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:19:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1214 transitions. [2021-06-05 14:19:54,127 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 1214 transitions. Word has length 17 [2021-06-05 14:19:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:54,128 INFO L482 AbstractCegarLoop]: Abstraction has 380 states and 1214 transitions. [2021-06-05 14:19:54,128 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 1214 transitions. [2021-06-05 14:19:54,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:54,128 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:54,128 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:19:54,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1998,220 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:19:54,337 INFO L430 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash -352509152, now seen corresponding path program 74 times [2021-06-05 14:19:54,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:54,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485863062] [2021-06-05 14:19:54,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:19:54,792 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:54,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485863062] [2021-06-05 14:19:54,792 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485863062] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:54,792 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686386539] [2021-06-05 14:19:54,792 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 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:19:54,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:19:54,819 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:54,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:19:54,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:54,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:54,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:54,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:19:54,954 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:54,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:54,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:54,957 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:54,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:54,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:54,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:54,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 25 treesize of output 19 [2021-06-05 14:19:54,997 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:54,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:54,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 27 treesize of output 21 [2021-06-05 14:19:55,000 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:55,032 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:55,035 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:19:55,035 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:112 [2021-06-05 14:19:55,195 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_547, v_prenex_549, array_0, v_prenex_551], 1=[v_prenex_548, array_4, v_prenex_550, v_prenex_552]} [2021-06-05 14:19:55,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 15 treesize of output 11 [2021-06-05 14:19:55,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:55,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 25 treesize of output 19 [2021-06-05 14:19:55,207 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:55,319 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2021-06-05 14:19:55,319 INFO L628 ElimStorePlain]: treesize reduction 93, result has 62.3 percent of original size [2021-06-05 14:19:55,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 27 treesize of output 21 [2021-06-05 14:19:55,324 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:55,365 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:55,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 14:19:55,371 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:55,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 30 treesize of output 24 [2021-06-05 14:19:55,376 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:55,413 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:55,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:19:55,418 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:55,454 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:55,455 INFO L518 ElimStorePlain]: Eliminatee v_prenex_548 vanished before elimination [2021-06-05 14:19:55,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:55,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:55,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 25 treesize of output 17 [2021-06-05 14:19:55,460 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:55,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:55,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 21 treesize of output 13 [2021-06-05 14:19:55,466 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:55,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:55,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:55,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 22 treesize of output 14 [2021-06-05 14:19:55,505 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:55,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:55,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:55,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:19:55,543 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:55,576 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:55,578 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:19:55,579 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:261, output treesize:48 [2021-06-05 14:19:55,646 INFO L134 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:19:55,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686386539] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:55,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:55,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:19:55,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500563153] [2021-06-05 14:19:55,647 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:19:55,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:55,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:19:55,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:19:55,648 INFO L87 Difference]: Start difference. First operand 380 states and 1214 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:56,135 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2021-06-05 14:19:56,293 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2021-06-05 14:19:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:56,391 INFO L93 Difference]: Finished difference Result 450 states and 1397 transitions. [2021-06-05 14:19:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:19:56,392 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:19:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:56,392 INFO L225 Difference]: With dead ends: 450 [2021-06-05 14:19:56,392 INFO L226 Difference]: Without dead ends: 440 [2021-06-05 14:19:56,393 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 997.8ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:19:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-06-05 14:19:56,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 379. [2021-06-05 14:19:56,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.201058201058201) internal successors, (1210), 378 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1210 transitions. [2021-06-05 14:19:56,401 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1210 transitions. Word has length 17 [2021-06-05 14:19:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:56,401 INFO L482 AbstractCegarLoop]: Abstraction has 379 states and 1210 transitions. [2021-06-05 14:19:56,401 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:19:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1210 transitions. [2021-06-05 14:19:56,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:56,402 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:56,402 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:19:56,603 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2047,221 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:19:56,603 INFO L430 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:56,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1572294666, now seen corresponding path program 75 times [2021-06-05 14:19:56,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:56,604 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646182005] [2021-06-05 14:19:56,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:56,952 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2021-06-05 14:19:57,179 INFO L134 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:19:57,179 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:57,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646182005] [2021-06-05 14:19:57,179 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646182005] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:57,179 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691149841] [2021-06-05 14:19:57,179 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 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:19:57,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:19:57,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:57,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:19:57,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:57,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,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 25 treesize of output 19 [2021-06-05 14:19:57,310 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:57,313 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:57,314 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:57,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,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 15 treesize of output 11 [2021-06-05 14:19:57,318 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:57,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:19:57,322 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:57,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:57,376 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:19:57,376 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:155 [2021-06-05 14:19:57,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 14:19:57,607 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:57,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,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 17 treesize of output 13 [2021-06-05 14:19:57,611 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:57,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:19:57,616 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:57,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,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 17 treesize of output 13 [2021-06-05 14:19:57,621 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:57,721 INFO L628 ElimStorePlain]: treesize reduction 168, result has 45.8 percent of original size [2021-06-05 14:19:57,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:19:57,725 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:57,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:57,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 14:19:57,767 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:57,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 15 [2021-06-05 14:19:57,771 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:57,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,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 27 treesize of output 21 [2021-06-05 14:19:57,775 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:57,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:57,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,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 12 treesize of output 8 [2021-06-05 14:19:57,838 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:57,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,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 10 treesize of output 6 [2021-06-05 14:19:57,844 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:57,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:57,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 11 treesize of output 7 [2021-06-05 14:19:57,849 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:19:57,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:57,889 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:19:57,889 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:344, output treesize:62 [2021-06-05 14:19:57,938 INFO L134 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:19:57,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691149841] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:57,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:19:57,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:19:57,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516223684] [2021-06-05 14:19:57,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:19:57,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:19:57,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:19:57,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:19:57,938 INFO L87 Difference]: Start difference. First operand 379 states and 1210 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:58,342 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2021-06-05 14:19:58,628 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 81 [2021-06-05 14:19:58,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:19:58,728 INFO L93 Difference]: Finished difference Result 442 states and 1378 transitions. [2021-06-05 14:19:58,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:19:58,728 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:19:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:19:58,729 INFO L225 Difference]: With dead ends: 442 [2021-06-05 14:19:58,729 INFO L226 Difference]: Without dead ends: 432 [2021-06-05 14:19:58,729 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1292.1ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:19:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-06-05 14:19:58,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 381. [2021-06-05 14:19:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.2) internal successors, (1216), 380 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:19:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1216 transitions. [2021-06-05 14:19:58,733 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 1216 transitions. Word has length 17 [2021-06-05 14:19:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:19:58,733 INFO L482 AbstractCegarLoop]: Abstraction has 381 states and 1216 transitions. [2021-06-05 14:19:58,733 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:19:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 1216 transitions. [2021-06-05 14:19:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:19:58,733 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:19:58,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:19:58,934 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 222 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2080 [2021-06-05 14:19:58,934 INFO L430 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:19:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:19:58,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1907866476, now seen corresponding path program 76 times [2021-06-05 14:19:58,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:19:58,934 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463039169] [2021-06-05 14:19:58,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:19:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:19:59,155 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2021-06-05 14:19:59,465 INFO L134 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:19:59,465 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:19:59,465 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463039169] [2021-06-05 14:19:59,465 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463039169] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:19:59,466 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003893212] [2021-06-05 14:19:59,466 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 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:19:59,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:19:59,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:19:59,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:19:59,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:19:59,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,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 25 treesize of output 19 [2021-06-05 14:19:59,664 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:59,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,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 35 treesize of output 27 [2021-06-05 14:19:59,669 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:59,724 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:59,728 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,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 25 treesize of output 19 [2021-06-05 14:19:59,730 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:59,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,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:19:59,735 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:59,787 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:19:59,791 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:19:59,791 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:180, output treesize:142 [2021-06-05 14:19:59,954 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_2]} [2021-06-05 14:19:59,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 14:19:59,959 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:59,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 14:19:59,964 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:59,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:19:59,969 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:59,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,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 27 treesize of output 21 [2021-06-05 14:19:59,974 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:59,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:19:59,978 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:59,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,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 27 treesize of output 21 [2021-06-05 14:19:59,983 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:59,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:19:59,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:19:59,988 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:19:59,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:19:59,992 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:00,128 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2021-06-05 14:20:00,128 INFO L628 ElimStorePlain]: treesize reduction 130, result has 57.0 percent of original size [2021-06-05 14:20:00,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:00,132 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:00,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 11 treesize of output 7 [2021-06-05 14:20:00,134 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:00,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:00,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:00,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 10 treesize of output 6 [2021-06-05 14:20:00,139 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:00,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:00,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:00,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 22 treesize of output 14 [2021-06-05 14:20:00,143 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:00,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:00,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 14:20:00,147 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:00,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:00,203 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:00,203 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:371, output treesize:103 [2021-06-05 14:20:00,320 INFO L134 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:20:00,320 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003893212] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:00,320 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:00,320 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:20:00,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667529440] [2021-06-05 14:20:00,321 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:20:00,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:00,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:20:00,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:20:00,321 INFO L87 Difference]: Start difference. First operand 381 states and 1216 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:00,909 INFO L93 Difference]: Finished difference Result 449 states and 1404 transitions. [2021-06-05 14:20:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:20:00,909 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:20:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:00,910 INFO L225 Difference]: With dead ends: 449 [2021-06-05 14:20:00,910 INFO L226 Difference]: Without dead ends: 438 [2021-06-05 14:20:00,910 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1027.9ms TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:20:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-06-05 14:20:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 382. [2021-06-05 14:20:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.202099737532808) internal successors, (1220), 381 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1220 transitions. [2021-06-05 14:20:00,919 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1220 transitions. Word has length 17 [2021-06-05 14:20:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:00,919 INFO L482 AbstractCegarLoop]: Abstraction has 382 states and 1220 transitions. [2021-06-05 14:20:00,919 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1220 transitions. [2021-06-05 14:20:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:00,920 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:00,920 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:20:01,120 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2093,223 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:20:01,121 INFO L430 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1365201684, now seen corresponding path program 77 times [2021-06-05 14:20:01,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:01,121 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925996986] [2021-06-05 14:20:01,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:01,426 INFO L134 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:20:01,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:01,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925996986] [2021-06-05 14:20:01,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925996986] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:01,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359804507] [2021-06-05 14:20:01,427 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 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:20:01,452 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:20:01,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:01,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:20:01,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:01,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:01,572 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:01,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 25 treesize of output 19 [2021-06-05 14:20:01,573 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:01,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:01,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 27 treesize of output 21 [2021-06-05 14:20:01,576 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:01,616 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:01,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:01,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:01,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 25 treesize of output 19 [2021-06-05 14:20:01,620 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:01,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:01,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:20:01,624 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:01,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:01,655 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:01,656 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:102 [2021-06-05 14:20:01,874 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_564, v_prenex_566, v_prenex_568], 1=[v_prenex_569, array_4, v_prenex_565, v_prenex_567]} [2021-06-05 14:20:01,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 19 treesize of output 15 [2021-06-05 14:20:01,880 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:01,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 17 treesize of output 13 [2021-06-05 14:20:01,885 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:02,150 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2021-06-05 14:20:02,150 INFO L628 ElimStorePlain]: treesize reduction 89, result has 60.8 percent of original size [2021-06-05 14:20:02,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 7 treesize of output 5 [2021-06-05 14:20:02,154 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:02,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:02,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 27 treesize of output 21 [2021-06-05 14:20:02,199 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:02,231 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:02,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 20 treesize of output 16 [2021-06-05 14:20:02,235 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:02,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:20:02,239 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:02,268 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:02,271 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:02,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:02,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 12 treesize of output 8 [2021-06-05 14:20:02,273 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:02,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:02,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:20:02,277 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:02,305 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:02,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:02,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 11 treesize of output 7 [2021-06-05 14:20:02,310 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:02,352 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:02,352 INFO L518 ElimStorePlain]: Eliminatee v_prenex_565 vanished before elimination [2021-06-05 14:20:02,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:02,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:20:02,358 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:02,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:02,396 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:02,396 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:241, output treesize:48 [2021-06-05 14:20:02,457 INFO L134 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:20:02,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359804507] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:02,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:02,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:20:02,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516781205] [2021-06-05 14:20:02,458 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:20:02,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:02,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:20:02,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:20:02,458 INFO L87 Difference]: Start difference. First operand 382 states and 1220 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:02,938 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2021-06-05 14:20:03,119 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2021-06-05 14:20:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:03,216 INFO L93 Difference]: Finished difference Result 444 states and 1386 transitions. [2021-06-05 14:20:03,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:20:03,216 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:20:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:03,217 INFO L225 Difference]: With dead ends: 444 [2021-06-05 14:20:03,217 INFO L226 Difference]: Without dead ends: 434 [2021-06-05 14:20:03,217 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 908.2ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:20:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-06-05 14:20:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 384. [2021-06-05 14:20:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.2010443864229763) internal successors, (1226), 383 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1226 transitions. [2021-06-05 14:20:03,221 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1226 transitions. Word has length 17 [2021-06-05 14:20:03,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:03,221 INFO L482 AbstractCegarLoop]: Abstraction has 384 states and 1226 transitions. [2021-06-05 14:20:03,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1226 transitions. [2021-06-05 14:20:03,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:03,222 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:03,222 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:20:03,422 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2121,224 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:20:03,423 INFO L430 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:03,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:03,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1022618172, now seen corresponding path program 78 times [2021-06-05 14:20:03,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:03,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040434164] [2021-06-05 14:20:03,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:03,686 INFO L134 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:20:03,686 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:03,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040434164] [2021-06-05 14:20:03,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040434164] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:03,686 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656909791] [2021-06-05 14:20:03,686 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 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:20:03,720 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 14:20:03,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:03,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:20:03,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:03,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:03,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:03,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 35 treesize of output 27 [2021-06-05 14:20:03,847 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:03,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:03,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:03,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:03,852 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:03,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:03,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:03,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:03,856 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:03,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:03,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:20:03,860 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:03,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:03,919 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:03,919 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:205, output treesize:171 [2021-06-05 14:20:04,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:04,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2021-06-05 14:20:04,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:04,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 29 treesize of output 23 [2021-06-05 14:20:04,130 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:04,285 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2021-06-05 14:20:04,286 INFO L628 ElimStorePlain]: treesize reduction 159, result has 55.3 percent of original size [2021-06-05 14:20:04,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:04,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:04,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 14:20:04,291 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:04,295 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:04,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 11 treesize of output 7 [2021-06-05 14:20:04,297 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:04,366 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:04,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:20:04,371 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:04,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:04,435 INFO L518 ElimStorePlain]: Eliminatee v_prenex_574 vanished before elimination [2021-06-05 14:20:04,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 27 treesize of output 21 [2021-06-05 14:20:04,439 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:04,505 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:04,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:04,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 22 treesize of output 14 [2021-06-05 14:20:04,510 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:04,569 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:04,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 27 treesize of output 21 [2021-06-05 14:20:04,573 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:04,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:04,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:04,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 10 treesize of output 6 [2021-06-05 14:20:04,636 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:04,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:04,697 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:04,697 INFO L247 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:379, output treesize:101 [2021-06-05 14:20:04,823 INFO L134 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:20:04,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656909791] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:04,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:04,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:20:04,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538051045] [2021-06-05 14:20:04,823 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:20:04,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:04,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:20:04,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:20:04,824 INFO L87 Difference]: Start difference. First operand 384 states and 1226 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:05,258 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2021-06-05 14:20:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:05,501 INFO L93 Difference]: Finished difference Result 442 states and 1380 transitions. [2021-06-05 14:20:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:20:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:20:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:05,502 INFO L225 Difference]: With dead ends: 442 [2021-06-05 14:20:05,502 INFO L226 Difference]: Without dead ends: 431 [2021-06-05 14:20:05,502 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 819.0ms TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:20:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-06-05 14:20:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 382. [2021-06-05 14:20:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 381 states have (on average 3.202099737532808) internal successors, (1220), 381 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 1220 transitions. [2021-06-05 14:20:05,508 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 1220 transitions. Word has length 17 [2021-06-05 14:20:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:05,508 INFO L482 AbstractCegarLoop]: Abstraction has 382 states and 1220 transitions. [2021-06-05 14:20:05,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 1220 transitions. [2021-06-05 14:20:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:05,509 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:05,509 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:20:05,729 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 225 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2146 [2021-06-05 14:20:05,729 INFO L430 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1599914564, now seen corresponding path program 79 times [2021-06-05 14:20:05,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:05,729 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090533464] [2021-06-05 14:20:05,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:06,089 INFO L134 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:20:06,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:06,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090533464] [2021-06-05 14:20:06,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090533464] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:06,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517992059] [2021-06-05 14:20:06,089 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 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:20:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:06,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:20:06,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:06,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:06,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:06,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 25 treesize of output 19 [2021-06-05 14:20:06,252 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:06,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:06,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:06,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:20:06,256 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:06,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:06,260 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:06,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:20:06,261 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:06,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:06,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:06,266 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:06,329 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:06,334 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:06,334 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:193, output treesize:162 [2021-06-05 14:20:06,929 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_590, v_prenex_592, v_prenex_594, v_prenex_586, v_prenex_588], 1=[v_prenex_591, v_prenex_593, array_4, v_prenex_595, v_prenex_587, v_prenex_589]} [2021-06-05 14:20:06,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 27 treesize of output 21 [2021-06-05 14:20:06,938 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:06,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 25 treesize of output 19 [2021-06-05 14:20:06,947 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:07,166 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 93 [2021-06-05 14:20:07,174 INFO L628 ElimStorePlain]: treesize reduction 202, result has 52.5 percent of original size [2021-06-05 14:20:07,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 7 treesize of output 5 [2021-06-05 14:20:07,181 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:07,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:07,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:20:07,261 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:07,332 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:07,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 27 treesize of output 21 [2021-06-05 14:20:07,339 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:07,421 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:07,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 14:20:07,428 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:07,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2021-06-05 14:20:07,434 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:07,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:07,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:20:07,511 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:07,578 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:07,578 INFO L518 ElimStorePlain]: Eliminatee v_prenex_591 vanished before elimination [2021-06-05 14:20:07,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:07,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:20:07,583 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:07,863 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-06-05 14:20:07,863 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:07,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:07,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 11 treesize of output 7 [2021-06-05 14:20:07,870 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:07,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:07,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:07,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:20:07,934 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:07,991 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:07,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:07,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:07,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 12 treesize of output 8 [2021-06-05 14:20:08,001 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:08,006 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:08,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 10 treesize of output 6 [2021-06-05 14:20:08,008 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:08,065 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:08,065 INFO L518 ElimStorePlain]: Eliminatee v_prenex_589 vanished before elimination [2021-06-05 14:20:08,069 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 12 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:20:08,069 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 18 variables, input treesize:443, output treesize:71 [2021-06-05 14:20:08,155 INFO L134 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:20:08,155 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517992059] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:08,155 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:08,155 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:20:08,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958961132] [2021-06-05 14:20:08,155 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:20:08,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:08,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:20:08,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:20:08,156 INFO L87 Difference]: Start difference. First operand 382 states and 1220 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:08,756 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2021-06-05 14:20:09,114 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 91 [2021-06-05 14:20:09,789 WARN L205 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 146 [2021-06-05 14:20:10,147 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 107 [2021-06-05 14:20:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:10,258 INFO L93 Difference]: Finished difference Result 543 states and 1673 transitions. [2021-06-05 14:20:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:20:10,259 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:20:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:10,259 INFO L225 Difference]: With dead ends: 543 [2021-06-05 14:20:10,260 INFO L226 Difference]: Without dead ends: 527 [2021-06-05 14:20:10,260 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2243.6ms TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:20:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-06-05 14:20:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 426. [2021-06-05 14:20:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.284705882352941) internal successors, (1396), 425 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:20:10,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1396 transitions. [2021-06-05 14:20:10,266 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1396 transitions. Word has length 17 [2021-06-05 14:20:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:10,266 INFO L482 AbstractCegarLoop]: Abstraction has 426 states and 1396 transitions. [2021-06-05 14:20:10,266 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1396 transitions. [2021-06-05 14:20:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:10,267 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:10,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:20:10,470 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 226 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2181 [2021-06-05 14:20:10,470 INFO L430 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:10,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:10,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1275471968, now seen corresponding path program 80 times [2021-06-05 14:20:10,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:10,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040315984] [2021-06-05 14:20:10,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:10,836 INFO L134 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:20:10,836 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:10,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040315984] [2021-06-05 14:20:10,836 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040315984] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:10,837 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177799517] [2021-06-05 14:20:10,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 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:20:10,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:20:10,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:10,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:20:10,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:10,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:10,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:10,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:10,956 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:10,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:10,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:10,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 25 treesize of output 19 [2021-06-05 14:20:10,961 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:10,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:10,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:10,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 35 treesize of output 27 [2021-06-05 14:20:10,966 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:10,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:10,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:20:10,970 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:11,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:11,021 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:11,022 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:142 [2021-06-05 14:20:11,245 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_596], 1=[array_4, v_prenex_597]} [2021-06-05 14:20:11,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:20:11,251 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:11,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 28 treesize of output 22 [2021-06-05 14:20:11,257 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:11,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:11,262 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:11,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:11,267 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:11,422 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2021-06-05 14:20:11,422 INFO L628 ElimStorePlain]: treesize reduction 149, result has 56.3 percent of original size [2021-06-05 14:20:11,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:20:11,438 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:11,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 27 treesize of output 21 [2021-06-05 14:20:11,443 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:11,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 38 treesize of output 30 [2021-06-05 14:20:11,447 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:11,545 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:11,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:11,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:20:11,589 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:11,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:11,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:11,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:11,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:20:11,657 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:11,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:11,661 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:11,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 24 treesize of output 16 [2021-06-05 14:20:11,663 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:11,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:11,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 22 treesize of output 14 [2021-06-05 14:20:11,668 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:11,730 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:11,732 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:11,732 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:379, output treesize:127 [2021-06-05 14:20:11,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:20:11,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177799517] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:11,915 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:11,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:20:11,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387810892] [2021-06-05 14:20:11,916 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:20:11,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:11,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:20:11,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:20:11,916 INFO L87 Difference]: Start difference. First operand 426 states and 1396 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:12,420 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2021-06-05 14:20:12,755 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2021-06-05 14:20:13,092 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2021-06-05 14:20:13,388 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2021-06-05 14:20:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:13,529 INFO L93 Difference]: Finished difference Result 523 states and 1617 transitions. [2021-06-05 14:20:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:20:13,530 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:20:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:13,531 INFO L225 Difference]: With dead ends: 523 [2021-06-05 14:20:13,531 INFO L226 Difference]: Without dead ends: 509 [2021-06-05 14:20:13,531 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1816.3ms TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:20:13,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-06-05 14:20:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 423. [2021-06-05 14:20:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.286729857819905) internal successors, (1387), 422 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1387 transitions. [2021-06-05 14:20:13,537 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1387 transitions. Word has length 17 [2021-06-05 14:20:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:13,537 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 1387 transitions. [2021-06-05 14:20:13,538 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1387 transitions. [2021-06-05 14:20:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:13,538 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:13,538 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:20:13,761 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 227 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2212 [2021-06-05 14:20:13,761 INFO L430 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash -324965886, now seen corresponding path program 81 times [2021-06-05 14:20:13,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:13,761 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594882245] [2021-06-05 14:20:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:14,317 INFO L134 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:20:14,317 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:14,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594882245] [2021-06-05 14:20:14,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594882245] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:14,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541348035] [2021-06-05 14:20:14,318 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 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:20:14,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:20:14,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:14,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:20:14,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:14,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:14,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:14,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:14,506 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:14,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:14,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:14,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:20:14,511 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:14,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:14,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:14,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 25 treesize of output 19 [2021-06-05 14:20:14,517 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:14,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:14,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 15 treesize of output 11 [2021-06-05 14:20:14,522 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:14,690 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-06-05 14:20:14,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:14,692 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:14,692 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:217, output treesize:186 [2021-06-05 14:20:15,332 WARN L205 SmtUtils]: Spent 467.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-06-05 14:20:15,369 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_602, array_0, v_prenex_598, v_prenex_600], 1=[v_prenex_603, array_4, v_prenex_599, v_prenex_601]} [2021-06-05 14:20:15,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 25 treesize of output 19 [2021-06-05 14:20:15,377 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:15,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:20:15,383 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:15,665 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2021-06-05 14:20:15,665 INFO L628 ElimStorePlain]: treesize reduction 171, result has 57.4 percent of original size [2021-06-05 14:20:15,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:20:15,669 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:15,803 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2021-06-05 14:20:15,804 INFO L628 ElimStorePlain]: treesize reduction 10, result has 95.6 percent of original size [2021-06-05 14:20:15,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 27 treesize of output 21 [2021-06-05 14:20:15,808 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:15,881 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:15,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 14:20:15,886 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:15,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 28 treesize of output 22 [2021-06-05 14:20:15,890 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:15,957 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:15,957 INFO L518 ElimStorePlain]: Eliminatee v_prenex_603 vanished before elimination [2021-06-05 14:20:15,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:15,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 22 treesize of output 14 [2021-06-05 14:20:15,962 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:16,029 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:16,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:16,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 11 treesize of output 7 [2021-06-05 14:20:16,034 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:16,100 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:16,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:16,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:16,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 21 treesize of output 13 [2021-06-05 14:20:16,106 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:16,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:16,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 12 treesize of output 8 [2021-06-05 14:20:16,112 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:16,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:16,175 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:16,175 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:419, output treesize:146 [2021-06-05 14:20:16,722 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2021-06-05 14:20:16,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:20:16,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541348035] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:16,729 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:16,729 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:20:16,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362564217] [2021-06-05 14:20:16,729 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:20:16,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:16,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:20:16,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:20:16,730 INFO L87 Difference]: Start difference. First operand 423 states and 1387 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:17,373 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2021-06-05 14:20:17,781 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2021-06-05 14:20:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:17,894 INFO L93 Difference]: Finished difference Result 491 states and 1563 transitions. [2021-06-05 14:20:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:20:17,894 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:20:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:17,895 INFO L225 Difference]: With dead ends: 491 [2021-06-05 14:20:17,895 INFO L226 Difference]: Without dead ends: 481 [2021-06-05 14:20:17,895 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2511.2ms TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:20:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-06-05 14:20:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 425. [2021-06-05 14:20:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 3.285377358490566) internal successors, (1393), 424 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1393 transitions. [2021-06-05 14:20:17,901 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1393 transitions. Word has length 17 [2021-06-05 14:20:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:17,901 INFO L482 AbstractCegarLoop]: Abstraction has 425 states and 1393 transitions. [2021-06-05 14:20:17,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1393 transitions. [2021-06-05 14:20:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:17,902 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:17,902 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:20:18,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2226,228 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:20:18,117 INFO L430 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:18,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:18,117 INFO L82 PathProgramCache]: Analyzing trace with hash 17617626, now seen corresponding path program 82 times [2021-06-05 14:20:18,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:18,117 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113472763] [2021-06-05 14:20:18,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:18,448 INFO L134 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:20:18,448 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:18,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113472763] [2021-06-05 14:20:18,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113472763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:18,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641893336] [2021-06-05 14:20:18,449 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 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:20:18,488 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:20:18,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:18,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:20:18,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:18,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:18,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:18,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 27 treesize of output 21 [2021-06-05 14:20:18,659 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:18,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:18,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:18,670 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:18,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:18,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:18,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:18,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:18,709 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:18,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:18,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:20:18,713 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:18,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:18,745 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:18,745 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:109 [2021-06-05 14:20:18,866 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_608, v_prenex_610, v_prenex_612], 1=[v_prenex_613, array_2, v_prenex_609, v_prenex_611]} [2021-06-05 14:20:18,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 27 treesize of output 21 [2021-06-05 14:20:18,873 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:18,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 25 treesize of output 19 [2021-06-05 14:20:18,879 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:18,970 INFO L628 ElimStorePlain]: treesize reduction 89, result has 63.4 percent of original size [2021-06-05 14:20:18,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 31 treesize of output 25 [2021-06-05 14:20:18,975 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:18,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 29 treesize of output 23 [2021-06-05 14:20:18,979 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:19,012 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:19,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:20:19,016 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:19,048 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:19,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 19 treesize of output 15 [2021-06-05 14:20:19,052 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:19,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:19,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:19,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:20:19,087 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:19,117 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:19,120 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:19,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:20:19,121 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:19,150 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:19,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:19,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:19,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 11 treesize of output 7 [2021-06-05 14:20:19,155 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:19,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:19,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 25 treesize of output 17 [2021-06-05 14:20:19,159 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:19,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:19,191 INFO L518 ElimStorePlain]: Eliminatee v_prenex_611 vanished before elimination [2021-06-05 14:20:19,210 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:19,210 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:255, output treesize:48 [2021-06-05 14:20:19,285 INFO L134 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:20:19,285 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641893336] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:19,285 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:19,285 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:20:19,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216040906] [2021-06-05 14:20:19,285 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:20:19,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:19,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:20:19,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:20:19,286 INFO L87 Difference]: Start difference. First operand 425 states and 1393 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:19,991 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2021-06-05 14:20:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:20,179 INFO L93 Difference]: Finished difference Result 489 states and 1557 transitions. [2021-06-05 14:20:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:20:20,179 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:20:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:20,180 INFO L225 Difference]: With dead ends: 489 [2021-06-05 14:20:20,180 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 14:20:20,180 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1013.8ms TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:20:20,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 14:20:20,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 422. [2021-06-05 14:20:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.28978622327791) internal successors, (1385), 421 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:20:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1385 transitions. [2021-06-05 14:20:20,185 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1385 transitions. Word has length 17 [2021-06-05 14:20:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:20,185 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1385 transitions. [2021-06-05 14:20:20,185 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1385 transitions. [2021-06-05 14:20:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:20,185 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:20,185 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:20:20,386 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2241,229 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:20:20,386 INFO L430 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:20,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:20,386 INFO L82 PathProgramCache]: Analyzing trace with hash -574938828, now seen corresponding path program 83 times [2021-06-05 14:20:20,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:20,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60695384] [2021-06-05 14:20:20,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:20:20,760 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:20,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60695384] [2021-06-05 14:20:20,761 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60695384] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:20,761 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357739844] [2021-06-05 14:20:20,761 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 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:20:20,787 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:20:20,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:20,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:20:20,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:20,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 25 treesize of output 19 [2021-06-05 14:20:20,878 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:20,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 27 treesize of output 21 [2021-06-05 14:20:20,881 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:20,908 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:20,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 15 treesize of output 11 [2021-06-05 14:20:20,912 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:20,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:20,914 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:20,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:20,950 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:20,950 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:95 [2021-06-05 14:20:21,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:21,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:21,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:21,123 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:21,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:21,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:20:21,128 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:21,191 INFO L628 ElimStorePlain]: treesize reduction 113, result has 45.9 percent of original size [2021-06-05 14:20:21,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:21,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 11 treesize of output 7 [2021-06-05 14:20:21,196 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:21,221 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:21,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:21,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 19 treesize of output 15 [2021-06-05 14:20:21,224 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:21,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:21,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:21,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 27 treesize of output 21 [2021-06-05 14:20:21,273 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:21,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:21,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:21,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 21 treesize of output 13 [2021-06-05 14:20:21,302 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:21,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:21,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:21,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 12 treesize of output 8 [2021-06-05 14:20:21,329 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:21,350 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:21,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_621 vanished before elimination [2021-06-05 14:20:21,351 INFO L518 ElimStorePlain]: Eliminatee v_prenex_622 vanished before elimination [2021-06-05 14:20:21,353 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:21,353 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:231, output treesize:38 [2021-06-05 14:20:21,405 INFO L134 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:20:21,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357739844] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:21,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:21,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:20:21,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205514060] [2021-06-05 14:20:21,405 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:20:21,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:21,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:20:21,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:20:21,406 INFO L87 Difference]: Start difference. First operand 422 states and 1385 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:21,974 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2021-06-05 14:20:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:22,068 INFO L93 Difference]: Finished difference Result 491 states and 1567 transitions. [2021-06-05 14:20:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:20:22,068 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:20:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:22,069 INFO L225 Difference]: With dead ends: 491 [2021-06-05 14:20:22,069 INFO L226 Difference]: Without dead ends: 481 [2021-06-05 14:20:22,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 886.1ms TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:20:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-06-05 14:20:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 423. [2021-06-05 14:20:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 422 states have (on average 3.2914691943127963) internal successors, (1389), 422 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1389 transitions. [2021-06-05 14:20:22,074 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1389 transitions. Word has length 17 [2021-06-05 14:20:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:22,074 INFO L482 AbstractCegarLoop]: Abstraction has 423 states and 1389 transitions. [2021-06-05 14:20:22,074 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1389 transitions. [2021-06-05 14:20:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:22,074 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:22,074 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:20:22,275 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 230 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2266 [2021-06-05 14:20:22,275 INFO L430 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:22,275 INFO L82 PathProgramCache]: Analyzing trace with hash 906299042, now seen corresponding path program 84 times [2021-06-05 14:20:22,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:22,275 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900416293] [2021-06-05 14:20:22,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:22,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:20:22,437 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:22,437 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900416293] [2021-06-05 14:20:22,437 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900416293] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:22,437 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706098930] [2021-06-05 14:20:22,438 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:22,464 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:20:22,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:22,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:20:22,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:22,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:22,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:22,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 25 treesize of output 19 [2021-06-05 14:20:22,576 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:22,579 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:22,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:20:22,580 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:22,613 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:22,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:22,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:22,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:22,617 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:22,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:22,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 27 treesize of output 21 [2021-06-05 14:20:22,620 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:22,649 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:22,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:22,652 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:102 [2021-06-05 14:20:22,758 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_628, v_prenex_630, v_prenex_632], 1=[v_prenex_629, array_4, v_prenex_631, v_prenex_633]} [2021-06-05 14:20:22,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 18 treesize of output 14 [2021-06-05 14:20:22,763 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:22,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 20 treesize of output 16 [2021-06-05 14:20:22,768 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:22,833 INFO L628 ElimStorePlain]: treesize reduction 112, result has 45.9 percent of original size [2021-06-05 14:20:22,833 INFO L518 ElimStorePlain]: Eliminatee v_prenex_628 vanished before elimination [2021-06-05 14:20:22,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 27 treesize of output 21 [2021-06-05 14:20:22,836 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:22,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:22,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 19 treesize of output 15 [2021-06-05 14:20:22,861 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:22,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:22,882 INFO L518 ElimStorePlain]: Eliminatee v_prenex_629 vanished before elimination [2021-06-05 14:20:22,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20: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 10 treesize of output 6 [2021-06-05 14:20:22,886 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:22,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:22,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:22,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 14 [2021-06-05 14:20:22,909 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:22,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:22,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:22,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 11 treesize of output 7 [2021-06-05 14:20:22,932 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:22,950 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:22,951 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:22,951 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:221, output treesize:38 [2021-06-05 14:20:22,996 INFO L134 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:20:22,996 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706098930] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:22,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:22,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:20:22,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648533302] [2021-06-05 14:20:22,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:20:22,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:22,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:20:22,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:20:22,997 INFO L87 Difference]: Start difference. First operand 423 states and 1389 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:23,580 INFO L93 Difference]: Finished difference Result 489 states and 1563 transitions. [2021-06-05 14:20:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:20:23,592 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:20:23,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:23,594 INFO L225 Difference]: With dead ends: 489 [2021-06-05 14:20:23,594 INFO L226 Difference]: Without dead ends: 479 [2021-06-05 14:20:23,594 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 576.7ms TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:20:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-06-05 14:20:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 422. [2021-06-05 14:20:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.28978622327791) internal successors, (1385), 421 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:20:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1385 transitions. [2021-06-05 14:20:23,600 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1385 transitions. Word has length 17 [2021-06-05 14:20:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:23,601 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1385 transitions. [2021-06-05 14:20:23,601 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1385 transitions. [2021-06-05 14:20:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:23,602 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:23,602 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:20:23,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 231 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2308 [2021-06-05 14:20:23,809 INFO L430 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:23,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1455215452, now seen corresponding path program 85 times [2021-06-05 14:20:23,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:23,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023471184] [2021-06-05 14:20:23,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:24,329 INFO L134 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:20:24,329 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:24,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023471184] [2021-06-05 14:20:24,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023471184] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:24,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517565772] [2021-06-05 14:20:24,329 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 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:20:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:24,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:20:24,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:24,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:24,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 25 treesize of output 19 [2021-06-05 14:20:24,453 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:24,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:24,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 25 treesize of output 19 [2021-06-05 14:20:24,457 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:24,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:24,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:20:24,461 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:24,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:20:24,465 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:24,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:24,518 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:24,518 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:163 [2021-06-05 14:20:24,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:24,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:24,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 25 treesize of output 19 [2021-06-05 14:20:24,815 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:24,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:24,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 25 treesize of output 19 [2021-06-05 14:20:24,820 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:24,948 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2021-06-05 14:20:24,948 INFO L628 ElimStorePlain]: treesize reduction 161, result has 49.4 percent of original size [2021-06-05 14:20:24,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:24,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:20:24,955 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:24,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:24,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:24,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 10 treesize of output 6 [2021-06-05 14:20:25,000 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:25,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:25,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:25,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:25,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-06-05 14:20:25,046 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:25,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:25,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 15 [2021-06-05 14:20:25,050 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:25,089 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:25,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:25,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:25,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:20:25,105 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:25,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:25,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2021-06-05 14:20:25,110 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:25,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:25,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:25,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:20:25,150 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:25,184 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:25,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:25,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 22 treesize of output 14 [2021-06-05 14:20:25,188 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:25,220 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:25,220 INFO L518 ElimStorePlain]: Eliminatee v_prenex_634 vanished before elimination [2021-06-05 14:20:25,222 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:20:25,222 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:336, output treesize:67 [2021-06-05 14:20:25,274 INFO L134 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:20:25,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517565772] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:25,274 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:25,274 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:20:25,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154735969] [2021-06-05 14:20:25,274 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:20:25,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:25,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:20:25,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:20:25,275 INFO L87 Difference]: Start difference. First operand 422 states and 1385 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:25,685 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2021-06-05 14:20:25,979 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2021-06-05 14:20:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:26,075 INFO L93 Difference]: Finished difference Result 488 states and 1561 transitions. [2021-06-05 14:20:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:20:26,076 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:20:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:26,077 INFO L225 Difference]: With dead ends: 488 [2021-06-05 14:20:26,077 INFO L226 Difference]: Without dead ends: 478 [2021-06-05 14:20:26,077 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1249.2ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:20:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-06-05 14:20:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 424. [2021-06-05 14:20:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 3.2884160756501184) internal successors, (1391), 423 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1391 transitions. [2021-06-05 14:20:26,081 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1391 transitions. Word has length 17 [2021-06-05 14:20:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:26,081 INFO L482 AbstractCegarLoop]: Abstraction has 424 states and 1391 transitions. [2021-06-05 14:20:26,081 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1391 transitions. [2021-06-05 14:20:26,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:26,082 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:26,082 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:20:26,282 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2338,232 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:20:26,282 INFO L430 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash 640409298, now seen corresponding path program 86 times [2021-06-05 14:20:26,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:26,283 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583338999] [2021-06-05 14:20:26,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:26,522 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2021-06-05 14:20:26,778 INFO L134 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:20:26,778 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:26,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583338999] [2021-06-05 14:20:26,779 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583338999] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:26,779 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027086263] [2021-06-05 14:20:26,779 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 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:20:26,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:20:26,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:26,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:20:26,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:26,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:26,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:26,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 25 treesize of output 19 [2021-06-05 14:20:26,917 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:26,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:26,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 15 treesize of output 11 [2021-06-05 14:20:26,920 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:26,954 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:26,957 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:26,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:26,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:26,959 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:26,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:26,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 27 treesize of output 21 [2021-06-05 14:20:26,962 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:26,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:26,994 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:26,995 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:103 [2021-06-05 14:20:27,100 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_647, array_0, v_prenex_649, v_prenex_651], 1=[v_prenex_648, array_2, v_prenex_650, v_prenex_652]} [2021-06-05 14:20:27,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 17 treesize of output 13 [2021-06-05 14:20:27,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:27,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 19 treesize of output 15 [2021-06-05 14:20:27,109 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:27,174 INFO L628 ElimStorePlain]: treesize reduction 113, result has 45.7 percent of original size [2021-06-05 14:20:27,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 27 treesize of output 21 [2021-06-05 14:20:27,178 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:27,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:27,200 INFO L518 ElimStorePlain]: Eliminatee v_prenex_649 vanished before elimination [2021-06-05 14:20:27,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 19 treesize of output 15 [2021-06-05 14:20:27,203 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:27,223 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:27,226 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:27,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 10 treesize of output 6 [2021-06-05 14:20:27,228 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:27,248 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:27,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:27,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:20:27,251 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:27,270 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:27,270 INFO L518 ElimStorePlain]: Eliminatee v_prenex_650 vanished before elimination [2021-06-05 14:20:27,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:27,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:20:27,274 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:27,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:27,299 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:27,299 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:223, output treesize:38 [2021-06-05 14:20:27,338 INFO L134 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:20:27,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027086263] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:27,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:27,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:20:27,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679399605] [2021-06-05 14:20:27,338 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:20:27,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:27,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:20:27,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:20:27,338 INFO L87 Difference]: Start difference. First operand 424 states and 1391 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:27,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:27,812 INFO L93 Difference]: Finished difference Result 485 states and 1553 transitions. [2021-06-05 14:20:27,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:20:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:20:27,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:27,813 INFO L225 Difference]: With dead ends: 485 [2021-06-05 14:20:27,813 INFO L226 Difference]: Without dead ends: 474 [2021-06-05 14:20:27,814 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 777.0ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:20:27,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-06-05 14:20:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 422. [2021-06-05 14:20:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.28978622327791) internal successors, (1385), 421 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:20:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1385 transitions. [2021-06-05 14:20:27,818 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1385 transitions. Word has length 17 [2021-06-05 14:20:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:27,818 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1385 transitions. [2021-06-05 14:20:27,818 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1385 transitions. [2021-06-05 14:20:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:27,819 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:27,819 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:20:28,019 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2383,233 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:20:28,019 INFO L430 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:28,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1662308434, now seen corresponding path program 87 times [2021-06-05 14:20:28,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:28,020 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735031961] [2021-06-05 14:20:28,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:28,323 INFO L134 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:20:28,323 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:28,323 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735031961] [2021-06-05 14:20:28,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735031961] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:28,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963167259] [2021-06-05 14:20:28,324 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 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:20:28,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:20:28,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:28,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 14:20:28,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:28,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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:20:28,501 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:20:28,506 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:28,510 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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 25 treesize of output 19 [2021-06-05 14:20:28,515 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,593 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:28,595 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:28,595 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:245, output treesize:210 [2021-06-05 14:20:28,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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 25 treesize of output 19 [2021-06-05 14:20:28,734 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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 15 treesize of output 11 [2021-06-05 14:20:28,738 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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 28 treesize of output 22 [2021-06-05 14:20:28,743 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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 17 treesize of output 13 [2021-06-05 14:20:28,747 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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 38 treesize of output 30 [2021-06-05 14:20:28,752 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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 27 treesize of output 21 [2021-06-05 14:20:28,757 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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 25 treesize of output 19 [2021-06-05 14:20:28,761 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:20:28,766 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,968 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2021-06-05 14:20:28,968 INFO L628 ElimStorePlain]: treesize reduction 185, result has 57.6 percent of original size [2021-06-05 14:20:28,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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 11 treesize of output 7 [2021-06-05 14:20:28,974 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:28,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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 10 treesize of output 6 [2021-06-05 14:20:28,979 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:28,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,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 24 treesize of output 16 [2021-06-05 14:20:28,983 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:28,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:28,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:20:28,987 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:29,072 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:29,074 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:29,074 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:507, output treesize:212 [2021-06-05 14:20:29,357 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-06-05 14:20:29,474 INFO L134 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:20:29,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963167259] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:29,475 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:29,475 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-06-05 14:20:29,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128443223] [2021-06-05 14:20:29,475 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:20:29,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:29,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:20:29,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:20:29,475 INFO L87 Difference]: Start difference. First operand 422 states and 1385 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:29,838 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2021-06-05 14:20:30,082 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2021-06-05 14:20:30,405 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2021-06-05 14:20:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:30,602 INFO L93 Difference]: Finished difference Result 504 states and 1582 transitions. [2021-06-05 14:20:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:20:30,603 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:20:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:30,603 INFO L225 Difference]: With dead ends: 504 [2021-06-05 14:20:30,603 INFO L226 Difference]: Without dead ends: 484 [2021-06-05 14:20:30,604 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1614.6ms TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:20:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2021-06-05 14:20:30,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 422. [2021-06-05 14:20:30,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.2921615201900236) internal successors, (1386), 421 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1386 transitions. [2021-06-05 14:20:30,608 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1386 transitions. Word has length 17 [2021-06-05 14:20:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:30,608 INFO L482 AbstractCegarLoop]: Abstraction has 422 states and 1386 transitions. [2021-06-05 14:20:30,608 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1386 transitions. [2021-06-05 14:20:30,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:30,609 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:30,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:20:30,809 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2413,234 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:20:30,809 INFO L430 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2004891946, now seen corresponding path program 88 times [2021-06-05 14:20:30,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:30,810 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446573360] [2021-06-05 14:20:30,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:31,077 INFO L134 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:20:31,077 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:31,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446573360] [2021-06-05 14:20:31,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446573360] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:31,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794288827] [2021-06-05 14:20:31,077 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 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:20:31,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:20:31,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:31,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:20:31,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:31,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:31,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:31,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:31,248 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:31,251 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:31,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:20:31,252 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:31,296 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:31,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:31,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:31,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:20:31,301 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:31,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:31,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 25 treesize of output 19 [2021-06-05 14:20:31,306 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:31,341 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:31,344 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:31,345 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:103 [2021-06-05 14:20:31,476 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_657, v_prenex_659, array_0, v_prenex_661], 1=[v_prenex_658, array_2, v_prenex_660, v_prenex_662]} [2021-06-05 14:20:31,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:20:31,482 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:31,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 19 treesize of output 15 [2021-06-05 14:20:31,488 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:31,607 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-06-05 14:20:31,608 INFO L628 ElimStorePlain]: treesize reduction 89, result has 61.1 percent of original size [2021-06-05 14:20:31,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 19 treesize of output 15 [2021-06-05 14:20:31,614 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:31,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 21 treesize of output 17 [2021-06-05 14:20:31,629 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:31,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:31,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:20:31,702 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:31,740 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:31,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 27 treesize of output 21 [2021-06-05 14:20:31,744 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:31,781 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:31,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:31,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:20:31,787 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:31,822 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:31,822 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:20:31,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:31,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:31,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 12 treesize of output 8 [2021-06-05 14:20:31,828 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:31,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:31,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 12 treesize of output 8 [2021-06-05 14:20:31,833 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:31,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:31,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:31,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 21 treesize of output 13 [2021-06-05 14:20:31,873 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:31,905 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:31,908 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:31,908 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:243, output treesize:48 [2021-06-05 14:20:31,974 INFO L134 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:20:31,974 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794288827] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:31,974 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:31,974 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:20:31,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930357424] [2021-06-05 14:20:31,974 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:20:31,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:31,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:20:31,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:20:31,975 INFO L87 Difference]: Start difference. First operand 422 states and 1386 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:32,593 INFO L93 Difference]: Finished difference Result 484 states and 1551 transitions. [2021-06-05 14:20:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:20:32,594 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:20:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:32,595 INFO L225 Difference]: With dead ends: 484 [2021-06-05 14:20:32,595 INFO L226 Difference]: Without dead ends: 473 [2021-06-05 14:20:32,595 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 754.9ms TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:20:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2021-06-05 14:20:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 421. [2021-06-05 14:20:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.295238095238095) internal successors, (1384), 420 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:32,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1384 transitions. [2021-06-05 14:20:32,601 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1384 transitions. Word has length 17 [2021-06-05 14:20:32,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:32,601 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1384 transitions. [2021-06-05 14:20:32,601 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1384 transitions. [2021-06-05 14:20:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:32,602 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:32,602 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:20:32,802 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 235 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2432 [2021-06-05 14:20:32,802 INFO L430 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:32,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash 569417172, now seen corresponding path program 89 times [2021-06-05 14:20:32,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:32,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654899316] [2021-06-05 14:20:32,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:33,240 INFO L134 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:20:33,240 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:33,240 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654899316] [2021-06-05 14:20:33,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654899316] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:33,240 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722978930] [2021-06-05 14:20:33,240 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 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:20:33,279 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:20:33,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:33,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:20:33,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:33,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 15 treesize of output 11 [2021-06-05 14:20:33,377 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:33,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 25 treesize of output 19 [2021-06-05 14:20:33,380 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:33,402 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:33,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 25 treesize of output 19 [2021-06-05 14:20:33,405 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:33,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 27 treesize of output 21 [2021-06-05 14:20:33,408 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:33,426 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:33,427 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:33,427 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:110, output treesize:76 [2021-06-05 14:20:33,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 17 treesize of output 13 [2021-06-05 14:20:33,490 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:33,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:20:33,493 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:33,530 INFO L628 ElimStorePlain]: treesize reduction 66, result has 52.9 percent of original size [2021-06-05 14:20:33,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 11 treesize of output 7 [2021-06-05 14:20:33,535 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:33,552 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:33,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 19 treesize of output 15 [2021-06-05 14:20:33,556 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:33,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:33,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 10 treesize of output 6 [2021-06-05 14:20:33,576 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:33,590 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:33,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 23 [2021-06-05 14:20:33,594 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:33,607 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:33,607 INFO L518 ElimStorePlain]: Eliminatee v_prenex_667 vanished before elimination [2021-06-05 14:20:33,608 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:33,608 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:154, output treesize:32 [2021-06-05 14:20:33,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:20:33,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722978930] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:33,650 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:33,650 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2021-06-05 14:20:33,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046740788] [2021-06-05 14:20:33,650 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:20:33,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:33,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:20:33,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:20:33,650 INFO L87 Difference]: Start difference. First operand 421 states and 1384 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:20:34,296 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2021-06-05 14:20:34,530 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2021-06-05 14:20:34,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:34,629 INFO L93 Difference]: Finished difference Result 506 states and 1606 transitions. [2021-06-05 14:20:34,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:20:34,629 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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 17 [2021-06-05 14:20:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:34,630 INFO L225 Difference]: With dead ends: 506 [2021-06-05 14:20:34,631 INFO L226 Difference]: Without dead ends: 494 [2021-06-05 14:20:34,631 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1157.7ms TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:20:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2021-06-05 14:20:34,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 421. [2021-06-05 14:20:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.288095238095238) internal successors, (1381), 420 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1381 transitions. [2021-06-05 14:20:34,637 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1381 transitions. Word has length 17 [2021-06-05 14:20:34,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:34,637 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1381 transitions. [2021-06-05 14:20:34,637 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:20:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1381 transitions. [2021-06-05 14:20:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:34,638 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:34,638 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:20:34,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2457,236 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:20:34,857 INFO L430 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:34,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:34,857 INFO L82 PathProgramCache]: Analyzing trace with hash -245388982, now seen corresponding path program 90 times [2021-06-05 14:20:34,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:34,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587261065] [2021-06-05 14:20:34,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:35,206 INFO L134 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:20:35,206 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:35,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587261065] [2021-06-05 14:20:35,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587261065] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:35,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441559936] [2021-06-05 14:20:35,207 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 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:20:35,240 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:20:35,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:35,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:20:35,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:35,406 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:35,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:35,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 25 treesize of output 19 [2021-06-05 14:20:35,408 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:35,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:35,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 27 treesize of output 21 [2021-06-05 14:20:35,412 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:35,454 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:35,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:35,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:35,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 25 treesize of output 19 [2021-06-05 14:20:35,460 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:35,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:35,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:20:35,465 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:35,502 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:35,505 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:35,506 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:109 [2021-06-05 14:20:35,662 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_672, v_prenex_674, v_prenex_676], 1=[array_2, v_prenex_673, v_prenex_675, v_prenex_677]} [2021-06-05 14:20:35,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 23 [2021-06-05 14:20:35,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:35,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2021-06-05 14:20:35,674 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:35,851 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2021-06-05 14:20:35,851 INFO L628 ElimStorePlain]: treesize reduction 112, result has 46.2 percent of original size [2021-06-05 14:20:35,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 19 treesize of output 15 [2021-06-05 14:20:35,856 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:35,881 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:35,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 27 treesize of output 21 [2021-06-05 14:20:35,890 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:35,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:35,915 INFO L518 ElimStorePlain]: Eliminatee v_prenex_676 vanished before elimination [2021-06-05 14:20:35,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:35,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 11 treesize of output 7 [2021-06-05 14:20:35,920 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:35,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:35,953 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:35,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:20:35,955 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:35,980 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:35,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:35,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 10 treesize of output 6 [2021-06-05 14:20:35,985 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:36,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:36,008 INFO L518 ElimStorePlain]: Eliminatee v_prenex_677 vanished before elimination [2021-06-05 14:20:36,010 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:36,010 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:235, output treesize:38 [2021-06-05 14:20:36,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:20:36,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441559936] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:36,060 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:36,060 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 14:20:36,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424384903] [2021-06-05 14:20:36,060 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:20:36,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:36,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:20:36,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:20:36,060 INFO L87 Difference]: Start difference. First operand 421 states and 1381 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:36,834 INFO L93 Difference]: Finished difference Result 500 states and 1587 transitions. [2021-06-05 14:20:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:20:36,835 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:20:36,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:36,836 INFO L225 Difference]: With dead ends: 500 [2021-06-05 14:20:36,836 INFO L226 Difference]: Without dead ends: 487 [2021-06-05 14:20:36,836 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 921.6ms TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:20:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2021-06-05 14:20:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 415. [2021-06-05 14:20:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 3.2777777777777777) internal successors, (1357), 414 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:36,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1357 transitions. [2021-06-05 14:20:36,842 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1357 transitions. Word has length 17 [2021-06-05 14:20:36,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:36,842 INFO L482 AbstractCegarLoop]: Abstraction has 415 states and 1357 transitions. [2021-06-05 14:20:36,842 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1357 transitions. [2021-06-05 14:20:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:36,843 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:36,843 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:20:37,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 237 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2466 [2021-06-05 14:20:37,061 INFO L430 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:37,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:37,061 INFO L82 PathProgramCache]: Analyzing trace with hash 344982116, now seen corresponding path program 91 times [2021-06-05 14:20:37,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:37,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107480386] [2021-06-05 14:20:37,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:37,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:20:37,353 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:37,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107480386] [2021-06-05 14:20:37,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107480386] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:37,354 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655717970] [2021-06-05 14:20:37,354 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 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:20:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:37,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:20:37,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:37,505 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,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 35 treesize of output 27 [2021-06-05 14:20:37,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:37,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,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 25 treesize of output 19 [2021-06-05 14:20:37,512 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:37,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:37,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,558 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:20:37,559 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:37,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:37,564 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:37,601 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:37,604 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:37,604 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:148, output treesize:110 [2021-06-05 14:20:37,824 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_2]} [2021-06-05 14:20:37,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,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 17 treesize of output 13 [2021-06-05 14:20:37,830 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:37,834 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,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 27 treesize of output 21 [2021-06-05 14:20:37,835 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:37,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:20:37,841 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:37,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 31 [2021-06-05 14:20:37,846 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:37,851 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:37,852 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:37,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,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 15 treesize of output 11 [2021-06-05 14:20:37,858 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:37,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:37,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 27 treesize of output 21 [2021-06-05 14:20:37,866 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:37,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 14:20:37,871 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:38,031 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2021-06-05 14:20:38,031 INFO L628 ElimStorePlain]: treesize reduction 132, result has 55.9 percent of original size [2021-06-05 14:20:38,035 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:38,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:38,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 11 treesize of output 7 [2021-06-05 14:20:38,037 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:38,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:38,042 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:38,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:20:38,044 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:38,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:38,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:38,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:20:38,050 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:38,054 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:38,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 14:20:38,055 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:38,117 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:38,120 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:38,120 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:371, output treesize:101 [2021-06-05 14:20:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:20:38,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655717970] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:38,278 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:38,278 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:20:38,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373368751] [2021-06-05 14:20:38,278 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:20:38,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:38,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:20:38,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:20:38,279 INFO L87 Difference]: Start difference. First operand 415 states and 1357 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:38,830 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2021-06-05 14:20:39,089 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2021-06-05 14:20:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:39,304 INFO L93 Difference]: Finished difference Result 553 states and 1747 transitions. [2021-06-05 14:20:39,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:20:39,304 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:20:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:39,305 INFO L225 Difference]: With dead ends: 553 [2021-06-05 14:20:39,305 INFO L226 Difference]: Without dead ends: 539 [2021-06-05 14:20:39,306 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1163.6ms TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:20:39,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-06-05 14:20:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 413. [2021-06-05 14:20:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.279126213592233) internal successors, (1351), 412 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1351 transitions. [2021-06-05 14:20:39,310 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1351 transitions. Word has length 17 [2021-06-05 14:20:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:39,311 INFO L482 AbstractCegarLoop]: Abstraction has 413 states and 1351 transitions. [2021-06-05 14:20:39,311 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1351 transitions. [2021-06-05 14:20:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:39,311 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:39,311 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:20:39,512 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 238 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2496 [2021-06-05 14:20:39,512 INFO L430 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:39,512 INFO L82 PathProgramCache]: Analyzing trace with hash -109288126, now seen corresponding path program 92 times [2021-06-05 14:20:39,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:39,512 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034747901] [2021-06-05 14:20:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:39,886 INFO L134 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:20:39,886 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:39,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034747901] [2021-06-05 14:20:39,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034747901] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:39,886 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581936699] [2021-06-05 14:20:39,886 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 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:20:39,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:20:39,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:39,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:20:39,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:40,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:40,069 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:40,074 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,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 15 treesize of output 11 [2021-06-05 14:20:40,080 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,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 35 treesize of output 27 [2021-06-05 14:20:40,085 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:40,146 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:40,146 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:158 [2021-06-05 14:20:40,261 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_682, v_prenex_684, v_prenex_686], 1=[array_4, v_prenex_683, v_prenex_685, v_prenex_687]} [2021-06-05 14:20:40,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:20:40,267 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:40,272 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,442 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2021-06-05 14:20:40,443 INFO L628 ElimStorePlain]: treesize reduction 144, result has 58.7 percent of original size [2021-06-05 14:20:40,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:20:40,448 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:40,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:20:40,520 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,585 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:40,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 38 treesize of output 30 [2021-06-05 14:20:40,591 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 14:20:40,595 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:40,655 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:20:40,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,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 11 treesize of output 7 [2021-06-05 14:20:40,661 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:40,721 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:40,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:20:40,725 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,782 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:40,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,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 25 treesize of output 17 [2021-06-05 14:20:40,788 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:40,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 14:20:40,792 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:40,855 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:40,857 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:40,857 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:363, output treesize:125 [2021-06-05 14:20:41,047 INFO L134 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:20:41,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581936699] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:41,048 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:41,048 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-06-05 14:20:41,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020899479] [2021-06-05 14:20:41,048 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:20:41,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:41,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:20:41,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:20:41,048 INFO L87 Difference]: Start difference. First operand 413 states and 1351 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:41,645 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2021-06-05 14:20:42,088 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2021-06-05 14:20:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:42,204 INFO L93 Difference]: Finished difference Result 502 states and 1603 transitions. [2021-06-05 14:20:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:20:42,204 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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 17 [2021-06-05 14:20:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:42,205 INFO L225 Difference]: With dead ends: 502 [2021-06-05 14:20:42,205 INFO L226 Difference]: Without dead ends: 492 [2021-06-05 14:20:42,206 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1484.4ms TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:20:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-06-05 14:20:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 417. [2021-06-05 14:20:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.2764423076923075) internal successors, (1363), 416 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1363 transitions. [2021-06-05 14:20:42,212 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1363 transitions. Word has length 17 [2021-06-05 14:20:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:42,212 INFO L482 AbstractCegarLoop]: Abstraction has 417 states and 1363 transitions. [2021-06-05 14:20:42,212 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:20:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1363 transitions. [2021-06-05 14:20:42,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:42,213 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:42,213 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:20:42,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 239 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2524 [2021-06-05 14:20:42,433 INFO L430 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:42,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash 233295386, now seen corresponding path program 93 times [2021-06-05 14:20:42,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:42,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385237377] [2021-06-05 14:20:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:20:42,715 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:42,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385237377] [2021-06-05 14:20:42,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385237377] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:42,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540790957] [2021-06-05 14:20:42,715 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 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:20:42,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 14:20:42,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:42,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:20:42,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:42,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:42,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:42,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 25 treesize of output 19 [2021-06-05 14:20:42,874 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:42,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:42,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:20:42,878 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:42,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:42,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:42,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:42,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 27 treesize of output 21 [2021-06-05 14:20:42,917 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:42,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:42,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 25 treesize of output 19 [2021-06-05 14:20:42,920 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:42,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:42,952 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:42,952 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:109 [2021-06-05 14:20:43,058 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_692, v_prenex_694, v_prenex_696], 1=[array_2, v_prenex_693, v_prenex_695, v_prenex_697]} [2021-06-05 14:20:43,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 25 treesize of output 19 [2021-06-05 14:20:43,063 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:43,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 15 treesize of output 11 [2021-06-05 14:20:43,068 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:43,155 INFO L628 ElimStorePlain]: treesize reduction 85, result has 64.1 percent of original size [2021-06-05 14:20:43,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 27 treesize of output 21 [2021-06-05 14:20:43,159 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:43,194 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:43,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 29 treesize of output 23 [2021-06-05 14:20:43,199 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:43,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 31 treesize of output 25 [2021-06-05 14:20:43,203 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:43,233 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:43,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:20:43,237 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:43,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:43,265 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:20:43,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:43,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 22 treesize of output 14 [2021-06-05 14:20:43,269 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:43,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:43,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:43,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:43,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:20:43,302 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:43,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:43,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 12 treesize of output 8 [2021-06-05 14:20:43,306 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:43,333 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:43,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:43,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:20:43,337 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:43,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:43,365 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:43,365 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:255, output treesize:48 [2021-06-05 14:20:43,469 INFO L134 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:20:43,469 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540790957] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:43,469 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:43,469 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:20:43,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204731419] [2021-06-05 14:20:43,469 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:20:43,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:43,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:20:43,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:20:43,470 INFO L87 Difference]: Start difference. First operand 417 states and 1363 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:44,129 INFO L93 Difference]: Finished difference Result 500 states and 1597 transitions. [2021-06-05 14:20:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:20:44,129 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:20:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:44,130 INFO L225 Difference]: With dead ends: 500 [2021-06-05 14:20:44,130 INFO L226 Difference]: Without dead ends: 489 [2021-06-05 14:20:44,130 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 765.9ms TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:20:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2021-06-05 14:20:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 415. [2021-06-05 14:20:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 3.2777777777777777) internal successors, (1357), 414 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1357 transitions. [2021-06-05 14:20:44,134 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1357 transitions. Word has length 17 [2021-06-05 14:20:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:44,134 INFO L482 AbstractCegarLoop]: Abstraction has 415 states and 1357 transitions. [2021-06-05 14:20:44,134 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1357 transitions. [2021-06-05 14:20:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:44,135 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:44,135 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:20:44,335 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 240 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2539 [2021-06-05 14:20:44,335 INFO L430 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:44,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:44,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1873488734, now seen corresponding path program 94 times [2021-06-05 14:20:44,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:44,336 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978780830] [2021-06-05 14:20:44,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:44,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:20:44,531 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:44,531 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978780830] [2021-06-05 14:20:44,531 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978780830] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:44,531 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530549344] [2021-06-05 14:20:44,531 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 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:20:44,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:20:44,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:44,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:20:44,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:44,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 25 treesize of output 19 [2021-06-05 14:20:44,646 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:44,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 27 treesize of output 21 [2021-06-05 14:20:44,650 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:44,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:44,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 25 treesize of output 19 [2021-06-05 14:20:44,690 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:44,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 15 treesize of output 11 [2021-06-05 14:20:44,693 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:44,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:44,720 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:44,720 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:131, output treesize:105 [2021-06-05 14:20:44,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:44,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:44,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 25 treesize of output 19 [2021-06-05 14:20:44,875 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:44,879 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:44,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:20:44,880 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:44,943 INFO L628 ElimStorePlain]: treesize reduction 119, result has 46.2 percent of original size [2021-06-05 14:20:44,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:44,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 11 treesize of output 7 [2021-06-05 14:20:44,948 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:44,971 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:44,974 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:44,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 23 [2021-06-05 14:20:44,975 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:44,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:44,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:44,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 27 treesize of output 21 [2021-06-05 14:20:45,003 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:45,023 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:45,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:45,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:20:45,027 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:45,046 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:45,046 INFO L518 ElimStorePlain]: Eliminatee v_prenex_706 vanished before elimination [2021-06-05 14:20:45,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:45,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 14:20:45,050 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:45,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:45,068 INFO L518 ElimStorePlain]: Eliminatee v_prenex_707 vanished before elimination [2021-06-05 14:20:45,070 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:45,070 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:243, output treesize:38 [2021-06-05 14:20:45,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:20:45,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530549344] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:45,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:45,110 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:20:45,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258456473] [2021-06-05 14:20:45,110 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:20:45,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:45,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:20:45,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:20:45,110 INFO L87 Difference]: Start difference. First operand 415 states and 1357 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:20:45,584 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2021-06-05 14:20:45,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:45,921 INFO L93 Difference]: Finished difference Result 547 states and 1730 transitions. [2021-06-05 14:20:45,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:20:45,922 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 17 [2021-06-05 14:20:45,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:45,923 INFO L225 Difference]: With dead ends: 547 [2021-06-05 14:20:45,923 INFO L226 Difference]: Without dead ends: 533 [2021-06-05 14:20:45,923 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 791.1ms TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:20:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2021-06-05 14:20:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 413. [2021-06-05 14:20:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.279126213592233) internal successors, (1351), 412 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1351 transitions. [2021-06-05 14:20:45,928 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1351 transitions. Word has length 17 [2021-06-05 14:20:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:45,928 INFO L482 AbstractCegarLoop]: Abstraction has 413 states and 1351 transitions. [2021-06-05 14:20:45,928 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:20:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1351 transitions. [2021-06-05 14:20:45,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:45,928 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:45,928 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:20:46,129 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 241 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2564 [2021-06-05 14:20:46,129 INFO L430 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash -684833076, now seen corresponding path program 95 times [2021-06-05 14:20:46,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:46,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346700712] [2021-06-05 14:20:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:46,642 INFO L134 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:20:46,642 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:46,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346700712] [2021-06-05 14:20:46,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346700712] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:46,642 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272988480] [2021-06-05 14:20:46,642 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 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:20:46,676 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:20:46,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:46,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:20:46,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:46,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:46,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:46,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:20:46,856 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:46,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:46,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 25 treesize of output 19 [2021-06-05 14:20:46,860 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:46,896 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:46,899 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:46,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:46,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 25 treesize of output 19 [2021-06-05 14:20:46,901 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:46,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:46,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 15 treesize of output 11 [2021-06-05 14:20:46,905 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:46,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:46,942 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:46,942 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:158, output treesize:127 [2021-06-05 14:20:47,155 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 14:20:47,161 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:20:47,162 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:47,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,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 25 treesize of output 19 [2021-06-05 14:20:47,167 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:47,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,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 35 treesize of output 27 [2021-06-05 14:20:47,173 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:47,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:47,178 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:47,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,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 25 treesize of output 19 [2021-06-05 14:20:47,183 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:47,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,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 38 treesize of output 30 [2021-06-05 14:20:47,188 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:47,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,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 28 treesize of output 22 [2021-06-05 14:20:47,193 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:47,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 15 treesize of output 11 [2021-06-05 14:20:47,197 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:47,358 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2021-06-05 14:20:47,358 INFO L628 ElimStorePlain]: treesize reduction 142, result has 57.2 percent of original size [2021-06-05 14:20:47,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,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 10 treesize of output 6 [2021-06-05 14:20:47,365 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:47,368 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,369 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:20:47,370 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:47,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:20:47,374 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:47,377 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:47,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 24 treesize of output 16 [2021-06-05 14:20:47,378 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:47,428 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:47,430 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:47,431 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:405, output treesize:103 [2021-06-05 14:20:47,555 INFO L134 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:20:47,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272988480] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:47,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:47,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:20:47,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185409945] [2021-06-05 14:20:47,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:20:47,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:47,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:20:47,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:20:47,555 INFO L87 Difference]: Start difference. First operand 413 states and 1351 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:47,965 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2021-06-05 14:20:48,208 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2021-06-05 14:20:48,459 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2021-06-05 14:20:48,744 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 114 [2021-06-05 14:20:49,091 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 127 [2021-06-05 14:20:49,519 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 132 [2021-06-05 14:20:49,995 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 134 [2021-06-05 14:20:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:50,218 INFO L93 Difference]: Finished difference Result 640 states and 2012 transitions. [2021-06-05 14:20:50,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:20:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:20:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:50,219 INFO L225 Difference]: With dead ends: 640 [2021-06-05 14:20:50,219 INFO L226 Difference]: Without dead ends: 619 [2021-06-05 14:20:50,219 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2850.8ms TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:20:50,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-06-05 14:20:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 417. [2021-06-05 14:20:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.2764423076923075) internal successors, (1363), 416 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1363 transitions. [2021-06-05 14:20:50,225 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1363 transitions. Word has length 17 [2021-06-05 14:20:50,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:50,225 INFO L482 AbstractCegarLoop]: Abstraction has 417 states and 1363 transitions. [2021-06-05 14:20:50,225 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:50,225 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1363 transitions. [2021-06-05 14:20:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:50,225 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:50,225 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:20:50,425 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 242 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2595 [2021-06-05 14:20:50,426 INFO L430 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:50,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:50,426 INFO L82 PathProgramCache]: Analyzing trace with hash 590115602, now seen corresponding path program 96 times [2021-06-05 14:20:50,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:50,426 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950928382] [2021-06-05 14:20:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:20:50,887 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:50,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950928382] [2021-06-05 14:20:50,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950928382] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:50,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453017033] [2021-06-05 14:20:50,888 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 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:20:50,914 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:20:50,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:50,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:20:50,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:51,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:20:51,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:51,123 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,171 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:51,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,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 25 treesize of output 19 [2021-06-05 14:20:51,176 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:20:51,180 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,223 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:51,226 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:51,226 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:180, output treesize:149 [2021-06-05 14:20:51,367 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 14:20:51,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:20:51,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:20:51,376 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,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 25 treesize of output 19 [2021-06-05 14:20:51,381 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 14:20:51,386 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,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 38 treesize of output 30 [2021-06-05 14:20:51,391 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,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 35 treesize of output 27 [2021-06-05 14:20:51,396 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,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 25 treesize of output 19 [2021-06-05 14:20:51,400 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:51,405 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,539 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2021-06-05 14:20:51,539 INFO L628 ElimStorePlain]: treesize reduction 136, result has 56.0 percent of original size [2021-06-05 14:20:51,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,543 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:20:51,545 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:51,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:20:51,549 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,553 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 14:20:51,553 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:51,556 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:51,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:20:51,558 INFO L550 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:51,608 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:51,610 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:51,611 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:385, output treesize:101 [2021-06-05 14:20:51,737 INFO L134 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:20:51,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453017033] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:51,737 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:51,737 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:20:51,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373081078] [2021-06-05 14:20:51,737 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:20:51,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:51,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:20:51,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:20:51,737 INFO L87 Difference]: Start difference. First operand 417 states and 1363 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:52,263 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2021-06-05 14:20:52,484 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2021-06-05 14:20:52,625 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2021-06-05 14:20:52,801 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2021-06-05 14:20:53,055 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2021-06-05 14:20:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:53,125 INFO L93 Difference]: Finished difference Result 594 states and 1871 transitions. [2021-06-05 14:20:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:20:53,126 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:20:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:53,127 INFO L225 Difference]: With dead ends: 594 [2021-06-05 14:20:53,127 INFO L226 Difference]: Without dead ends: 570 [2021-06-05 14:20:53,127 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1628.8ms TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:20:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-06-05 14:20:53,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 421. [2021-06-05 14:20:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.276190476190476) internal successors, (1376), 420 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1376 transitions. [2021-06-05 14:20:53,132 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1376 transitions. Word has length 17 [2021-06-05 14:20:53,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:53,132 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1376 transitions. [2021-06-05 14:20:53,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1376 transitions. [2021-06-05 14:20:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:53,133 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:53,133 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:20:53,333 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 243 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2618 [2021-06-05 14:20:53,333 INFO L430 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:53,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash 932699114, now seen corresponding path program 97 times [2021-06-05 14:20:53,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:53,333 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298051185] [2021-06-05 14:20:53,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:53,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:20:53,651 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:53,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298051185] [2021-06-05 14:20:53,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298051185] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:53,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316142848] [2021-06-05 14:20:53,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 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:20:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:53,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:20:53,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:53,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:53,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:53,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:20:53,870 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:53,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:53,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 25 treesize of output 19 [2021-06-05 14:20:53,875 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:53,919 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:53,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:53,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:53,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 25 treesize of output 19 [2021-06-05 14:20:53,925 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:53,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:53,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:20:53,930 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:53,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:53,970 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:20:53,970 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:139, output treesize:105 [2021-06-05 14:20:54,105 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_724, array_0, v_prenex_720, v_prenex_722], 1=[v_prenex_723, v_prenex_725, array_2, v_prenex_721]} [2021-06-05 14:20:54,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 17 treesize of output 13 [2021-06-05 14:20:54,111 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:54,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 19 treesize of output 15 [2021-06-05 14:20:54,115 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:54,203 INFO L628 ElimStorePlain]: treesize reduction 85, result has 63.5 percent of original size [2021-06-05 14:20:54,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 31 treesize of output 25 [2021-06-05 14:20:54,208 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:54,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 29 treesize of output 23 [2021-06-05 14:20:54,212 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:54,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:54,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:20:54,248 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:54,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:54,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 19 treesize of output 15 [2021-06-05 14:20:54,283 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:54,313 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:54,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:54,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 10 treesize of output 6 [2021-06-05 14:20:54,318 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:54,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:54,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:54,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:20:54,352 INFO L550 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:54,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:54,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:54,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:54,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 14:20:54,385 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:54,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:54,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 11 treesize of output 7 [2021-06-05 14:20:54,389 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:54,416 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:54,417 INFO L518 ElimStorePlain]: Eliminatee v_prenex_721 vanished before elimination [2021-06-05 14:20:54,419 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:54,419 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:247, output treesize:48 [2021-06-05 14:20:54,484 INFO L134 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:20:54,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316142848] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:54,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:54,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-06-05 14:20:54,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750238655] [2021-06-05 14:20:54,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:20:54,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:54,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:20:54,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:20:54,484 INFO L87 Difference]: Start difference. First operand 421 states and 1376 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:54,865 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2021-06-05 14:20:55,141 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 108 [2021-06-05 14:20:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:55,488 INFO L93 Difference]: Finished difference Result 576 states and 1834 transitions. [2021-06-05 14:20:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 14:20:55,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 17 [2021-06-05 14:20:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:55,489 INFO L225 Difference]: With dead ends: 576 [2021-06-05 14:20:55,489 INFO L226 Difference]: Without dead ends: 565 [2021-06-05 14:20:55,489 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1120.6ms TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:20:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-06-05 14:20:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 421. [2021-06-05 14:20:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.276190476190476) internal successors, (1376), 420 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1376 transitions. [2021-06-05 14:20:55,496 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1376 transitions. Word has length 17 [2021-06-05 14:20:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:55,496 INFO L482 AbstractCegarLoop]: Abstraction has 421 states and 1376 transitions. [2021-06-05 14:20:55,496 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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:20:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1376 transitions. [2021-06-05 14:20:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:55,509 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:55,509 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:20:55,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 244 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2641 [2021-06-05 14:20:55,709 INFO L430 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2073250540, now seen corresponding path program 98 times [2021-06-05 14:20:55,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:55,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264472598] [2021-06-05 14:20:55,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:56,189 INFO L134 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:20:56,189 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:56,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264472598] [2021-06-05 14:20:56,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264472598] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:56,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046984813] [2021-06-05 14:20:56,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:56,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:20:56,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:20:56,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:20:56,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:20:56,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:56,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:56,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:20:56,377 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:56,380 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:56,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:56,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 25 treesize of output 19 [2021-06-05 14:20:56,382 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:56,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:56,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:56,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 15 treesize of output 11 [2021-06-05 14:20:56,387 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:56,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:56,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 35 treesize of output 27 [2021-06-05 14:20:56,391 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:56,449 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:56,451 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:20:56,451 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:162 [2021-06-05 14:20:56,567 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_726, v_prenex_728, v_prenex_730], 1=[v_prenex_727, v_prenex_729, array_4, v_prenex_731]} [2021-06-05 14:20:56,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 15 treesize of output 11 [2021-06-05 14:20:56,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:56,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:20:56,580 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:56,959 WARN L205 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2021-06-05 14:20:56,959 INFO L628 ElimStorePlain]: treesize reduction 156, result has 56.3 percent of original size [2021-06-05 14:20:56,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 27 treesize of output 21 [2021-06-05 14:20:56,964 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:57,034 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:57,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2021-06-05 14:20:57,039 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:57,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2021-06-05 14:20:57,044 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:57,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:57,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 19 treesize of output 15 [2021-06-05 14:20:57,111 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:57,171 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:57,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:57,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 11 treesize of output 7 [2021-06-05 14:20:57,177 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:57,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:57,240 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:57,241 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:57,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 21 treesize of output 13 [2021-06-05 14:20:57,242 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:57,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:57,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 14:20:57,246 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:20:57,302 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:57,302 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:20:57,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:20:57,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 11 treesize of output 7 [2021-06-05 14:20:57,307 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:20:57,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:20:57,377 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:20:57,377 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:371, output treesize:125 [2021-06-05 14:20:57,563 INFO L134 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:20:57,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046984813] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:57,563 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:20:57,563 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:20:57,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552283538] [2021-06-05 14:20:57,563 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:20:57,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:20:57,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:20:57,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:20:57,564 INFO L87 Difference]: Start difference. First operand 421 states and 1376 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:58,209 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2021-06-05 14:20:58,528 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 75 [2021-06-05 14:20:58,693 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2021-06-05 14:20:58,904 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2021-06-05 14:20:59,347 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 71 [2021-06-05 14:20:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:20:59,457 INFO L93 Difference]: Finished difference Result 625 states and 1960 transitions. [2021-06-05 14:20:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:20:59,457 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:20:59,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:20:59,459 INFO L225 Difference]: With dead ends: 625 [2021-06-05 14:20:59,459 INFO L226 Difference]: Without dead ends: 593 [2021-06-05 14:20:59,459 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2197.2ms TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:20:59,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2021-06-05 14:20:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 428. [2021-06-05 14:20:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 3.2740046838407495) internal successors, (1398), 427 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:20:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1398 transitions. [2021-06-05 14:20:59,473 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1398 transitions. Word has length 17 [2021-06-05 14:20:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:20:59,473 INFO L482 AbstractCegarLoop]: Abstraction has 428 states and 1398 transitions. [2021-06-05 14:20:59,473 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:20:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1398 transitions. [2021-06-05 14:20:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:20:59,474 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:20:59,474 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:20:59,675 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 245 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2666 [2021-06-05 14:20:59,675 INFO L430 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:20:59,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:20:59,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1879133244, now seen corresponding path program 99 times [2021-06-05 14:20:59,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:20:59,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042187954] [2021-06-05 14:20:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:20:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:20:59,983 INFO L134 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:20:59,983 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:20:59,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042187954] [2021-06-05 14:20:59,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042187954] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:20:59,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695325915] [2021-06-05 14:20:59,984 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 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:21:00,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 14:21:00,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:00,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 14:21:00,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:00,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,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 35 treesize of output 27 [2021-06-05 14:21:00,207 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:00,213 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,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 25 treesize of output 19 [2021-06-05 14:21:00,219 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,223 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,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:21:00,225 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:00,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:00,303 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:233, output treesize:199 [2021-06-05 14:21:00,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,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 39 treesize of output 31 [2021-06-05 14:21:00,449 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:00,455 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,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 27 treesize of output 21 [2021-06-05 14:21:00,461 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21: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 25 treesize of output 19 [2021-06-05 14:21:00,466 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,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 29 treesize of output 23 [2021-06-05 14:21:00,471 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,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 17 treesize of output 13 [2021-06-05 14:21:00,477 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,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 15 treesize of output 11 [2021-06-05 14:21:00,483 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,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 35 treesize of output 27 [2021-06-05 14:21:00,488 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,705 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2021-06-05 14:21:00,706 INFO L628 ElimStorePlain]: treesize reduction 172, result has 58.6 percent of original size [2021-06-05 14:21:00,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:21:00,711 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:21:00,717 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:00,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,722 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,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 21 treesize of output 13 [2021-06-05 14:21:00,723 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:00,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 25 treesize of output 17 [2021-06-05 14:21:00,728 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:00,827 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:00,830 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:21:00,830 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:485, output treesize:195 [2021-06-05 14:21:01,128 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 14:21:01,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:21:01,242 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695325915] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:01,242 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:01,243 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-06-05 14:21:01,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898587537] [2021-06-05 14:21:01,243 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:21:01,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:01,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:21:01,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:21:01,243 INFO L87 Difference]: Start difference. First operand 428 states and 1398 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:21:01,561 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 60 [2021-06-05 14:21:01,757 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2021-06-05 14:21:02,023 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2021-06-05 14:21:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:02,277 INFO L93 Difference]: Finished difference Result 604 states and 1916 transitions. [2021-06-05 14:21:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:21:02,277 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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 17 [2021-06-05 14:21:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:02,278 INFO L225 Difference]: With dead ends: 604 [2021-06-05 14:21:02,278 INFO L226 Difference]: Without dead ends: 589 [2021-06-05 14:21:02,278 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1595.3ms TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:21:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-06-05 14:21:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 429. [2021-06-05 14:21:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.2873831775700935) internal successors, (1407), 428 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:21:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1407 transitions. [2021-06-05 14:21:02,283 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1407 transitions. Word has length 17 [2021-06-05 14:21:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:02,284 INFO L482 AbstractCegarLoop]: Abstraction has 429 states and 1407 transitions. [2021-06-05 14:21:02,284 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:21:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1407 transitions. [2021-06-05 14:21:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-06-05 14:21:02,284 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:02,284 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:21:02,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2681,246 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:02,485 INFO L430 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:02,485 INFO L82 PathProgramCache]: Analyzing trace with hash 309049932, now seen corresponding path program 100 times [2021-06-05 14:21:02,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:02,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179422387] [2021-06-05 14:21:02,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:02,738 INFO L134 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:21:02,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:02,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179422387] [2021-06-05 14:21:02,738 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179422387] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:02,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406910493] [2021-06-05 14:21:02,738 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 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:21:02,764 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:21:02,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:02,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:21:02,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:02,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:02,833 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:02,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 25 treesize of output 19 [2021-06-05 14:21:02,836 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:02,853 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:02,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 25 treesize of output 19 [2021-06-05 14:21:02,856 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:02,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 27 treesize of output 21 [2021-06-05 14:21:02,859 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:02,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:02,874 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:02,874 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:100, output treesize:74 [2021-06-05 14:21:02,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 27 treesize of output 21 [2021-06-05 14:21:02,957 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:02,988 INFO L628 ElimStorePlain]: treesize reduction 31, result has 69.3 percent of original size [2021-06-05 14:21:02,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 27 treesize of output 21 [2021-06-05 14:21:02,991 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:03,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:03,003 INFO L518 ElimStorePlain]: Eliminatee v_prenex_736 vanished before elimination [2021-06-05 14:21:03,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 23 [2021-06-05 14:21:03,006 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:03,016 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:03,017 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:21:03,017 INFO L518 ElimStorePlain]: Eliminatee v_prenex_733 vanished before elimination [2021-06-05 14:21:03,017 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:03,017 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:120, output treesize:32 [2021-06-05 14:21:03,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:21:03,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406910493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:03,058 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:03,058 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 14:21:03,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645062556] [2021-06-05 14:21:03,058 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:21:03,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:03,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:21:03,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:21:03,059 INFO L87 Difference]: Start difference. First operand 429 states and 1407 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:21:03,563 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2021-06-05 14:21:03,741 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2021-06-05 14:21:03,930 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 70 [2021-06-05 14:21:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:03,976 INFO L93 Difference]: Finished difference Result 637 states and 2020 transitions. [2021-06-05 14:21:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 14:21:03,976 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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 17 [2021-06-05 14:21:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:03,977 INFO L225 Difference]: With dead ends: 637 [2021-06-05 14:21:03,977 INFO L226 Difference]: Without dead ends: 623 [2021-06-05 14:21:03,977 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 976.1ms TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:21:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-06-05 14:21:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 429. [2021-06-05 14:21:03,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.2873831775700935) internal successors, (1407), 428 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:21:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1407 transitions. [2021-06-05 14:21:03,983 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 1407 transitions. Word has length 17 [2021-06-05 14:21:03,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:03,984 INFO L482 AbstractCegarLoop]: Abstraction has 429 states and 1407 transitions. [2021-06-05 14:21:03,984 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:21:03,984 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 1407 transitions. [2021-06-05 14:21:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:03,985 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:03,985 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:04,199 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 247 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2701 [2021-06-05 14:21:04,200 INFO L430 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:04,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1605107838, now seen corresponding path program 101 times [2021-06-05 14:21:04,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:04,200 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060277728] [2021-06-05 14:21:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:04,509 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:04,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060277728] [2021-06-05 14:21:04,509 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060277728] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:04,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390360494] [2021-06-05 14:21:04,509 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 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:21:04,536 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:21:04,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:04,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 14:21:04,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:04,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:04,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:04,616 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21: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 15 treesize of output 11 [2021-06-05 14:21:04,619 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:04,637 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:04,637 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:04,638 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-06-05 14:21:04,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 27 treesize of output 21 [2021-06-05 14:21:04,745 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:04,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:04,751 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:21:04,751 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:04,751 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:21:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:04,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390360494] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:04,781 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:04,781 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:21:04,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548657414] [2021-06-05 14:21:04,781 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:21:04,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:04,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:21:04,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:21:04,781 INFO L87 Difference]: Start difference. First operand 429 states and 1407 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:05,639 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2021-06-05 14:21:05,881 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2021-06-05 14:21:06,078 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2021-06-05 14:21:06,302 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2021-06-05 14:21:06,434 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2021-06-05 14:21:06,712 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2021-06-05 14:21:07,138 WARN L205 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2021-06-05 14:21:07,359 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2021-06-05 14:21:07,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:07,574 INFO L93 Difference]: Finished difference Result 577 states and 1815 transitions. [2021-06-05 14:21:07,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 14:21:07,574 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:07,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:07,575 INFO L225 Difference]: With dead ends: 577 [2021-06-05 14:21:07,575 INFO L226 Difference]: Without dead ends: 567 [2021-06-05 14:21:07,576 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2492.2ms TimeCoverageRelationStatistics Valid=188, Invalid=868, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 14:21:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-06-05 14:21:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 434. [2021-06-05 14:21:07,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.284064665127021) internal successors, (1422), 433 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1422 transitions. [2021-06-05 14:21:07,583 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1422 transitions. Word has length 18 [2021-06-05 14:21:07,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:07,583 INFO L482 AbstractCegarLoop]: Abstraction has 434 states and 1422 transitions. [2021-06-05 14:21:07,583 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1422 transitions. [2021-06-05 14:21:07,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:07,584 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:07,584 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:07,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2710,248 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:07,797 INFO L430 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:07,797 INFO L82 PathProgramCache]: Analyzing trace with hash -343958516, now seen corresponding path program 102 times [2021-06-05 14:21:07,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:07,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522163199] [2021-06-05 14:21:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:08,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:08,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522163199] [2021-06-05 14:21:08,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522163199] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:08,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062017732] [2021-06-05 14:21:08,047 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 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:21:08,079 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:21:08,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:08,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:08,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:08,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:08,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 25 treesize of output 19 [2021-06-05 14:21:08,186 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:08,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:08,189 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:08,212 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:08,213 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:08,213 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 14:21:08,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:21:08,305 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:08,313 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:08,313 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:21:08,313 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:08,314 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:21:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:08,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062017732] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:08,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:08,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:08,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251089660] [2021-06-05 14:21:08,345 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:08,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:08,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:08,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:08,345 INFO L87 Difference]: Start difference. First operand 434 states and 1422 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:08,922 INFO L93 Difference]: Finished difference Result 506 states and 1618 transitions. [2021-06-05 14:21:08,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:08,922 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:08,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:08,923 INFO L225 Difference]: With dead ends: 506 [2021-06-05 14:21:08,923 INFO L226 Difference]: Without dead ends: 501 [2021-06-05 14:21:08,923 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 640.5ms TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:21:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-06-05 14:21:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 440. [2021-06-05 14:21:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.287015945330296) internal successors, (1443), 439 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1443 transitions. [2021-06-05 14:21:08,930 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1443 transitions. Word has length 18 [2021-06-05 14:21:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:08,930 INFO L482 AbstractCegarLoop]: Abstraction has 440 states and 1443 transitions. [2021-06-05 14:21:08,930 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1443 transitions. [2021-06-05 14:21:08,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:08,941 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:08,941 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:09,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2717,249 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:09,165 INFO L430 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:09,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:09,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2011020034, now seen corresponding path program 103 times [2021-06-05 14:21:09,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:09,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422951106] [2021-06-05 14:21:09,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:09,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:09,481 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:09,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422951106] [2021-06-05 14:21:09,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422951106] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:09,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121503433] [2021-06-05 14:21:09,481 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 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:21:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:09,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 14:21:09,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:09,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:09,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 15 treesize of output 11 [2021-06-05 14:21:09,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:09,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 25 treesize of output 19 [2021-06-05 14:21:09,672 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:09,700 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:09,701 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:09,702 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 14:21:09,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:09,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 27 treesize of output 21 [2021-06-05 14:21:09,775 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:09,778 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:09,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:09,779 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:09,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:09,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 17 treesize of output 13 [2021-06-05 14:21:09,784 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:09,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 25 treesize of output 19 [2021-06-05 14:21:09,788 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:09,854 INFO L628 ElimStorePlain]: treesize reduction 89, result has 39.5 percent of original size [2021-06-05 14:21:09,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 11 treesize of output 7 [2021-06-05 14:21:09,859 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:09,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:09,886 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:09,886 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 14:21:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:10,011 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121503433] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:10,011 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:10,011 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:21:10,011 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305400325] [2021-06-05 14:21:10,011 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:21:10,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:10,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:21:10,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:21:10,011 INFO L87 Difference]: Start difference. First operand 440 states and 1443 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:10,737 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2021-06-05 14:21:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:10,830 INFO L93 Difference]: Finished difference Result 516 states and 1643 transitions. [2021-06-05 14:21:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:10,830 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:10,831 INFO L225 Difference]: With dead ends: 516 [2021-06-05 14:21:10,831 INFO L226 Difference]: Without dead ends: 504 [2021-06-05 14:21:10,831 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 949.4ms TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:21:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-06-05 14:21:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 443. [2021-06-05 14:21:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 3.2850678733031673) internal successors, (1452), 442 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:10,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 1452 transitions. [2021-06-05 14:21:10,838 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 1452 transitions. Word has length 18 [2021-06-05 14:21:10,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:10,838 INFO L482 AbstractCegarLoop]: Abstraction has 443 states and 1452 transitions. [2021-06-05 14:21:10,838 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 1452 transitions. [2021-06-05 14:21:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:10,838 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:10,839 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:11,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 250 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2727 [2021-06-05 14:21:11,039 INFO L430 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:11,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1137279354, now seen corresponding path program 104 times [2021-06-05 14:21:11,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:11,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8752859] [2021-06-05 14:21:11,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:11,273 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:11,273 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8752859] [2021-06-05 14:21:11,273 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8752859] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:11,273 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536620711] [2021-06-05 14:21:11,273 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 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:21:11,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:21:11,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:11,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:11,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:11,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:11,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:11,406 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:11,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:11,409 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:11,429 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:11,430 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:11,430 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 14:21:11,479 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_737], 1=[v_prenex_738, array_4]} [2021-06-05 14:21:11,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:11,482 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:11,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:11,485 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:11,525 INFO L628 ElimStorePlain]: treesize reduction 71, result has 43.2 percent of original size [2021-06-05 14:21:11,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 27 treesize of output 21 [2021-06-05 14:21:11,527 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:11,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:11,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:21:11,544 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:11,557 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:11,558 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:21:11,558 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:11,558 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 14:21:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:11,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536620711] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:11,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:11,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:11,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671673354] [2021-06-05 14:21:11,620 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:11,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:11,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:11,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:11,620 INFO L87 Difference]: Start difference. First operand 443 states and 1452 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:12,366 INFO L93 Difference]: Finished difference Result 525 states and 1675 transitions. [2021-06-05 14:21:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:21:12,366 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:12,367 INFO L225 Difference]: With dead ends: 525 [2021-06-05 14:21:12,367 INFO L226 Difference]: Without dead ends: 515 [2021-06-05 14:21:12,367 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 763.1ms TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:21:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-06-05 14:21:12,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 445. [2021-06-05 14:21:12,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 3.2882882882882885) internal successors, (1460), 444 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:12,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1460 transitions. [2021-06-05 14:21:12,372 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1460 transitions. Word has length 18 [2021-06-05 14:21:12,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:12,372 INFO L482 AbstractCegarLoop]: Abstraction has 445 states and 1460 transitions. [2021-06-05 14:21:12,372 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:12,372 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1460 transitions. [2021-06-05 14:21:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:12,373 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:12,373 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:12,573 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2737,251 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:12,574 INFO L430 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:12,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:12,574 INFO L82 PathProgramCache]: Analyzing trace with hash 193897062, now seen corresponding path program 105 times [2021-06-05 14:21:12,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:12,574 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738170529] [2021-06-05 14:21:12,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:12,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:12,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738170529] [2021-06-05 14:21:12,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738170529] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:12,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068809571] [2021-06-05 14:21:12,771 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 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:21:12,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:21:12,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:12,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:12,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:12,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:12,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:12,907 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:12,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 15 treesize of output 11 [2021-06-05 14:21:12,909 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:12,929 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:12,930 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:12,930 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 14:21:13,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 17 treesize of output 13 [2021-06-05 14:21:13,009 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:13,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 19 treesize of output 15 [2021-06-05 14:21:13,011 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:13,023 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 14:21:13,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:21:13,025 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:13,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:13,031 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:13,032 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 14:21:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:13,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068809571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:13,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:13,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:13,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086293587] [2021-06-05 14:21:13,056 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:13,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:13,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:13,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:13,057 INFO L87 Difference]: Start difference. First operand 445 states and 1460 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:13,514 INFO L93 Difference]: Finished difference Result 529 states and 1688 transitions. [2021-06-05 14:21:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:13,514 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:13,515 INFO L225 Difference]: With dead ends: 529 [2021-06-05 14:21:13,515 INFO L226 Difference]: Without dead ends: 524 [2021-06-05 14:21:13,515 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 520.7ms TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:21:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-06-05 14:21:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 454. [2021-06-05 14:21:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.2891832229580573) internal successors, (1490), 453 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1490 transitions. [2021-06-05 14:21:13,520 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1490 transitions. Word has length 18 [2021-06-05 14:21:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:13,520 INFO L482 AbstractCegarLoop]: Abstraction has 454 states and 1490 transitions. [2021-06-05 14:21:13,520 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:13,520 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1490 transitions. [2021-06-05 14:21:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:13,521 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:13,521 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:13,736 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 252 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2748 [2021-06-05 14:21:13,737 INFO L430 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1746091684, now seen corresponding path program 106 times [2021-06-05 14:21:13,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:13,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16114916] [2021-06-05 14:21:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:13,995 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:13,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16114916] [2021-06-05 14:21:13,995 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16114916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:13,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561139859] [2021-06-05 14:21:13,995 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 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:21:14,020 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:21:14,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:14,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:21:14,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:14,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:14,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:21:14,123 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:14,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 25 treesize of output 19 [2021-06-05 14:21:14,126 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:14,150 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:14,151 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:14,151 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:69 [2021-06-05 14:21:14,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:14,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 15 treesize of output 11 [2021-06-05 14:21:14,211 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:14,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:14,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:14,215 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:14,218 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:14,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 35 treesize of output 27 [2021-06-05 14:21:14,219 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:14,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 25 treesize of output 19 [2021-06-05 14:21:14,222 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:14,276 INFO L628 ElimStorePlain]: treesize reduction 83, result has 43.5 percent of original size [2021-06-05 14:21:14,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 22 treesize of output 14 [2021-06-05 14:21:14,279 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:14,301 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:14,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:14,302 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:181, output treesize:50 [2021-06-05 14:21:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:14,406 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561139859] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:14,406 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:14,406 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:21:14,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441204616] [2021-06-05 14:21:14,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:21:14,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:14,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:21:14,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:21:14,406 INFO L87 Difference]: Start difference. First operand 454 states and 1490 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:14,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:14,889 INFO L93 Difference]: Finished difference Result 539 states and 1713 transitions. [2021-06-05 14:21:14,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:14,889 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:14,890 INFO L225 Difference]: With dead ends: 539 [2021-06-05 14:21:14,890 INFO L226 Difference]: Without dead ends: 527 [2021-06-05 14:21:14,890 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 653.5ms TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:21:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-06-05 14:21:14,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 451. [2021-06-05 14:21:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 450 states have (on average 3.2844444444444445) internal successors, (1478), 450 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 1478 transitions. [2021-06-05 14:21:14,895 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 1478 transitions. Word has length 18 [2021-06-05 14:21:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:14,895 INFO L482 AbstractCegarLoop]: Abstraction has 451 states and 1478 transitions. [2021-06-05 14:21:14,895 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 1478 transitions. [2021-06-05 14:21:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:14,896 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:14,896 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:15,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2758,253 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:15,097 INFO L430 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:15,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:15,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1675134932, now seen corresponding path program 107 times [2021-06-05 14:21:15,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:15,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245717473] [2021-06-05 14:21:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:15,290 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:15,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245717473] [2021-06-05 14:21:15,290 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245717473] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:15,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062876459] [2021-06-05 14:21:15,290 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 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:21:15,316 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:21:15,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:15,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:15,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:15,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:15,411 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:15,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:15,413 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:15,428 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:15,429 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:15,429 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 14:21:15,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:15,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:15,479 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:15,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:15,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 35 treesize of output 27 [2021-06-05 14:21:15,483 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:15,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:15,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:15,486 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:15,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 25 treesize of output 19 [2021-06-05 14:21:15,489 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:15,525 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 14:21:15,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:21:15,528 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:15,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:15,542 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:15,542 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:21:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:15,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062876459] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:15,601 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:15,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:15,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371394300] [2021-06-05 14:21:15,602 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:15,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:15,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:15,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:15,602 INFO L87 Difference]: Start difference. First operand 451 states and 1478 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:16,134 INFO L93 Difference]: Finished difference Result 534 states and 1710 transitions. [2021-06-05 14:21:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:16,134 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:16,135 INFO L225 Difference]: With dead ends: 534 [2021-06-05 14:21:16,135 INFO L226 Difference]: Without dead ends: 529 [2021-06-05 14:21:16,135 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 549.5ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:21:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-06-05 14:21:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 448. [2021-06-05 14:21:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.286353467561521) internal successors, (1469), 447 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1469 transitions. [2021-06-05 14:21:16,140 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1469 transitions. Word has length 18 [2021-06-05 14:21:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:16,140 INFO L482 AbstractCegarLoop]: Abstraction has 448 states and 1469 transitions. [2021-06-05 14:21:16,140 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1469 transitions. [2021-06-05 14:21:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:16,141 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:16,141 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:16,341 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2768,254 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:16,341 INFO L430 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:16,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:16,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1103680126, now seen corresponding path program 108 times [2021-06-05 14:21:16,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:16,342 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088319857] [2021-06-05 14:21:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:16,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:16,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088319857] [2021-06-05 14:21:16,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088319857] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:16,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830209342] [2021-06-05 14:21:16,605 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 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:21:16,647 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:21:16,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:16,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:16,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:16,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:16,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:16,741 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:16,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 15 treesize of output 11 [2021-06-05 14:21:16,744 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:16,764 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:16,765 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:16,766 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-06-05 14:21:16,852 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_739], 1=[array_4, v_prenex_740]} [2021-06-05 14:21:16,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 25 treesize of output 19 [2021-06-05 14:21:16,855 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:16,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:21:16,858 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:16,896 INFO L628 ElimStorePlain]: treesize reduction 75, result has 42.7 percent of original size [2021-06-05 14:21:16,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:21:16,899 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:16,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:16,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 22 treesize of output 14 [2021-06-05 14:21:16,915 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:16,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:16,928 INFO L518 ElimStorePlain]: Eliminatee v_prenex_740 vanished before elimination [2021-06-05 14:21:16,929 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:16,929 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 14:21:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:16,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830209342] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:16,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:16,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:16,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382006688] [2021-06-05 14:21:16,990 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:16,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:16,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:16,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:16,991 INFO L87 Difference]: Start difference. First operand 448 states and 1469 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:17,546 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2021-06-05 14:21:17,733 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2021-06-05 14:21:17,852 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2021-06-05 14:21:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:17,912 INFO L93 Difference]: Finished difference Result 578 states and 1826 transitions. [2021-06-05 14:21:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:21:17,913 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:17,913 INFO L225 Difference]: With dead ends: 578 [2021-06-05 14:21:17,913 INFO L226 Difference]: Without dead ends: 568 [2021-06-05 14:21:17,914 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 961.4ms TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:21:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-06-05 14:21:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 454. [2021-06-05 14:21:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.282560706401766) internal successors, (1487), 453 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1487 transitions. [2021-06-05 14:21:17,919 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1487 transitions. Word has length 18 [2021-06-05 14:21:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:17,919 INFO L482 AbstractCegarLoop]: Abstraction has 454 states and 1487 transitions. [2021-06-05 14:21:17,919 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1487 transitions. [2021-06-05 14:21:17,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:17,920 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:17,920 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:18,120 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 255 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2778 [2021-06-05 14:21:18,120 INFO L430 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:18,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1529859260, now seen corresponding path program 109 times [2021-06-05 14:21:18,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:18,121 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830200892] [2021-06-05 14:21:18,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:18,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:18,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830200892] [2021-06-05 14:21:18,298 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830200892] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:18,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490525769] [2021-06-05 14:21:18,298 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 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:21:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:18,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:21:18,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:18,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:18,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 25 treesize of output 19 [2021-06-05 14:21:18,418 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:18,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:21:18,421 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:18,438 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:18,439 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:18,439 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-06-05 14:21:18,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:18,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 25 treesize of output 19 [2021-06-05 14:21:18,547 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:18,549 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:18,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:21:18,550 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:18,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:18,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:21:18,553 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:18,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 25 treesize of output 19 [2021-06-05 14:21:18,556 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:18,594 INFO L628 ElimStorePlain]: treesize reduction 71, result has 42.3 percent of original size [2021-06-05 14:21:18,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 22 treesize of output 14 [2021-06-05 14:21:18,596 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:18,611 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:18,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:18,611 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 14:21:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:18,669 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490525769] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:18,669 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:18,669 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:21:18,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681534660] [2021-06-05 14:21:18,670 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:21:18,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:18,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:21:18,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:21:18,670 INFO L87 Difference]: Start difference. First operand 454 states and 1487 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:19,818 INFO L93 Difference]: Finished difference Result 602 states and 1889 transitions. [2021-06-05 14:21:19,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 14:21:19,819 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:19,819 INFO L225 Difference]: With dead ends: 602 [2021-06-05 14:21:19,819 INFO L226 Difference]: Without dead ends: 578 [2021-06-05 14:21:19,820 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1130.0ms TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2021-06-05 14:21:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-06-05 14:21:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 464. [2021-06-05 14:21:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.2764578833693303) internal successors, (1517), 463 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1517 transitions. [2021-06-05 14:21:19,825 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1517 transitions. Word has length 18 [2021-06-05 14:21:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:19,825 INFO L482 AbstractCegarLoop]: Abstraction has 464 states and 1517 transitions. [2021-06-05 14:21:19,825 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1517 transitions. [2021-06-05 14:21:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:19,826 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:19,826 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:20,026 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2790,256 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:20,026 INFO L430 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash 816041682, now seen corresponding path program 110 times [2021-06-05 14:21:20,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:20,027 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260107368] [2021-06-05 14:21:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:20,279 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:20,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260107368] [2021-06-05 14:21:20,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260107368] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:20,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791217226] [2021-06-05 14:21:20,279 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 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:21:20,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:21:20,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:20,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:20,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:20,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:20,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 25 treesize of output 19 [2021-06-05 14:21:20,454 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:20,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 15 treesize of output 11 [2021-06-05 14:21:20,457 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:20,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:20,478 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:20,478 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 14:21:20,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 27 treesize of output 21 [2021-06-05 14:21:20,559 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:20,564 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:20,564 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:21:20,565 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:20,565 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:21:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:20,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791217226] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:20,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:20,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:20,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601623115] [2021-06-05 14:21:20,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:20,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:20,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:20,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:20,591 INFO L87 Difference]: Start difference. First operand 464 states and 1517 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:21,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:21,023 INFO L93 Difference]: Finished difference Result 540 states and 1723 transitions. [2021-06-05 14:21:21,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:21,023 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:21,024 INFO L225 Difference]: With dead ends: 540 [2021-06-05 14:21:21,024 INFO L226 Difference]: Without dead ends: 535 [2021-06-05 14:21:21,024 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 558.6ms TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:21:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-06-05 14:21:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 470. [2021-06-05 14:21:21,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.279317697228145) internal successors, (1538), 469 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1538 transitions. [2021-06-05 14:21:21,029 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1538 transitions. Word has length 18 [2021-06-05 14:21:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:21,029 INFO L482 AbstractCegarLoop]: Abstraction has 470 states and 1538 transitions. [2021-06-05 14:21:21,029 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1538 transitions. [2021-06-05 14:21:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:21,030 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:21,030 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:21,232 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 257 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2800 [2021-06-05 14:21:21,232 INFO L430 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:21,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:21,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1123947064, now seen corresponding path program 111 times [2021-06-05 14:21:21,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:21,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259985928] [2021-06-05 14:21:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:21,484 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:21,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259985928] [2021-06-05 14:21:21,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259985928] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:21,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141182290] [2021-06-05 14:21:21,484 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 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:21:21,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:21:21,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:21,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:21,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:21,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:21,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:21,616 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:21,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:21,619 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:21,639 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:21,640 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:21,640 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 14:21:21,697 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_741], 1=[array_4, v_prenex_742]} [2021-06-05 14:21:21,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 15 treesize of output 11 [2021-06-05 14:21:21,700 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:21,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 25 treesize of output 19 [2021-06-05 14:21:21,703 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:21,743 INFO L628 ElimStorePlain]: treesize reduction 79, result has 38.8 percent of original size [2021-06-05 14:21:21,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 19 treesize of output 15 [2021-06-05 14:21:21,746 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:21,760 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:21,760 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:21:21,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 11 treesize of output 7 [2021-06-05 14:21:21,763 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:21,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:21,777 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:21,777 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 14:21:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:21,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141182290] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:21,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:21,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:21,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431048703] [2021-06-05 14:21:21,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:21,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:21,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:21,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:21,844 INFO L87 Difference]: Start difference. First operand 470 states and 1538 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:22,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:22,264 INFO L93 Difference]: Finished difference Result 550 states and 1755 transitions. [2021-06-05 14:21:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:22,264 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:22,265 INFO L225 Difference]: With dead ends: 550 [2021-06-05 14:21:22,265 INFO L226 Difference]: Without dead ends: 545 [2021-06-05 14:21:22,265 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 533.6ms TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:21:22,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-06-05 14:21:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 464. [2021-06-05 14:21:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 3.2764578833693303) internal successors, (1517), 463 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1517 transitions. [2021-06-05 14:21:22,270 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1517 transitions. Word has length 18 [2021-06-05 14:21:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:22,270 INFO L482 AbstractCegarLoop]: Abstraction has 464 states and 1517 transitions. [2021-06-05 14:21:22,270 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1517 transitions. [2021-06-05 14:21:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:22,271 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:22,271 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:22,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 258 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2810 [2021-06-05 14:21:22,473 INFO L430 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:22,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1997687744, now seen corresponding path program 112 times [2021-06-05 14:21:22,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:22,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378350484] [2021-06-05 14:21:22,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:22,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:22,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378350484] [2021-06-05 14:21:22,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378350484] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:22,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150278788] [2021-06-05 14:21:22,690 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 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:21:22,716 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:21:22,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:22,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 14:21:22,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:22,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 25 treesize of output 19 [2021-06-05 14:21:22,832 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:22,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 15 treesize of output 11 [2021-06-05 14:21:22,835 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:22,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:22,850 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:22,850 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 14:21:22,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:22,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 25 treesize of output 19 [2021-06-05 14:21:22,915 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:22,918 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:22,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:21:22,919 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:22,922 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:22,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:21:22,923 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:22,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 25 treesize of output 19 [2021-06-05 14:21:22,926 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:22,961 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 14:21:22,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:21:22,963 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:22,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:22,977 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:22,977 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:21:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:23,045 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150278788] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:23,045 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:23,045 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:23,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27786041] [2021-06-05 14:21:23,045 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:23,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:23,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:23,046 INFO L87 Difference]: Start difference. First operand 464 states and 1517 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:23,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:23,764 INFO L93 Difference]: Finished difference Result 548 states and 1754 transitions. [2021-06-05 14:21:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:21:23,764 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:23,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:23,765 INFO L225 Difference]: With dead ends: 548 [2021-06-05 14:21:23,765 INFO L226 Difference]: Without dead ends: 543 [2021-06-05 14:21:23,765 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 744.8ms TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:21:23,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-06-05 14:21:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 465. [2021-06-05 14:21:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 3.2780172413793105) internal successors, (1521), 464 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:23,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1521 transitions. [2021-06-05 14:21:23,770 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 1521 transitions. Word has length 18 [2021-06-05 14:21:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:23,770 INFO L482 AbstractCegarLoop]: Abstraction has 465 states and 1521 transitions. [2021-06-05 14:21:23,770 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 1521 transitions. [2021-06-05 14:21:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:23,771 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:23,771 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:23,971 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 259 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2821 [2021-06-05 14:21:23,971 INFO L430 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1275381276, now seen corresponding path program 113 times [2021-06-05 14:21:23,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:23,972 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107690884] [2021-06-05 14:21:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:24,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:24,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:24,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107690884] [2021-06-05 14:21:24,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107690884] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:24,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183483263] [2021-06-05 14:21:24,231 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 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:21:24,256 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:21:24,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:24,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:21:24,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:24,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:24,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:24,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:24,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:24,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:24,340 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:24,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 15 treesize of output 11 [2021-06-05 14:21:24,341 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:24,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:24,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:24,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:21:24,344 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:24,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:24,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:21:24,348 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:24,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:24,387 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:24,387 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 14:21:24,685 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_2]} [2021-06-05 14:21:24,688 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:24,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:21:24,689 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:24,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:24,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:24,694 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:24,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:24,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:21:24,698 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:24,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:24,702 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:24,748 INFO L628 ElimStorePlain]: treesize reduction 83, result has 41.1 percent of original size [2021-06-05 14:21:24,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:24,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 11 treesize of output 7 [2021-06-05 14:21:24,752 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:24,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:24,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:24,773 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:173, output treesize:38 [2021-06-05 14:21:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:24,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183483263] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:24,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:24,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 14:21:24,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472122071] [2021-06-05 14:21:24,833 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:24,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:24,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:24,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:24,833 INFO L87 Difference]: Start difference. First operand 465 states and 1521 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:21:25,024 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2021-06-05 14:21:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:25,445 INFO L93 Difference]: Finished difference Result 633 states and 1928 transitions. [2021-06-05 14:21:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:25,445 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:21:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:25,446 INFO L225 Difference]: With dead ends: 633 [2021-06-05 14:21:25,446 INFO L226 Difference]: Without dead ends: 614 [2021-06-05 14:21:25,446 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 894.1ms TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:21:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-06-05 14:21:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 470. [2021-06-05 14:21:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 3.275053304904051) internal successors, (1536), 469 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1536 transitions. [2021-06-05 14:21:25,452 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1536 transitions. Word has length 18 [2021-06-05 14:21:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:25,452 INFO L482 AbstractCegarLoop]: Abstraction has 470 states and 1536 transitions. [2021-06-05 14:21:25,452 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:21:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1536 transitions. [2021-06-05 14:21:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:25,453 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:25,453 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:25,654 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2831,260 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:25,654 INFO L430 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:25,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:25,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2131877222, now seen corresponding path program 114 times [2021-06-05 14:21:25,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:25,655 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167235625] [2021-06-05 14:21:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:25,893 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:25,893 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167235625] [2021-06-05 14:21:25,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167235625] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:25,893 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220508266] [2021-06-05 14:21:25,893 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 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:21:25,918 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:21:25,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:25,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:25,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:25,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:25,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:25,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 25 treesize of output 19 [2021-06-05 14:21:25,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:25,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:25,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:25,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:25,984 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:25,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:25,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:25,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:21:25,988 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:25,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:25,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:21:25,991 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:26,029 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:26,030 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:26,030 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 14:21:26,309 INFO L446 ElimStorePlain]: Different costs {0=[array_4, v_prenex_752], 1=[array_2, v_prenex_751]} [2021-06-05 14:21:26,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:26,314 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:26,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:26,317 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:26,353 INFO L628 ElimStorePlain]: treesize reduction 63, result has 42.7 percent of original size [2021-06-05 14:21:26,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:21:26,355 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:26,365 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:26,365 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:21:26,367 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:26,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 12 treesize of output 8 [2021-06-05 14:21:26,369 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:26,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:26,380 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:26,380 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 14:21:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:26,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220508266] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:26,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:26,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:21:26,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567446195] [2021-06-05 14:21:26,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:21:26,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:26,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:21:26,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:21:26,395 INFO L87 Difference]: Start difference. First operand 470 states and 1536 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:21:26,593 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 14:21:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:27,102 INFO L93 Difference]: Finished difference Result 615 states and 1900 transitions. [2021-06-05 14:21:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:27,102 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:21:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:27,103 INFO L225 Difference]: With dead ends: 615 [2021-06-05 14:21:27,103 INFO L226 Difference]: Without dead ends: 610 [2021-06-05 14:21:27,103 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 818.4ms TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:21:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-06-05 14:21:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 473. [2021-06-05 14:21:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 3.2796610169491527) internal successors, (1548), 472 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1548 transitions. [2021-06-05 14:21:27,109 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1548 transitions. Word has length 18 [2021-06-05 14:21:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:27,109 INFO L482 AbstractCegarLoop]: Abstraction has 473 states and 1548 transitions. [2021-06-05 14:21:27,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:21:27,109 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1548 transitions. [2021-06-05 14:21:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:27,109 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:27,109 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:27,310 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 261 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2845 [2021-06-05 14:21:27,310 INFO L430 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:27,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:27,310 INFO L82 PathProgramCache]: Analyzing trace with hash 191888476, now seen corresponding path program 115 times [2021-06-05 14:21:27,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:27,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238799483] [2021-06-05 14:21:27,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:27,534 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:27,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238799483] [2021-06-05 14:21:27,534 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238799483] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:27,534 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022759781] [2021-06-05 14:21:27,534 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 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:21:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:27,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:21:27,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:27,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:27,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:27,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 25 treesize of output 19 [2021-06-05 14:21:27,623 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:27,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:27,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:27,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:27,627 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:27,629 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:27,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:27,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:21:27,631 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:27,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:27,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:21:27,634 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:27,672 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:27,673 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:27,673 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 14:21:27,901 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 14:21:27,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:27,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 17 treesize of output 13 [2021-06-05 14:21:27,906 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:27,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:27,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 25 treesize of output 19 [2021-06-05 14:21:27,910 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:27,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:27,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:21:27,914 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:27,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:21:27,917 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:27,988 INFO L628 ElimStorePlain]: treesize reduction 103, result has 40.5 percent of original size [2021-06-05 14:21:27,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:27,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:21:27,992 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:28,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:28,021 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:28,021 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:197, output treesize:50 [2021-06-05 14:21:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:28,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022759781] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:28,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:28,110 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 14:21:28,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475730777] [2021-06-05 14:21:28,110 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:21:28,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:28,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:21:28,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:21:28,111 INFO L87 Difference]: Start difference. First operand 473 states and 1548 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:21:28,340 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2021-06-05 14:21:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:28,757 INFO L93 Difference]: Finished difference Result 629 states and 1937 transitions. [2021-06-05 14:21:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:28,758 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:21:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:28,759 INFO L225 Difference]: With dead ends: 629 [2021-06-05 14:21:28,759 INFO L226 Difference]: Without dead ends: 617 [2021-06-05 14:21:28,759 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 750.4ms TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:21:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-06-05 14:21:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 472. [2021-06-05 14:21:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 471 states have (on average 3.26963906581741) internal successors, (1540), 471 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1540 transitions. [2021-06-05 14:21:28,764 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1540 transitions. Word has length 18 [2021-06-05 14:21:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:28,765 INFO L482 AbstractCegarLoop]: Abstraction has 472 states and 1540 transitions. [2021-06-05 14:21:28,765 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:21:28,765 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1540 transitions. [2021-06-05 14:21:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:28,765 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:28,765 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:28,965 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2864,262 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:28,966 INFO L430 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:28,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:28,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1976445854, now seen corresponding path program 116 times [2021-06-05 14:21:28,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:28,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11276627] [2021-06-05 14:21:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:21:29,031 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:29,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11276627] [2021-06-05 14:21:29,031 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11276627] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:29,031 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069083925] [2021-06-05 14:21:29,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 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:21:29,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:21:29,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:29,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 14:21:29,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:29,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 18 treesize of output 14 [2021-06-05 14:21:29,079 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:29,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 7 treesize of output 5 [2021-06-05 14:21:29,081 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:29,090 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:29,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 10 treesize of output 6 [2021-06-05 14:21:29,093 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:29,101 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:29,102 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:29,102 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:21 [2021-06-05 14:21:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:21:29,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069083925] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:29,195 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:29,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 14:21:29,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096997711] [2021-06-05 14:21:29,195 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:21:29,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:21:29,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:21:29,195 INFO L87 Difference]: Start difference. First operand 472 states and 1540 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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:21:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:29,783 INFO L93 Difference]: Finished difference Result 959 states and 2931 transitions. [2021-06-05 14:21:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:21:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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:21:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:29,785 INFO L225 Difference]: With dead ends: 959 [2021-06-05 14:21:29,785 INFO L226 Difference]: Without dead ends: 887 [2021-06-05 14:21:29,785 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 508.5ms TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:21:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-06-05 14:21:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 546. [2021-06-05 14:21:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 3.388990825688073) internal successors, (1847), 545 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1847 transitions. [2021-06-05 14:21:29,792 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1847 transitions. Word has length 18 [2021-06-05 14:21:29,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:29,792 INFO L482 AbstractCegarLoop]: Abstraction has 546 states and 1847 transitions. [2021-06-05 14:21:29,792 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 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:21:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1847 transitions. [2021-06-05 14:21:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:29,793 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:29,793 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:29,993 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2880,263 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:29,993 INFO L430 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2058487706, now seen corresponding path program 117 times [2021-06-05 14:21:29,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:29,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340598820] [2021-06-05 14:21:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:30,283 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:30,283 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340598820] [2021-06-05 14:21:30,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340598820] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:30,283 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598790286] [2021-06-05 14:21:30,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:21:30,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:21:30,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:30,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:30,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:30,370 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:30,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:30,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:21:30,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:30,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:30,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:30,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:30,376 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:30,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:30,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:30,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 15 treesize of output 11 [2021-06-05 14:21:30,379 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:30,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:30,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:21:30,382 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:30,410 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:30,411 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:30,411 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:87 [2021-06-05 14:21:30,668 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 14:21:30,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:30,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 17 treesize of output 13 [2021-06-05 14:21:30,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:30,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:30,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:21:30,676 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:30,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:30,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 27 treesize of output 21 [2021-06-05 14:21:30,680 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:30,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:30,683 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:30,735 INFO L628 ElimStorePlain]: treesize reduction 82, result has 40.1 percent of original size [2021-06-05 14:21:30,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:30,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 11 treesize of output 7 [2021-06-05 14:21:30,739 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:30,756 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:30,758 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:30,758 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:167, output treesize:35 [2021-06-05 14:21:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:30,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598790286] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:30,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:30,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:21:30,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037704142] [2021-06-05 14:21:30,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:21:30,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:30,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:21:30,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:21:30,817 INFO L87 Difference]: Start difference. First operand 546 states and 1847 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:21:31,200 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2021-06-05 14:21:31,495 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2021-06-05 14:21:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:31,837 INFO L93 Difference]: Finished difference Result 669 states and 2169 transitions. [2021-06-05 14:21:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:21:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:21:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:31,838 INFO L225 Difference]: With dead ends: 669 [2021-06-05 14:21:31,838 INFO L226 Difference]: Without dead ends: 664 [2021-06-05 14:21:31,838 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1121.3ms TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:21:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-06-05 14:21:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 544. [2021-06-05 14:21:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.394106813996317) internal successors, (1843), 543 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1843 transitions. [2021-06-05 14:21:31,844 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1843 transitions. Word has length 18 [2021-06-05 14:21:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:31,844 INFO L482 AbstractCegarLoop]: Abstraction has 544 states and 1843 transitions. [2021-06-05 14:21:31,844 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:21:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1843 transitions. [2021-06-05 14:21:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:31,845 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:31,845 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:32,045 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 264 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2887 [2021-06-05 14:21:32,046 INFO L430 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash -264932768, now seen corresponding path program 118 times [2021-06-05 14:21:32,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:32,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248572562] [2021-06-05 14:21:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:32,110 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:32,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248572562] [2021-06-05 14:21:32,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248572562] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:32,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916067451] [2021-06-05 14:21:32,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 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:21:32,135 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:21:32,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:32,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:21:32,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:32,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:32,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 25 treesize of output 19 [2021-06-05 14:21:32,195 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,197 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:32,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 16 treesize of output 12 [2021-06-05 14:21:32,198 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:32,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 26 treesize of output 20 [2021-06-05 14:21:32,201 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,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:21:32,203 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,227 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:32,228 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:32,228 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:75 [2021-06-05 14:21:32,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:32,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:21:32,322 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:21:32,324 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,326 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:21:32,327 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,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 7 treesize of output 5 [2021-06-05 14:21:32,330 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:21:32,332 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,334 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:21:32,335 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,336 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:21:32,337 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,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 16 treesize of output 12 [2021-06-05 14:21:32,339 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:32,364 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 14:21:32,364 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:21:32,365 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:32,365 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 14:21:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:32,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916067451] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:32,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:32,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2021-06-05 14:21:32,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435554674] [2021-06-05 14:21:32,401 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:21:32,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:32,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:21:32,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:21:32,401 INFO L87 Difference]: Start difference. First operand 544 states and 1843 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:21:33,838 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2021-06-05 14:21:33,973 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2021-06-05 14:21:34,680 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-05 14:21:35,497 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 14:21:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:35,740 INFO L93 Difference]: Finished difference Result 1295 states and 3899 transitions. [2021-06-05 14:21:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 14:21:35,740 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:21:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:35,742 INFO L225 Difference]: With dead ends: 1295 [2021-06-05 14:21:35,742 INFO L226 Difference]: Without dead ends: 1202 [2021-06-05 14:21:35,742 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 2768.6ms TimeCoverageRelationStatistics Valid=603, Invalid=2477, Unknown=0, NotChecked=0, Total=3080 [2021-06-05 14:21:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2021-06-05 14:21:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 636. [2021-06-05 14:21:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.5716535433070864) internal successors, (2268), 635 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2268 transitions. [2021-06-05 14:21:35,753 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2268 transitions. Word has length 18 [2021-06-05 14:21:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:35,753 INFO L482 AbstractCegarLoop]: Abstraction has 636 states and 2268 transitions. [2021-06-05 14:21:35,753 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:21:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2268 transitions. [2021-06-05 14:21:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:35,753 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:35,753 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:35,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2904,265 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:35,954 INFO L430 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:35,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:35,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1095578010, now seen corresponding path program 119 times [2021-06-05 14:21:35,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:35,954 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244398807] [2021-06-05 14:21:35,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:36,148 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:36,148 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244398807] [2021-06-05 14:21:36,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244398807] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:36,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092305008] [2021-06-05 14:21:36,149 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 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:21:36,178 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:21:36,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:36,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:36,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:36,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:36,317 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:36,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 25 treesize of output 19 [2021-06-05 14:21:36,318 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:36,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:36,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:36,322 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:36,349 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:36,351 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:21:36,351 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:71 [2021-06-05 14:21:36,480 INFO L446 ElimStorePlain]: Different costs {0=[array_4, v_prenex_762], 1=[array_2, v_prenex_761]} [2021-06-05 14:21:36,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 25 treesize of output 19 [2021-06-05 14:21:36,484 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:36,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 15 treesize of output 11 [2021-06-05 14:21:36,487 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:36,519 INFO L628 ElimStorePlain]: treesize reduction 59, result has 44.3 percent of original size [2021-06-05 14:21:36,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 19 treesize of output 15 [2021-06-05 14:21:36,521 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:36,532 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:36,532 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:21:36,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:36,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 12 treesize of output 8 [2021-06-05 14:21:36,535 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:36,545 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:36,546 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:36,546 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 14:21:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:36,561 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092305008] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:36,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:36,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:21:36,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286634845] [2021-06-05 14:21:36,561 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:21:36,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:36,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:21:36,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:21:36,562 INFO L87 Difference]: Start difference. First operand 636 states and 2268 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:21:36,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:36,902 INFO L93 Difference]: Finished difference Result 730 states and 2543 transitions. [2021-06-05 14:21:36,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:36,902 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:21:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:36,903 INFO L225 Difference]: With dead ends: 730 [2021-06-05 14:21:36,903 INFO L226 Difference]: Without dead ends: 725 [2021-06-05 14:21:36,904 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 408.7ms TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:21:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-06-05 14:21:36,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 642. [2021-06-05 14:21:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.5709828393135727) internal successors, (2289), 641 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2289 transitions. [2021-06-05 14:21:36,911 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2289 transitions. Word has length 18 [2021-06-05 14:21:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:36,911 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2289 transitions. [2021-06-05 14:21:36,911 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:21:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2289 transitions. [2021-06-05 14:21:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:36,911 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:36,911 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:37,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 266 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2915 [2021-06-05 14:21:37,112 INFO L430 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:37,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:37,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1259400540, now seen corresponding path program 120 times [2021-06-05 14:21:37,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:37,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221401373] [2021-06-05 14:21:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:37,292 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:37,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221401373] [2021-06-05 14:21:37,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221401373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:37,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968530218] [2021-06-05 14:21:37,292 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 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:21:37,325 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:21:37,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:37,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:37,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:37,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:37,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21: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 25 treesize of output 19 [2021-06-05 14:21:37,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:37,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:37,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:37,473 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:37,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:37,502 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:21:37,502 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:89, output treesize:71 [2021-06-05 14:21:37,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:37,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:37,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 27 treesize of output 21 [2021-06-05 14:21:37,594 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:37,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:37,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 17 treesize of output 13 [2021-06-05 14:21:37,598 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:37,652 INFO L628 ElimStorePlain]: treesize reduction 93, result has 40.0 percent of original size [2021-06-05 14:21:37,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 11 treesize of output 7 [2021-06-05 14:21:37,656 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:37,675 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:37,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 7 treesize of output 5 [2021-06-05 14:21:37,678 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:37,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:37,703 INFO L518 ElimStorePlain]: Eliminatee v_prenex_765 vanished before elimination [2021-06-05 14:21:37,704 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:37,704 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:167, output treesize:35 [2021-06-05 14:21:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:37,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968530218] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:37,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:37,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:21:37,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362400579] [2021-06-05 14:21:37,753 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:21:37,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:37,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:21:37,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:21:37,754 INFO L87 Difference]: Start difference. First operand 642 states and 2289 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:21:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:38,082 INFO L93 Difference]: Finished difference Result 740 states and 2575 transitions. [2021-06-05 14:21:38,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:38,083 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:21:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:38,084 INFO L225 Difference]: With dead ends: 740 [2021-06-05 14:21:38,084 INFO L226 Difference]: Without dead ends: 735 [2021-06-05 14:21:38,084 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 362.6ms TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:21:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-06-05 14:21:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 636. [2021-06-05 14:21:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.5716535433070864) internal successors, (2268), 635 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2268 transitions. [2021-06-05 14:21:38,091 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2268 transitions. Word has length 18 [2021-06-05 14:21:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:38,091 INFO L482 AbstractCegarLoop]: Abstraction has 636 states and 2268 transitions. [2021-06-05 14:21:38,091 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:21:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2268 transitions. [2021-06-05 14:21:38,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:38,092 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:38,092 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:38,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2932,267 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:38,292 INFO L430 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:38,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:38,292 INFO L82 PathProgramCache]: Analyzing trace with hash 385659860, now seen corresponding path program 121 times [2021-06-05 14:21:38,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:38,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241408437] [2021-06-05 14:21:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:38,467 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:38,467 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241408437] [2021-06-05 14:21:38,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241408437] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:38,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408409431] [2021-06-05 14:21:38,468 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 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:21:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:38,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:38,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:38,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:38,605 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:38,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 15 treesize of output 11 [2021-06-05 14:21:38,607 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:38,621 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:38,622 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:38,622 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 14:21:38,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:38,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:38,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:38,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:38,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 27 treesize of output 21 [2021-06-05 14:21:38,672 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:38,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:38,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:21:38,676 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:38,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 15 treesize of output 11 [2021-06-05 14:21:38,678 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:38,715 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 14:21:38,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:21:38,717 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:38,731 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:38,732 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:38,732 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 14:21:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:38,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408409431] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:38,795 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:38,795 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:38,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593292363] [2021-06-05 14:21:38,795 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:38,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:38,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:38,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:38,796 INFO L87 Difference]: Start difference. First operand 636 states and 2268 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:39,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:39,460 INFO L93 Difference]: Finished difference Result 735 states and 2565 transitions. [2021-06-05 14:21:39,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:39,461 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:39,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:39,462 INFO L225 Difference]: With dead ends: 735 [2021-06-05 14:21:39,462 INFO L226 Difference]: Without dead ends: 730 [2021-06-05 14:21:39,462 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 679.6ms TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:21:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-06-05 14:21:39,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 636. [2021-06-05 14:21:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 3.5716535433070864) internal successors, (2268), 635 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 2268 transitions. [2021-06-05 14:21:39,469 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 2268 transitions. Word has length 18 [2021-06-05 14:21:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:39,469 INFO L482 AbstractCegarLoop]: Abstraction has 636 states and 2268 transitions. [2021-06-05 14:21:39,469 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 2268 transitions. [2021-06-05 14:21:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:39,470 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:39,470 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:39,670 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2949,268 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:39,671 INFO L430 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:39,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:39,671 INFO L82 PathProgramCache]: Analyzing trace with hash 934576270, now seen corresponding path program 122 times [2021-06-05 14:21:39,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:39,671 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020931176] [2021-06-05 14:21:39,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:39,902 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:39,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020931176] [2021-06-05 14:21:39,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020931176] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:39,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881864649] [2021-06-05 14:21:39,902 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 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:21:39,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:21:39,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:39,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:39,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:40,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:40,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:40,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:21:40,021 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:40,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:40,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:40,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 16 treesize of output 12 [2021-06-05 14:21:40,025 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:40,028 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:40,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:40,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:21:40,029 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:40,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:40,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:40,033 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:40,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:40,084 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:40,084 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 14:21:40,404 INFO L446 ElimStorePlain]: Different costs {0=[array_4, v_prenex_770], 1=[v_prenex_769, array_2]} [2021-06-05 14:21:40,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 17 treesize of output 13 [2021-06-05 14:21:40,409 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:40,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 19 treesize of output 15 [2021-06-05 14:21:40,412 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:40,445 INFO L628 ElimStorePlain]: treesize reduction 63, result has 43.2 percent of original size [2021-06-05 14:21:40,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 7 treesize of output 5 [2021-06-05 14:21:40,448 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:40,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:40,459 INFO L518 ElimStorePlain]: Eliminatee v_prenex_769 vanished before elimination [2021-06-05 14:21:40,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:40,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 12 treesize of output 8 [2021-06-05 14:21:40,462 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:40,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:40,473 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:40,474 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 14:21:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:40,489 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881864649] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:40,489 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:40,489 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:21:40,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681627530] [2021-06-05 14:21:40,489 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:21:40,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:40,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:21:40,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:21:40,490 INFO L87 Difference]: Start difference. First operand 636 states and 2268 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:21:40,737 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2021-06-05 14:21:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:40,935 INFO L93 Difference]: Finished difference Result 733 states and 2549 transitions. [2021-06-05 14:21:40,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:40,935 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:21:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:40,936 INFO L225 Difference]: With dead ends: 733 [2021-06-05 14:21:40,936 INFO L226 Difference]: Without dead ends: 728 [2021-06-05 14:21:40,936 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 701.2ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2021-06-05 14:21:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 640. [2021-06-05 14:21:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 3.575899843505477) internal successors, (2285), 639 states have internal predecessors, (2285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 2285 transitions. [2021-06-05 14:21:40,943 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 2285 transitions. Word has length 18 [2021-06-05 14:21:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:40,944 INFO L482 AbstractCegarLoop]: Abstraction has 640 states and 2285 transitions. [2021-06-05 14:21:40,944 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:21:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 2285 transitions. [2021-06-05 14:21:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:40,944 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:40,944 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:41,145 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 269 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2959 [2021-06-05 14:21:41,145 INFO L430 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:41,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:41,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1005412476, now seen corresponding path program 123 times [2021-06-05 14:21:41,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:41,145 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151128701] [2021-06-05 14:21:41,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:41,366 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:41,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151128701] [2021-06-05 14:21:41,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151128701] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:41,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098050192] [2021-06-05 14:21:41,367 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 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:21:41,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:21:41,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:41,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:41,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:41,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:41,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:41,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:21:41,486 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:41,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:41,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:41,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:41,490 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:41,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:41,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:41,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 16 treesize of output 12 [2021-06-05 14:21:41,494 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:41,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:41,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:21:41,498 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:41,537 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:41,538 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:41,538 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:119 [2021-06-05 14:21:41,739 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_2]} [2021-06-05 14:21:41,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:41,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 25 treesize of output 19 [2021-06-05 14:21:41,743 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:41,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:41,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 27 treesize of output 21 [2021-06-05 14:21:41,747 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:41,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:41,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 17 treesize of output 13 [2021-06-05 14:21:41,751 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:41,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:41,755 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:41,799 INFO L628 ElimStorePlain]: treesize reduction 76, result has 42.0 percent of original size [2021-06-05 14:21:41,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:41,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:21:41,803 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:41,821 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:41,823 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:41,823 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:167, output treesize:35 [2021-06-05 14:21:41,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:41,874 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098050192] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:41,874 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:41,874 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:21:41,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122720254] [2021-06-05 14:21:41,874 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:21:41,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:41,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:21:41,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:21:41,874 INFO L87 Difference]: Start difference. First operand 640 states and 2285 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:21:42,147 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2021-06-05 14:21:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:42,499 INFO L93 Difference]: Finished difference Result 749 states and 2603 transitions. [2021-06-05 14:21:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:42,500 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:21:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:42,501 INFO L225 Difference]: With dead ends: 749 [2021-06-05 14:21:42,501 INFO L226 Difference]: Without dead ends: 744 [2021-06-05 14:21:42,501 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 728.0ms TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:21:42,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2021-06-05 14:21:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 635. [2021-06-05 14:21:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 3.5709779179810726) internal successors, (2264), 634 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 2264 transitions. [2021-06-05 14:21:42,508 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 2264 transitions. Word has length 18 [2021-06-05 14:21:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:42,508 INFO L482 AbstractCegarLoop]: Abstraction has 635 states and 2264 transitions. [2021-06-05 14:21:42,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 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:21:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 2264 transitions. [2021-06-05 14:21:42,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:42,509 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:42,509 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:42,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2978,270 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:42,710 INFO L430 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:42,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1141669252, now seen corresponding path program 124 times [2021-06-05 14:21:42,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:42,710 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780821982] [2021-06-05 14:21:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:42,913 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:42,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780821982] [2021-06-05 14:21:42,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780821982] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:42,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291890458] [2021-06-05 14:21:42,913 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 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:21:42,939 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:21:42,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:42,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 14:21:42,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:43,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:43,043 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:43,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 15 treesize of output 11 [2021-06-05 14:21:43,044 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:43,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:43,047 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:43,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 25 treesize of output 19 [2021-06-05 14:21:43,048 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:43,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:43,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:43,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:21:43,052 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:43,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:43,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 16 treesize of output 12 [2021-06-05 14:21:43,056 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:43,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:43,115 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:43,115 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:193, output treesize:157 [2021-06-05 14:21:43,339 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 14:21:43,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:43,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 25 treesize of output 19 [2021-06-05 14:21:43,344 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:43,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:43,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:21:43,347 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:43,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:43,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:21:43,351 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:43,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:21:43,355 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:43,425 INFO L628 ElimStorePlain]: treesize reduction 93, result has 45.0 percent of original size [2021-06-05 14:21:43,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:43,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:21:43,429 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:43,457 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:43,458 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:43,458 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:197, output treesize:50 [2021-06-05 14:21:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:43,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291890458] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:43,576 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:43,576 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 14:21:43,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746012907] [2021-06-05 14:21:43,576 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:21:43,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:43,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:21:43,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:21:43,577 INFO L87 Difference]: Start difference. First operand 635 states and 2264 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:21:43,891 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2021-06-05 14:21:44,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:44,105 INFO L93 Difference]: Finished difference Result 739 states and 2574 transitions. [2021-06-05 14:21:44,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:44,106 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:21:44,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:44,107 INFO L225 Difference]: With dead ends: 739 [2021-06-05 14:21:44,107 INFO L226 Difference]: Without dead ends: 726 [2021-06-05 14:21:44,107 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 712.9ms TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:21:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-06-05 14:21:44,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 642. [2021-06-05 14:21:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.574102964118565) internal successors, (2291), 641 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2291 transitions. [2021-06-05 14:21:44,119 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2291 transitions. Word has length 18 [2021-06-05 14:21:44,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:44,119 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2291 transitions. [2021-06-05 14:21:44,119 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:21:44,119 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2291 transitions. [2021-06-05 14:21:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:44,120 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:44,120 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:44,320 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 271 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2992 [2021-06-05 14:21:44,321 INFO L430 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:44,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1750500672, now seen corresponding path program 125 times [2021-06-05 14:21:44,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:44,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862868437] [2021-06-05 14:21:44,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:44,541 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:44,542 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862868437] [2021-06-05 14:21:44,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862868437] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:44,542 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437940913] [2021-06-05 14:21:44,542 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 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:21:44,568 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:21:44,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:44,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:44,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:44,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 25 treesize of output 19 [2021-06-05 14:21:44,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:44,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 15 treesize of output 11 [2021-06-05 14:21:44,670 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:44,686 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:44,686 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:44,686 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 14:21:44,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:44,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 25 treesize of output 19 [2021-06-05 14:21:44,734 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:44,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:44,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 35 treesize of output 27 [2021-06-05 14:21:44,737 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:44,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:44,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:44,740 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:44,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 25 treesize of output 19 [2021-06-05 14:21:44,743 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:44,778 INFO L628 ElimStorePlain]: treesize reduction 74, result has 36.8 percent of original size [2021-06-05 14:21:44,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:21:44,781 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:44,795 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:44,795 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:44,795 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:21:44,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:44,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437940913] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:44,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:44,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:44,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695543305] [2021-06-05 14:21:44,856 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:44,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:44,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:44,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:44,856 INFO L87 Difference]: Start difference. First operand 642 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:45,588 INFO L93 Difference]: Finished difference Result 769 states and 2676 transitions. [2021-06-05 14:21:45,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:21:45,588 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:45,589 INFO L225 Difference]: With dead ends: 769 [2021-06-05 14:21:45,589 INFO L226 Difference]: Without dead ends: 764 [2021-06-05 14:21:45,590 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 736.8ms TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:21:45,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-06-05 14:21:45,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 642. [2021-06-05 14:21:45,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.574102964118565) internal successors, (2291), 641 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2291 transitions. [2021-06-05 14:21:45,597 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2291 transitions. Word has length 18 [2021-06-05 14:21:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:45,597 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2291 transitions. [2021-06-05 14:21:45,597 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2291 transitions. [2021-06-05 14:21:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:45,598 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:45,598 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:45,798 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3008,272 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:45,798 INFO L430 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:45,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1973011818, now seen corresponding path program 126 times [2021-06-05 14:21:45,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:45,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301876334] [2021-06-05 14:21:45,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:45,984 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:45,985 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301876334] [2021-06-05 14:21:45,985 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301876334] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:45,985 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042958306] [2021-06-05 14:21:45,985 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 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:21:46,011 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:21:46,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:46,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:46,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:46,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21: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 25 treesize of output 19 [2021-06-05 14:21:46,097 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:46,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:21:46,099 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:46,116 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:46,117 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:46,117 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:49 [2021-06-05 14:21:46,201 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_779, array_0], 1=[array_4, v_prenex_780]} [2021-06-05 14:21:46,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:21:46,204 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:46,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 17 treesize of output 13 [2021-06-05 14:21:46,207 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:46,246 INFO L628 ElimStorePlain]: treesize reduction 75, result has 42.7 percent of original size [2021-06-05 14:21:46,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 7 treesize of output 5 [2021-06-05 14:21:46,249 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:46,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:46,262 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:21:46,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 22 treesize of output 14 [2021-06-05 14:21:46,265 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:46,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:46,278 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:46,278 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 14:21:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:46,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042958306] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:46,339 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:46,340 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:46,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833562514] [2021-06-05 14:21:46,340 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:46,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:46,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:46,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:46,340 INFO L87 Difference]: Start difference. First operand 642 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:47,192 INFO L93 Difference]: Finished difference Result 826 states and 2842 transitions. [2021-06-05 14:21:47,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:21:47,192 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:47,194 INFO L225 Difference]: With dead ends: 826 [2021-06-05 14:21:47,194 INFO L226 Difference]: Without dead ends: 816 [2021-06-05 14:21:47,194 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 794.1ms TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:21:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-06-05 14:21:47,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 642. [2021-06-05 14:21:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.574102964118565) internal successors, (2291), 641 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2291 transitions. [2021-06-05 14:21:47,201 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2291 transitions. Word has length 18 [2021-06-05 14:21:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:47,202 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2291 transitions. [2021-06-05 14:21:47,202 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2291 transitions. [2021-06-05 14:21:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:47,202 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:47,202 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:47,403 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3018,273 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:47,403 INFO L430 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash -881797318, now seen corresponding path program 127 times [2021-06-05 14:21:47,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:47,403 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824117715] [2021-06-05 14:21:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:47,604 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:47,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824117715] [2021-06-05 14:21:47,604 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824117715] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:47,604 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858727682] [2021-06-05 14:21:47,604 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 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:21:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:47,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 14:21:47,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:47,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:47,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:47,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:21:47,768 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:47,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:47,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 25 treesize of output 19 [2021-06-05 14:21:47,772 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:47,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:47,795 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:21:47,795 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:66 [2021-06-05 14:21:47,861 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 14:21:47,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:47,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 25 treesize of output 19 [2021-06-05 14:21:47,866 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:47,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:47,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 35 treesize of output 27 [2021-06-05 14:21:47,870 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:47,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:47,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 15 treesize of output 11 [2021-06-05 14:21:47,874 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:47,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:47,877 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:47,921 INFO L628 ElimStorePlain]: treesize reduction 86, result has 39.0 percent of original size [2021-06-05 14:21:47,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:47,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 11 treesize of output 7 [2021-06-05 14:21:47,924 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:47,942 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:47,943 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:47,943 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 14:21:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:48,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858727682] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:48,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:48,013 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 14:21:48,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530067325] [2021-06-05 14:21:48,014 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:48,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:48,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:48,014 INFO L87 Difference]: Start difference. First operand 642 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:21:48,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:48,589 INFO L93 Difference]: Finished difference Result 738 states and 2579 transitions. [2021-06-05 14:21:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:48,589 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:21:48,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:48,591 INFO L225 Difference]: With dead ends: 738 [2021-06-05 14:21:48,591 INFO L226 Difference]: Without dead ends: 733 [2021-06-05 14:21:48,591 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 596.6ms TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:21:48,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2021-06-05 14:21:48,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 639. [2021-06-05 14:21:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 3.5768025078369905) internal successors, (2282), 638 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 2282 transitions. [2021-06-05 14:21:48,598 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 2282 transitions. Word has length 18 [2021-06-05 14:21:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:48,598 INFO L482 AbstractCegarLoop]: Abstraction has 639 states and 2282 transitions. [2021-06-05 14:21:48,598 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:21:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 2282 transitions. [2021-06-05 14:21:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:48,599 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:48,599 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:48,799 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 274 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3032 [2021-06-05 14:21:48,799 INFO L430 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:48,800 INFO L82 PathProgramCache]: Analyzing trace with hash -125787926, now seen corresponding path program 128 times [2021-06-05 14:21:48,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:48,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138543718] [2021-06-05 14:21:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:49,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:49,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138543718] [2021-06-05 14:21:49,041 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138543718] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:49,041 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124829058] [2021-06-05 14:21:49,041 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 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:21:49,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:21:49,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:49,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:49,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:49,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:49,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:49,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:21:49,177 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:49,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:49,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:49,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 26 treesize of output 20 [2021-06-05 14:21:49,196 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:49,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:49,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:49,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 25 treesize of output 19 [2021-06-05 14:21:49,201 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:49,205 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:49,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:21:49,206 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:49,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:49,245 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:49,245 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:123 [2021-06-05 14:21:49,434 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 14:21:49,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:49,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 25 treesize of output 19 [2021-06-05 14:21:49,439 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:49,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:49,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 25 treesize of output 19 [2021-06-05 14:21:49,443 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:49,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:49,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:21:49,447 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:49,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:21:49,450 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:49,494 INFO L628 ElimStorePlain]: treesize reduction 80, result has 43.3 percent of original size [2021-06-05 14:21:49,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:49,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 22 treesize of output 14 [2021-06-05 14:21:49,497 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:49,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:49,516 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:49,516 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 14:21:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:49,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124829058] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:49,578 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:49,578 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:21:49,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934937491] [2021-06-05 14:21:49,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:21:49,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:49,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:21:49,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:21:49,578 INFO L87 Difference]: Start difference. First operand 639 states and 2282 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:21:49,835 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2021-06-05 14:21:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:50,062 INFO L93 Difference]: Finished difference Result 740 states and 2591 transitions. [2021-06-05 14:21:50,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:50,062 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:21:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:50,063 INFO L225 Difference]: With dead ends: 740 [2021-06-05 14:21:50,063 INFO L226 Difference]: Without dead ends: 735 [2021-06-05 14:21:50,063 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 680.2ms TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:21:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-06-05 14:21:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 641. [2021-06-05 14:21:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 3.5796875) internal successors, (2291), 640 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 2291 transitions. [2021-06-05 14:21:50,071 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 2291 transitions. Word has length 18 [2021-06-05 14:21:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:50,071 INFO L482 AbstractCegarLoop]: Abstraction has 641 states and 2291 transitions. [2021-06-05 14:21:50,071 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:21:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 2291 transitions. [2021-06-05 14:21:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:50,071 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:50,071 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:50,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 275 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3044 [2021-06-05 14:21:50,272 INFO L430 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash -360500806, now seen corresponding path program 129 times [2021-06-05 14:21:50,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:50,272 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887667855] [2021-06-05 14:21:50,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:50,532 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:50,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887667855] [2021-06-05 14:21:50,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887667855] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:50,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616090526] [2021-06-05 14:21:50,532 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 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:21:50,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:21:50,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:50,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:50,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:50,629 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:50,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:21:50,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:50,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:50,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 15 treesize of output 11 [2021-06-05 14:21:50,633 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:50,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:50,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:50,636 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:50,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 16 treesize of output 12 [2021-06-05 14:21:50,639 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:50,662 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:50,663 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:50,663 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 14:21:50,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:50,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 25 treesize of output 19 [2021-06-05 14:21:50,787 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:50,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:50,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:21:50,791 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:50,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:50,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 15 treesize of output 11 [2021-06-05 14:21:50,794 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:50,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:50,797 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:50,831 INFO L628 ElimStorePlain]: treesize reduction 78, result has 35.5 percent of original size [2021-06-05 14:21: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 11 treesize of output 7 [2021-06-05 14:21:50,834 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:50,847 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:50,848 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:50,848 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:21:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:50,911 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616090526] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:50,911 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:50,911 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:50,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16714804] [2021-06-05 14:21:50,911 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:50,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:50,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:50,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:50,912 INFO L87 Difference]: Start difference. First operand 641 states and 2291 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:51,814 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-05 14:21:51,956 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2021-06-05 14:21:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:52,032 INFO L93 Difference]: Finished difference Result 830 states and 2856 transitions. [2021-06-05 14:21:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:21:52,032 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:52,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:52,033 INFO L225 Difference]: With dead ends: 830 [2021-06-05 14:21:52,033 INFO L226 Difference]: Without dead ends: 825 [2021-06-05 14:21:52,033 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1118.5ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:21:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2021-06-05 14:21:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 643. [2021-06-05 14:21:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 3.5794392523364484) internal successors, (2298), 642 states have internal predecessors, (2298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 2298 transitions. [2021-06-05 14:21:52,041 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 2298 transitions. Word has length 18 [2021-06-05 14:21:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:52,041 INFO L482 AbstractCegarLoop]: Abstraction has 643 states and 2298 transitions. [2021-06-05 14:21:52,041 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:52,041 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 2298 transitions. [2021-06-05 14:21:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:52,042 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:52,042 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:52,242 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3058,276 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:52,242 INFO L430 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:52,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:52,243 INFO L82 PathProgramCache]: Analyzing trace with hash 914447872, now seen corresponding path program 130 times [2021-06-05 14:21:52,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:52,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345452299] [2021-06-05 14:21:52,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:52,553 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:52,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345452299] [2021-06-05 14:21:52,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345452299] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:52,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506904581] [2021-06-05 14:21:52,553 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 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:21:52,578 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:21:52,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:52,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:21:52,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:52,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:52,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:52,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:21:52,642 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:52,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:52,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:52,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:21:52,646 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:52,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:52,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:52,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:52,649 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:52,652 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:52,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 16 treesize of output 12 [2021-06-05 14:21:52,652 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:52,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:52,692 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:21:52,692 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 14:21:52,958 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 14:21:52,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:52,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:21:52,962 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:52,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:52,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:21:52,966 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:52,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:52,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:52,971 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:52,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:21:52,974 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:53,037 INFO L628 ElimStorePlain]: treesize reduction 91, result has 43.5 percent of original size [2021-06-05 14:21:53,040 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:53,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:21:53,041 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:53,068 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:53,069 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:53,069 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:197, output treesize:50 [2021-06-05 14:21:53,159 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:53,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506904581] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:53,159 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:53,159 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 14:21:53,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704195688] [2021-06-05 14:21:53,159 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:21:53,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:53,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:21:53,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:21:53,160 INFO L87 Difference]: Start difference. First operand 643 states and 2298 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:21:53,385 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2021-06-05 14:21:53,540 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2021-06-05 14:21:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:53,776 INFO L93 Difference]: Finished difference Result 770 states and 2654 transitions. [2021-06-05 14:21:53,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:53,776 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:21:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:53,777 INFO L225 Difference]: With dead ends: 770 [2021-06-05 14:21:53,777 INFO L226 Difference]: Without dead ends: 757 [2021-06-05 14:21:53,778 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 891.0ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:21:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2021-06-05 14:21:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 642. [2021-06-05 14:21:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.578783151326053) internal successors, (2294), 641 states have internal predecessors, (2294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 2294 transitions. [2021-06-05 14:21:53,788 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 2294 transitions. Word has length 18 [2021-06-05 14:21:53,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:53,788 INFO L482 AbstractCegarLoop]: Abstraction has 642 states and 2294 transitions. [2021-06-05 14:21:53,788 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:21:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 2294 transitions. [2021-06-05 14:21:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:53,789 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:53,789 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:54,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 277 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3072 [2021-06-05 14:21:54,005 INFO L430 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:54,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash 903035708, now seen corresponding path program 131 times [2021-06-05 14:21:54,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:54,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970675748] [2021-06-05 14:21:54,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:21:54,053 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:54,053 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970675748] [2021-06-05 14:21:54,053 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970675748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:54,054 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887259178] [2021-06-05 14:21:54,054 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 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:21:54,079 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:21:54,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:54,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 14:21:54,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:54,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 18 treesize of output 14 [2021-06-05 14:21:54,112 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:54,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 7 treesize of output 5 [2021-06-05 14:21:54,114 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:54,125 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:54,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 10 treesize of output 6 [2021-06-05 14:21:54,128 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:54,139 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:54,139 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:54,140 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 14:21:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:21:54,213 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887259178] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:54,213 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:54,213 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 14:21:54,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178670493] [2021-06-05 14:21:54,213 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:21:54,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:54,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:21:54,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:21:54,213 INFO L87 Difference]: Start difference. First operand 642 states and 2294 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:21:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:54,733 INFO L93 Difference]: Finished difference Result 1043 states and 3413 transitions. [2021-06-05 14:21:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:21:54,733 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:21:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:54,734 INFO L225 Difference]: With dead ends: 1043 [2021-06-05 14:21:54,734 INFO L226 Difference]: Without dead ends: 951 [2021-06-05 14:21:54,735 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 452.1ms TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:21:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2021-06-05 14:21:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 719. [2021-06-05 14:21:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 718 states have (on average 3.628133704735376) internal successors, (2605), 718 states have internal predecessors, (2605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 2605 transitions. [2021-06-05 14:21:54,744 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 2605 transitions. Word has length 18 [2021-06-05 14:21:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:54,744 INFO L482 AbstractCegarLoop]: Abstraction has 719 states and 2605 transitions. [2021-06-05 14:21:54,744 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:21:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 2605 transitions. [2021-06-05 14:21:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:54,745 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:54,745 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:54,945 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 278 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3085 [2021-06-05 14:21:54,945 INFO L430 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:54,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:54,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1742014878, now seen corresponding path program 132 times [2021-06-05 14:21:54,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:54,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889667532] [2021-06-05 14:21:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:55,194 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:55,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889667532] [2021-06-05 14:21:55,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889667532] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:55,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955424635] [2021-06-05 14:21:55,195 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 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:21:55,221 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:21:55,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:55,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:55,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:55,302 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:55,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 25 treesize of output 19 [2021-06-05 14:21:55,303 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:55,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:21:55,306 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:55,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:55,325 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:55,325 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-06-05 14:21:55,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 27 treesize of output 21 [2021-06-05 14:21:55,423 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:55,428 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:55,428 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:21:55,429 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:55,429 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:21:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:55,454 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955424635] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:55,454 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:55,454 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:21:55,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444776781] [2021-06-05 14:21:55,454 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:21:55,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:55,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:21:55,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:21:55,455 INFO L87 Difference]: Start difference. First operand 719 states and 2605 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:56,118 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2021-06-05 14:21:56,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:56,163 INFO L93 Difference]: Finished difference Result 816 states and 2879 transitions. [2021-06-05 14:21:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:21:56,164 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:56,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:56,165 INFO L225 Difference]: With dead ends: 816 [2021-06-05 14:21:56,165 INFO L226 Difference]: Without dead ends: 811 [2021-06-05 14:21:56,165 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 761.4ms TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:21:56,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-06-05 14:21:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 729. [2021-06-05 14:21:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 3.6263736263736264) internal successors, (2640), 728 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 2640 transitions. [2021-06-05 14:21:56,173 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 2640 transitions. Word has length 18 [2021-06-05 14:21:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:56,173 INFO L482 AbstractCegarLoop]: Abstraction has 729 states and 2640 transitions. [2021-06-05 14:21:56,173 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 2640 transitions. [2021-06-05 14:21:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:56,174 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:56,174 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:56,374 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3093,279 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:21:56,375 INFO L430 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash -885518932, now seen corresponding path program 133 times [2021-06-05 14:21:56,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:56,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178615200] [2021-06-05 14:21:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:56,688 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:56,688 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178615200] [2021-06-05 14:21:56,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178615200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:56,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793957188] [2021-06-05 14:21:56,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 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:21:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:56,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:21:56,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:56,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:56,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:56,799 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:56,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:21:56,802 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:56,820 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:56,821 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:56,821 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2021-06-05 14:21:56,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:56,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:56,955 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:56,957 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:56,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:21:56,958 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:56,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:56,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 15 treesize of output 11 [2021-06-05 14:21:56,962 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:56,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 25 treesize of output 19 [2021-06-05 14:21:56,965 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:57,003 INFO L628 ElimStorePlain]: treesize reduction 67, result has 43.7 percent of original size [2021-06-05 14:21:57,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 14 [2021-06-05 14:21:57,006 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:57,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:57,021 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:57,021 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 14:21:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:57,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793957188] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:57,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:57,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:21:57,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200184670] [2021-06-05 14:21:57,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:21:57,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:57,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:21:57,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:21:57,095 INFO L87 Difference]: Start difference. First operand 729 states and 2640 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:57,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:57,800 INFO L93 Difference]: Finished difference Result 842 states and 2944 transitions. [2021-06-05 14:21:57,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:21:57,801 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:57,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:57,802 INFO L225 Difference]: With dead ends: 842 [2021-06-05 14:21:57,802 INFO L226 Difference]: Without dead ends: 824 [2021-06-05 14:21:57,802 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 827.2ms TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:21:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-06-05 14:21:57,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 732. [2021-06-05 14:21:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 3.6238030095759233) internal successors, (2649), 731 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2649 transitions. [2021-06-05 14:21:57,810 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2649 transitions. Word has length 18 [2021-06-05 14:21:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:57,811 INFO L482 AbstractCegarLoop]: Abstraction has 732 states and 2649 transitions. [2021-06-05 14:21:57,811 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2649 transitions. [2021-06-05 14:21:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:57,811 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:57,812 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:58,012 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 280 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3100 [2021-06-05 14:21:58,012 INFO L430 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 603886064, now seen corresponding path program 134 times [2021-06-05 14:21:58,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:58,013 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783313705] [2021-06-05 14:21:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:58,298 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:58,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783313705] [2021-06-05 14:21:58,298 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783313705] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:58,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640615745] [2021-06-05 14:21:58,298 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 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:21:58,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:21:58,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:58,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:58,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:58,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:58,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 25 treesize of output 19 [2021-06-05 14:21:58,454 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:58,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 15 treesize of output 11 [2021-06-05 14:21:58,457 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:58,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:58,478 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:58,478 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 14:21:58,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:21:58,557 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:58,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 19 treesize of output 15 [2021-06-05 14:21:58,559 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:58,571 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 14:21:58,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 11 treesize of output 7 [2021-06-05 14:21:58,574 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:58,580 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:58,580 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:58,581 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 14:21:58,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:58,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640615745] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:58,605 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:58,605 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:58,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126757869] [2021-06-05 14:21:58,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:58,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:58,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:58,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:58,606 INFO L87 Difference]: Start difference. First operand 732 states and 2649 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:59,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:21:59,018 INFO L93 Difference]: Finished difference Result 784 states and 2793 transitions. [2021-06-05 14:21:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:21:59,018 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:21:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:21:59,019 INFO L225 Difference]: With dead ends: 784 [2021-06-05 14:21:59,019 INFO L226 Difference]: Without dead ends: 779 [2021-06-05 14:21:59,019 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 491.0ms TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:21:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2021-06-05 14:21:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 738. [2021-06-05 14:21:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 3.622795115332429) internal successors, (2670), 737 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2670 transitions. [2021-06-05 14:21:59,027 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2670 transitions. Word has length 18 [2021-06-05 14:21:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:21:59,027 INFO L482 AbstractCegarLoop]: Abstraction has 738 states and 2670 transitions. [2021-06-05 14:21:59,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:21:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2670 transitions. [2021-06-05 14:21:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:21:59,028 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:21:59,028 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:21:59,228 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 281 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3110 [2021-06-05 14:21:59,229 INFO L430 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:21:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:21:59,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1336102682, now seen corresponding path program 135 times [2021-06-05 14:21:59,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:21:59,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591446787] [2021-06-05 14:21:59,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:21:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:21:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:59,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:21:59,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591446787] [2021-06-05 14:21:59,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591446787] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:59,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28324861] [2021-06-05 14:21:59,459 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 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:21:59,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:21:59,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:21:59,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:21:59,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:21:59,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:21:59,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:21:59,583 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:59,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:21:59,587 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:59,613 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:59,615 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:59,615 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 14:21:59,676 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_794], 1=[array_4, v_prenex_795]} [2021-06-05 14:21:59,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 17 treesize of output 13 [2021-06-05 14:21:59,681 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:59,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 27 treesize of output 21 [2021-06-05 14:21:59,685 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:59,736 INFO L628 ElimStorePlain]: treesize reduction 75, result has 40.0 percent of original size [2021-06-05 14:21:59,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 7 treesize of output 5 [2021-06-05 14:21:59,740 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:21:59,757 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:59,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 11 treesize of output 7 [2021-06-05 14:21:59,761 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:21:59,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:21:59,778 INFO L518 ElimStorePlain]: Eliminatee v_prenex_795 vanished before elimination [2021-06-05 14:21:59,779 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:21:59,779 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 14:21:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:21:59,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28324861] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:21:59,859 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:21:59,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:21:59,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847532189] [2021-06-05 14:21:59,859 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:21:59,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:21:59,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:21:59,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:21:59,860 INFO L87 Difference]: Start difference. First operand 738 states and 2670 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:00,498 INFO L93 Difference]: Finished difference Result 794 states and 2825 transitions. [2021-06-05 14:22:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:00,498 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:00,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:00,499 INFO L225 Difference]: With dead ends: 794 [2021-06-05 14:22:00,499 INFO L226 Difference]: Without dead ends: 789 [2021-06-05 14:22:00,500 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 715.4ms TimeCoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:22:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-06-05 14:22:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 735. [2021-06-05 14:22:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 734 states have (on average 3.6212534059945503) internal successors, (2658), 734 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 2658 transitions. [2021-06-05 14:22:00,507 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 2658 transitions. Word has length 18 [2021-06-05 14:22:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:00,507 INFO L482 AbstractCegarLoop]: Abstraction has 735 states and 2658 transitions. [2021-06-05 14:22:00,507 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 2658 transitions. [2021-06-05 14:22:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:00,508 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:00,508 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:00,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 282 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3120 [2021-06-05 14:22:00,709 INFO L430 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2085123934, now seen corresponding path program 136 times [2021-06-05 14:22:00,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:00,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771802205] [2021-06-05 14:22:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:00,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:00,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771802205] [2021-06-05 14:22:00,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771802205] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:00,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548819217] [2021-06-05 14:22:00,991 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 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:22:01,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:22:01,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:01,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:01,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:01,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:01,131 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:01,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 15 treesize of output 11 [2021-06-05 14:22:01,135 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:01,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:01,154 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:01,154 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 14:22:01,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:01,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:01,217 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:01,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:01,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:22:01,221 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:01,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:01,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:22:01,225 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:01,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 25 treesize of output 19 [2021-06-05 14:22:01,229 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:01,275 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 14:22:01,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 22 treesize of output 14 [2021-06-05 14:22:01,279 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:01,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:01,298 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:01,298 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:22:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:01,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548819217] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:01,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:01,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:22:01,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299145824] [2021-06-05 14:22:01,370 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:22:01,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:01,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:22:01,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:22:01,370 INFO L87 Difference]: Start difference. First operand 735 states and 2658 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:02,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:02,140 INFO L93 Difference]: Finished difference Result 792 states and 2824 transitions. [2021-06-05 14:22:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:22:02,141 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:02,142 INFO L225 Difference]: With dead ends: 792 [2021-06-05 14:22:02,142 INFO L226 Difference]: Without dead ends: 787 [2021-06-05 14:22:02,142 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 847.3ms TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:22:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-06-05 14:22:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 732. [2021-06-05 14:22:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 731 states have (on average 3.6238030095759233) internal successors, (2649), 731 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2649 transitions. [2021-06-05 14:22:02,150 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2649 transitions. Word has length 18 [2021-06-05 14:22:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:02,150 INFO L482 AbstractCegarLoop]: Abstraction has 732 states and 2649 transitions. [2021-06-05 14:22:02,150 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2649 transitions. [2021-06-05 14:22:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:02,151 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:02,151 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:02,351 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 283 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3131 [2021-06-05 14:22:02,351 INFO L430 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:02,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:02,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1063225658, now seen corresponding path program 137 times [2021-06-05 14:22:02,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:02,351 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237949580] [2021-06-05 14:22:02,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:02,594 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:02,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237949580] [2021-06-05 14:22:02,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237949580] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:02,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446444917] [2021-06-05 14:22:02,594 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 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:22:02,620 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:22:02,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:02,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:02,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:02,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:02,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:02,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:02,669 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:02,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:02,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:02,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:22:02,673 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:02,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:02,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:02,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 26 treesize of output 20 [2021-06-05 14:22:02,677 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:02,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:02,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 16 treesize of output 12 [2021-06-05 14:22:02,680 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:02,723 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:02,725 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:02,725 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:159, output treesize:127 [2021-06-05 14:22:03,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:03,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:03,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 25 treesize of output 19 [2021-06-05 14:22:03,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:03,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:03,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:22:03,109 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:03,158 INFO L628 ElimStorePlain]: treesize reduction 77, result has 45.0 percent of original size [2021-06-05 14:22:03,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:03,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:22:03,161 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:03,177 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:03,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:22:03,180 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:03,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:03,195 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:22:03,196 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:03,196 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:152, output treesize:16 [2021-06-05 14:22:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:03,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446444917] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:03,221 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:03,221 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:22:03,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615543972] [2021-06-05 14:22:03,221 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:22:03,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:03,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:22:03,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:22:03,222 INFO L87 Difference]: Start difference. First operand 732 states and 2649 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:22:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:03,923 INFO L93 Difference]: Finished difference Result 902 states and 3109 transitions. [2021-06-05 14:22:03,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:03,923 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:22:03,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:03,924 INFO L225 Difference]: With dead ends: 902 [2021-06-05 14:22:03,925 INFO L226 Difference]: Without dead ends: 897 [2021-06-05 14:22:03,925 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 784.8ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:22:03,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-06-05 14:22:03,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 742. [2021-06-05 14:22:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.6288798920377867) internal successors, (2689), 741 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2689 transitions. [2021-06-05 14:22:03,935 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2689 transitions. Word has length 18 [2021-06-05 14:22:03,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:03,935 INFO L482 AbstractCegarLoop]: Abstraction has 742 states and 2689 transitions. [2021-06-05 14:22:03,935 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:22:03,935 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2689 transitions. [2021-06-05 14:22:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:03,936 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:03,936 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:04,136 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 284 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3141 [2021-06-05 14:22:04,137 INFO L430 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:04,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:04,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1919721604, now seen corresponding path program 138 times [2021-06-05 14:22:04,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:04,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900507196] [2021-06-05 14:22:04,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:04,381 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:04,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900507196] [2021-06-05 14:22:04,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900507196] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:04,381 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794751884] [2021-06-05 14:22:04,381 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 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:22:04,410 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:22:04,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:04,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:04,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:04,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:04,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 26 treesize of output 20 [2021-06-05 14:22:04,457 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:04,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:04,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 16 treesize of output 12 [2021-06-05 14:22:04,460 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:04,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:04,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 15 treesize of output 11 [2021-06-05 14:22:04,464 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:04,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:04,466 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:04,509 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:04,510 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:04,511 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 14:22:04,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:04,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 25 treesize of output 19 [2021-06-05 14:22:04,747 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:04,772 INFO L628 ElimStorePlain]: treesize reduction 58, result has 41.4 percent of original size [2021-06-05 14:22:04,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:04,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 27 treesize of output 21 [2021-06-05 14:22:04,775 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:04,783 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:04,784 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:04,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:22:04,786 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:04,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:04,794 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:22:04,794 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:04,795 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:106, output treesize:16 [2021-06-05 14:22:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:04,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794751884] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:04,810 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:04,810 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:22:04,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511886884] [2021-06-05 14:22:04,810 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:04,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:04,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:04,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:04,811 INFO L87 Difference]: Start difference. First operand 742 states and 2689 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:05,383 INFO L93 Difference]: Finished difference Result 896 states and 3107 transitions. [2021-06-05 14:22:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:05,383 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:05,385 INFO L225 Difference]: With dead ends: 896 [2021-06-05 14:22:05,385 INFO L226 Difference]: Without dead ends: 891 [2021-06-05 14:22:05,385 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 735.4ms TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:22:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2021-06-05 14:22:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 748. [2021-06-05 14:22:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6318607764390896) internal successors, (2713), 747 states have internal predecessors, (2713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2713 transitions. [2021-06-05 14:22:05,394 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2713 transitions. Word has length 18 [2021-06-05 14:22:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:05,394 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2713 transitions. [2021-06-05 14:22:05,394 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2713 transitions. [2021-06-05 14:22:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:05,395 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:05,395 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:05,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 285 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3164 [2021-06-05 14:22:05,609 INFO L430 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:05,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:05,609 INFO L82 PathProgramCache]: Analyzing trace with hash -20267142, now seen corresponding path program 139 times [2021-06-05 14:22:05,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:05,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171972759] [2021-06-05 14:22:05,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:05,859 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:05,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171972759] [2021-06-05 14:22:05,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171972759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:05,860 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182885223] [2021-06-05 14:22:05,860 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 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:22:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:05,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:05,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:05,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:05,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 15 treesize of output 11 [2021-06-05 14:22:05,932 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:05,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:05,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:22:05,936 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:05,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:05,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:05,939 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:05,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 16 treesize of output 12 [2021-06-05 14:22:05,942 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:05,980 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:05,981 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:05,981 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 14:22:06,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:06,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:06,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 17 treesize of output 13 [2021-06-05 14:22:06,137 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:06,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:06,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 27 treesize of output 21 [2021-06-05 14:22:06,140 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:06,187 INFO L628 ElimStorePlain]: treesize reduction 87, result has 39.2 percent of original size [2021-06-05 14:22:06,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:06,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:22:06,191 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:06,209 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:06,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 7 treesize of output 5 [2021-06-05 14:22:06,212 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:06,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:06,228 INFO L518 ElimStorePlain]: Eliminatee v_prenex_808 vanished before elimination [2021-06-05 14:22:06,229 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:06,229 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 14:22:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:06,283 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182885223] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:06,283 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:06,283 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:22:06,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327701083] [2021-06-05 14:22:06,283 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:06,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:06,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:06,283 INFO L87 Difference]: Start difference. First operand 748 states and 2713 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:22:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:06,857 INFO L93 Difference]: Finished difference Result 919 states and 3174 transitions. [2021-06-05 14:22:06,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:06,858 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:22:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:06,859 INFO L225 Difference]: With dead ends: 919 [2021-06-05 14:22:06,859 INFO L226 Difference]: Without dead ends: 914 [2021-06-05 14:22:06,859 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 705.2ms TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:22:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-06-05 14:22:06,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 738. [2021-06-05 14:22:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 3.628222523744912) internal successors, (2674), 737 states have internal predecessors, (2674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2674 transitions. [2021-06-05 14:22:06,869 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2674 transitions. Word has length 18 [2021-06-05 14:22:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:06,869 INFO L482 AbstractCegarLoop]: Abstraction has 738 states and 2674 transitions. [2021-06-05 14:22:06,869 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:22:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2674 transitions. [2021-06-05 14:22:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:06,870 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:06,870 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:07,070 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 286 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3181 [2021-06-05 14:22:07,070 INFO L430 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:07,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash -446381756, now seen corresponding path program 140 times [2021-06-05 14:22:07,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:07,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329105545] [2021-06-05 14:22:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:07,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:07,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329105545] [2021-06-05 14:22:07,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329105545] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:07,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056740041] [2021-06-05 14:22:07,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 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:22:07,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:22:07,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:07,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:07,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:07,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:07,385 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:07,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:22:07,387 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:07,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 15 treesize of output 11 [2021-06-05 14:22:07,390 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:07,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:22:07,393 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:07,421 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:07,422 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:07,422 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:87 [2021-06-05 14:22:07,650 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:07,650 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:07,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 25 treesize of output 19 [2021-06-05 14:22:07,651 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:07,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:07,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:07,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:07,656 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:07,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:07,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:07,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 17 treesize of output 13 [2021-06-05 14:22:07,660 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:07,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:07,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 27 treesize of output 21 [2021-06-05 14:22:07,664 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:07,714 INFO L628 ElimStorePlain]: treesize reduction 80, result has 40.7 percent of original size [2021-06-05 14:22:07,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:07,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:22:07,718 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:07,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:07,737 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:07,737 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:167, output treesize:35 [2021-06-05 14:22:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:07,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056740041] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:07,785 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:07,785 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:22:07,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675959120] [2021-06-05 14:22:07,785 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:07,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:07,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:07,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:07,785 INFO L87 Difference]: Start difference. First operand 738 states and 2674 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:22:08,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:08,789 INFO L93 Difference]: Finished difference Result 928 states and 3191 transitions. [2021-06-05 14:22:08,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:22:08,790 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:22:08,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:08,791 INFO L225 Difference]: With dead ends: 928 [2021-06-05 14:22:08,791 INFO L226 Difference]: Without dead ends: 923 [2021-06-05 14:22:08,791 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 954.6ms TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:22:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-06-05 14:22:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 740. [2021-06-05 14:22:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 3.6238159675236807) internal successors, (2678), 739 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2678 transitions. [2021-06-05 14:22:08,800 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2678 transitions. Word has length 18 [2021-06-05 14:22:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:08,800 INFO L482 AbstractCegarLoop]: Abstraction has 740 states and 2678 transitions. [2021-06-05 14:22:08,800 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:22:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2678 transitions. [2021-06-05 14:22:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:08,801 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:08,801 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:09,001 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 287 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3197 [2021-06-05 14:22:09,002 INFO L430 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:09,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:09,002 INFO L82 PathProgramCache]: Analyzing trace with hash 2024323972, now seen corresponding path program 141 times [2021-06-05 14:22:09,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:09,002 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131156872] [2021-06-05 14:22:09,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:09,280 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:09,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131156872] [2021-06-05 14:22:09,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131156872] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:09,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982481264] [2021-06-05 14:22:09,281 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 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:22:09,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:22:09,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:09,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 14:22:09,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:09,576 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:22:09,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 14:22:09,578 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,584 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:22:09,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2021-06-05 14:22:09,587 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,594 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:22:09,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2021-06-05 14:22:09,595 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,602 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:22:09,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 14:22:09,603 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,610 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 14:22:09,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 14:22:09,611 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,615 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:22:09,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 14:22:09,616 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,677 INFO L628 ElimStorePlain]: treesize reduction 93, result has 50.5 percent of original size [2021-06-05 14:22:09,679 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:22:09,679 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:298, output treesize:91 [2021-06-05 14:22:09,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:09,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 27 treesize of output 21 [2021-06-05 14:22:09,756 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:09,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 25 treesize of output 19 [2021-06-05 14:22:09,760 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:09,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 15 treesize of output 11 [2021-06-05 14:22:09,764 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:09,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 17 treesize of output 13 [2021-06-05 14:22:09,768 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:09,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:09,771 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,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 15 treesize of output 11 [2021-06-05 14:22:09,774 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:09,840 INFO L628 ElimStorePlain]: treesize reduction 114, result has 40.9 percent of original size [2021-06-05 14:22:09,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 11 treesize of output 7 [2021-06-05 14:22:09,851 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:09,878 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:09,879 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:22:09,879 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:247, output treesize:71 [2021-06-05 14:22:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:09,944 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982481264] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:09,944 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:09,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 14:22:09,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119580186] [2021-06-05 14:22:09,944 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:22:09,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:09,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:22:09,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:22:09,944 INFO L87 Difference]: Start difference. First operand 740 states and 2678 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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:22:10,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:10,414 INFO L93 Difference]: Finished difference Result 813 states and 2847 transitions. [2021-06-05 14:22:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:10,415 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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:22:10,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:10,416 INFO L225 Difference]: With dead ends: 813 [2021-06-05 14:22:10,416 INFO L226 Difference]: Without dead ends: 800 [2021-06-05 14:22:10,416 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 719.6ms TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:22:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-06-05 14:22:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 741. [2021-06-05 14:22:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 3.6202702702702703) internal successors, (2679), 740 states have internal predecessors, (2679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 2679 transitions. [2021-06-05 14:22:10,424 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 2679 transitions. Word has length 18 [2021-06-05 14:22:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:10,425 INFO L482 AbstractCegarLoop]: Abstraction has 741 states and 2679 transitions. [2021-06-05 14:22:10,425 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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:22:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 2679 transitions. [2021-06-05 14:22:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:10,425 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:10,425 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:10,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3214,288 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:10,626 INFO L430 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:10,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:10,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1165319792, now seen corresponding path program 142 times [2021-06-05 14:22:10,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:10,626 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068564201] [2021-06-05 14:22:10,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:10,906 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:10,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068564201] [2021-06-05 14:22:10,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068564201] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:10,906 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085860198] [2021-06-05 14:22:10,906 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 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:22:10,933 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:22:10,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:10,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:10,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:10,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:10,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 15 treesize of output 11 [2021-06-05 14:22:10,980 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:10,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:10,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 26 treesize of output 20 [2021-06-05 14:22:10,983 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:10,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:10,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 25 treesize of output 19 [2021-06-05 14:22:10,987 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:10,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 16 treesize of output 12 [2021-06-05 14:22:10,990 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:11,027 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:11,028 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:11,029 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 14:22:11,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:11,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 25 treesize of output 19 [2021-06-05 14:22:11,307 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:11,332 INFO L628 ElimStorePlain]: treesize reduction 54, result has 43.2 percent of original size [2021-06-05 14:22:11,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:11,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:22:11,335 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:11,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:11,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:11,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:22:11,346 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:11,353 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:11,353 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:22:11,354 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:11,354 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:106, output treesize:16 [2021-06-05 14:22:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:11,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085860198] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:11,370 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:11,370 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:22:11,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864879334] [2021-06-05 14:22:11,370 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:11,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:11,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:11,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:11,370 INFO L87 Difference]: Start difference. First operand 741 states and 2679 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:11,691 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2021-06-05 14:22:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:11,896 INFO L93 Difference]: Finished difference Result 825 states and 2888 transitions. [2021-06-05 14:22:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:11,896 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:11,902 INFO L225 Difference]: With dead ends: 825 [2021-06-05 14:22:11,902 INFO L226 Difference]: Without dead ends: 820 [2021-06-05 14:22:11,902 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 786.1ms TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:22:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-06-05 14:22:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 748. [2021-06-05 14:22:11,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6238286479250337) internal successors, (2707), 747 states have internal predecessors, (2707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2707 transitions. [2021-06-05 14:22:11,910 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2707 transitions. Word has length 18 [2021-06-05 14:22:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:11,911 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2707 transitions. [2021-06-05 14:22:11,911 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:11,911 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2707 transitions. [2021-06-05 14:22:11,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:11,912 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:11,912 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:12,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 289 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3232 [2021-06-05 14:22:12,112 INFO L430 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:12,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash -774668954, now seen corresponding path program 143 times [2021-06-05 14:22:12,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:12,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310982031] [2021-06-05 14:22:12,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:12,356 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:12,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310982031] [2021-06-05 14:22:12,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310982031] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:12,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968533926] [2021-06-05 14:22:12,357 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 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:22:12,384 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:22:12,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:12,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:12,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:12,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:12,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:22:12,446 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:12,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:12,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:22:12,450 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:12,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:12,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 25 treesize of output 19 [2021-06-05 14:22:12,453 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:12,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:22:12,456 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:12,487 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:12,488 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:12,488 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 14:22:12,651 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_818], 1=[array_4, v_prenex_819]} [2021-06-05 14:22:12,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:22:12,655 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:12,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 25 treesize of output 19 [2021-06-05 14:22:12,658 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:12,697 INFO L628 ElimStorePlain]: treesize reduction 79, result has 40.6 percent of original size [2021-06-05 14:22:12,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 27 treesize of output 21 [2021-06-05 14:22:12,700 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:12,714 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:12,714 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:22:12,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:22:12,717 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:12,730 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:12,731 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:12,731 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 14:22:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:12,793 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968533926] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:12,793 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:12,793 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:22:12,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761214059] [2021-06-05 14:22:12,793 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:22:12,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:12,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:22:12,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:22:12,793 INFO L87 Difference]: Start difference. First operand 748 states and 2707 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:13,238 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2021-06-05 14:22:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:13,458 INFO L93 Difference]: Finished difference Result 852 states and 2963 transitions. [2021-06-05 14:22:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:13,459 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:13,460 INFO L225 Difference]: With dead ends: 852 [2021-06-05 14:22:13,460 INFO L226 Difference]: Without dead ends: 847 [2021-06-05 14:22:13,460 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 791.8ms TimeCoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:22:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-06-05 14:22:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 742. [2021-06-05 14:22:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.620782726045884) internal successors, (2683), 741 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2683 transitions. [2021-06-05 14:22:13,468 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2683 transitions. Word has length 18 [2021-06-05 14:22:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:13,468 INFO L482 AbstractCegarLoop]: Abstraction has 742 states and 2683 transitions. [2021-06-05 14:22:13,468 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2683 transitions. [2021-06-05 14:22:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:13,469 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:13,469 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:13,669 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 290 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3248 [2021-06-05 14:22:13,670 INFO L430 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:13,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:13,670 INFO L82 PathProgramCache]: Analyzing trace with hash 423886118, now seen corresponding path program 144 times [2021-06-05 14:22:13,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:13,670 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087374389] [2021-06-05 14:22:13,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:13,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:13,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087374389] [2021-06-05 14:22:13,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087374389] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:13,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58358350] [2021-06-05 14:22:13,963 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 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:22:13,989 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:22:13,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:13,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 14:22:13,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:14,181 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 14:22:14,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 36 [2021-06-05 14:22:14,182 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:14,189 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 14:22:14,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 14:22:14,190 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:14,195 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:22: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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 14:22:14,196 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:14,200 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:22:14,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 14:22:14,201 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:14,248 INFO L628 ElimStorePlain]: treesize reduction 33, result has 70.5 percent of original size [2021-06-05 14:22:14,250 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:22:14,250 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:180, output treesize:75 [2021-06-05 14:22:14,316 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22: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 27 treesize of output 21 [2021-06-05 14:22:14,317 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:14,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22: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:22:14,321 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:14,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:14,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 25 treesize of output 19 [2021-06-05 14:22:14,324 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:14,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:14,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 17 treesize of output 13 [2021-06-05 14:22:14,328 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:14,331 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:14,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:14,332 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:14,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:14,335 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:14,387 INFO L628 ElimStorePlain]: treesize reduction 108, result has 36.8 percent of original size [2021-06-05 14:22:14,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 11 treesize of output 7 [2021-06-05 14:22:14,390 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:14,410 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:14,411 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:22:14,411 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:215, output treesize:55 [2021-06-05 14:22:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:14,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58358350] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:14,498 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:14,498 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:22:14,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357048883] [2021-06-05 14:22:14,498 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:22:14,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:14,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:22:14,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:22:14,498 INFO L87 Difference]: Start difference. First operand 742 states and 2683 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:15,019 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2021-06-05 14:22:15,233 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 77 [2021-06-05 14:22:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:15,661 INFO L93 Difference]: Finished difference Result 841 states and 2938 transitions. [2021-06-05 14:22:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:22:15,662 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:15,663 INFO L225 Difference]: With dead ends: 841 [2021-06-05 14:22:15,663 INFO L226 Difference]: Without dead ends: 836 [2021-06-05 14:22:15,663 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1199.6ms TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:22:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2021-06-05 14:22:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 742. [2021-06-05 14:22:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.620782726045884) internal successors, (2683), 741 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2683 transitions. [2021-06-05 14:22:15,671 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 2683 transitions. Word has length 18 [2021-06-05 14:22:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:15,671 INFO L482 AbstractCegarLoop]: Abstraction has 742 states and 2683 transitions. [2021-06-05 14:22:15,671 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 2683 transitions. [2021-06-05 14:22:15,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:15,672 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:15,672 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:15,873 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 291 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3262 [2021-06-05 14:22:15,873 INFO L430 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:15,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:15,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1307733628, now seen corresponding path program 145 times [2021-06-05 14:22:15,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:15,873 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398238904] [2021-06-05 14:22:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:16,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:16,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398238904] [2021-06-05 14:22:16,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398238904] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:16,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898908457] [2021-06-05 14:22:16,048 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 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:22:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:16,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:22:16,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:16,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 25 treesize of output 19 [2021-06-05 14:22:16,171 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:16,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:22:16,174 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:16,201 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:16,202 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:16,202 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:71 [2021-06-05 14:22:16,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:16,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:16,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 27 treesize of output 21 [2021-06-05 14:22:16,359 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:16,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:16,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:16,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 17 treesize of output 13 [2021-06-05 14:22:16,363 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:16,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:16,367 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:16,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 25 treesize of output 19 [2021-06-05 14:22:16,368 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:16,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:16,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:16,372 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:16,426 INFO L628 ElimStorePlain]: treesize reduction 85, result has 40.6 percent of original size [2021-06-05 14:22:16,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:16,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:22:16,430 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:16,449 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:16,450 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:16,450 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:173, output treesize:44 [2021-06-05 14:22:16,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:16,513 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898908457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:16,513 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:16,513 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 14:22:16,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228901907] [2021-06-05 14:22:16,513 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:22:16,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:16,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:22:16,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:22:16,513 INFO L87 Difference]: Start difference. First operand 742 states and 2683 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:22:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:16,861 INFO L93 Difference]: Finished difference Result 781 states and 2780 transitions. [2021-06-05 14:22:16,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:16,861 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:22:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:16,863 INFO L225 Difference]: With dead ends: 781 [2021-06-05 14:22:16,863 INFO L226 Difference]: Without dead ends: 768 [2021-06-05 14:22:16,863 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 468.1ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:22:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-06-05 14:22:16,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 748. [2021-06-05 14:22:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6157965194109773) internal successors, (2701), 747 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2701 transitions. [2021-06-05 14:22:16,871 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2701 transitions. Word has length 18 [2021-06-05 14:22:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:16,871 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2701 transitions. [2021-06-05 14:22:16,871 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:22:16,871 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2701 transitions. [2021-06-05 14:22:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:16,872 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:16,872 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:17,072 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 292 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3281 [2021-06-05 14:22:17,072 INFO L430 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:17,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1047244922, now seen corresponding path program 146 times [2021-06-05 14:22:17,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:17,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977618488] [2021-06-05 14:22:17,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:17,232 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:17,232 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977618488] [2021-06-05 14:22:17,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977618488] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:17,232 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027758060] [2021-06-05 14:22:17,232 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 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:22:17,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:22:17,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:17,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:17,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:17,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:17,353 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:17,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 25 treesize of output 19 [2021-06-05 14:22:17,356 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:17,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:17,380 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:17,380 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 14:22:17,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:17,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:17,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:22:17,435 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:17,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:17,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:17,438 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:17,485 INFO L628 ElimStorePlain]: treesize reduction 81, result has 40.9 percent of original size [2021-06-05 14:22:17,486 INFO L518 ElimStorePlain]: Eliminatee v_prenex_825 vanished before elimination [2021-06-05 14:22:17,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:17,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 19 treesize of output 15 [2021-06-05 14:22:17,488 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:17,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:17,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:17,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 11 treesize of output 7 [2021-06-05 14:22:17,509 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:17,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:17,526 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:17,527 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 14:22:17,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:17,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027758060] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:17,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:17,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:22:17,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504954737] [2021-06-05 14:22:17,580 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:17,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:17,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:17,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:17,581 INFO L87 Difference]: Start difference. First operand 748 states and 2701 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:22:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:17,882 INFO L93 Difference]: Finished difference Result 783 states and 2797 transitions. [2021-06-05 14:22:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:17,882 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:22:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:17,883 INFO L225 Difference]: With dead ends: 783 [2021-06-05 14:22:17,883 INFO L226 Difference]: Without dead ends: 778 [2021-06-05 14:22:17,883 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 337.9ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:22:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2021-06-05 14:22:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 745. [2021-06-05 14:22:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 744 states have (on average 3.618279569892473) internal successors, (2692), 744 states have internal predecessors, (2692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 2692 transitions. [2021-06-05 14:22:17,891 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 2692 transitions. Word has length 18 [2021-06-05 14:22:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:17,891 INFO L482 AbstractCegarLoop]: Abstraction has 745 states and 2692 transitions. [2021-06-05 14:22:17,891 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:22:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 2692 transitions. [2021-06-05 14:22:17,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:17,892 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:17,892 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:18,092 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3293,293 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:18,093 INFO L430 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:18,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:18,093 INFO L82 PathProgramCache]: Analyzing trace with hash 173504242, now seen corresponding path program 147 times [2021-06-05 14:22:18,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:18,093 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837821567] [2021-06-05 14:22:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:18,279 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:18,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837821567] [2021-06-05 14:22:18,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837821567] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:18,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902435950] [2021-06-05 14:22:18,279 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 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:22:18,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:22:18,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:18,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:18,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:18,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:18,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:18,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 25 treesize of output 19 [2021-06-05 14:22:18,441 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:18,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:18,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:22:18,444 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:18,476 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:18,478 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:22:18,478 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:85 [2021-06-05 14:22:18,576 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_828, array_4], 3=[array_0, v_prenex_827]} [2021-06-05 14:22:18,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:18,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:18,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 27 treesize of output 21 [2021-06-05 14:22:18,581 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:18,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:18,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 25 treesize of output 19 [2021-06-05 14:22:18,586 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:18,650 INFO L628 ElimStorePlain]: treesize reduction 99, result has 44.1 percent of original size [2021-06-05 14:22:18,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:22:18,653 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:18,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:18,677 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 14:22:18,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:18,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:22:18,681 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:18,705 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:18,707 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:18,707 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:199, output treesize:35 [2021-06-05 14:22:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:18,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902435950] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:18,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:18,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2021-06-05 14:22:18,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477271660] [2021-06-05 14:22:18,759 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:22:18,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:18,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:22:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:22:18,759 INFO L87 Difference]: Start difference. First operand 745 states and 2692 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:22:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:19,359 INFO L93 Difference]: Finished difference Result 796 states and 2822 transitions. [2021-06-05 14:22:19,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:22:19,359 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:22:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:19,361 INFO L225 Difference]: With dead ends: 796 [2021-06-05 14:22:19,361 INFO L226 Difference]: Without dead ends: 791 [2021-06-05 14:22:19,361 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 582.5ms TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:22:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-06-05 14:22:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 748. [2021-06-05 14:22:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6198125836680055) internal successors, (2704), 747 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2704 transitions. [2021-06-05 14:22:19,371 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2704 transitions. Word has length 18 [2021-06-05 14:22:19,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:19,372 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2704 transitions. [2021-06-05 14:22:19,372 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:22:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2704 transitions. [2021-06-05 14:22:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:19,373 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:19,373 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:19,588 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3303,294 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:19,589 INFO L430 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:19,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1497471774, now seen corresponding path program 148 times [2021-06-05 14:22:19,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:19,589 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524709104] [2021-06-05 14:22:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:19,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:19,807 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:19,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524709104] [2021-06-05 14:22:19,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524709104] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:19,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369173] [2021-06-05 14:22:19,807 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 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:22:19,833 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:22:19,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:19,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:22:19,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:19,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:19,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:19,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:22:19,961 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:19,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:19,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:19,964 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:20,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:20,003 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:22:20,004 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:113, output treesize:95 [2021-06-05 14:22:20,146 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 14:22:20,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:20,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:20,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:20,150 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:20,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:20,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:20,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 27 treesize of output 21 [2021-06-05 14:22:20,155 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:20,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:20,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:20,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:20,159 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:20,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22: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 17 treesize of output 13 [2021-06-05 14:22:20,163 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:20,225 INFO L628 ElimStorePlain]: treesize reduction 94, result has 43.0 percent of original size [2021-06-05 14:22:20,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:20,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 11 treesize of output 7 [2021-06-05 14:22:20,229 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:20,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:20,253 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:20,253 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:199, output treesize:78 [2021-06-05 14:22:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:20,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369173] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:20,341 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:20,341 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-06-05 14:22:20,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412996384] [2021-06-05 14:22:20,342 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:22:20,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:20,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:22:20,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:22:20,342 INFO L87 Difference]: Start difference. First operand 748 states and 2704 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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:22:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:20,637 INFO L93 Difference]: Finished difference Result 779 states and 2776 transitions. [2021-06-05 14:22:20,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:20,637 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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:22:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:20,638 INFO L225 Difference]: With dead ends: 779 [2021-06-05 14:22:20,639 INFO L226 Difference]: Without dead ends: 768 [2021-06-05 14:22:20,639 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 491.6ms TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:22:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-06-05 14:22:20,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 748. [2021-06-05 14:22:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6157965194109773) internal successors, (2701), 747 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2701 transitions. [2021-06-05 14:22:20,646 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2701 transitions. Word has length 18 [2021-06-05 14:22:20,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:20,646 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2701 transitions. [2021-06-05 14:22:20,646 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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:22:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2701 transitions. [2021-06-05 14:22:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:20,647 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:20,647 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:20,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3316,295 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:20,848 INFO L430 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:20,848 INFO L82 PathProgramCache]: Analyzing trace with hash 722420652, now seen corresponding path program 149 times [2021-06-05 14:22:20,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:20,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623220074] [2021-06-05 14:22:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:21,067 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-06-05 14:22:21,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:21,213 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:21,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623220074] [2021-06-05 14:22:21,213 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623220074] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:21,213 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146692876] [2021-06-05 14:22:21,213 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 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:22:21,240 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:22:21,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:21,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:21,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:21,318 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:21,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 16 treesize of output 12 [2021-06-05 14:22:21,319 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:21,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:21,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 15 treesize of output 11 [2021-06-05 14:22:21,323 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:21,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:21,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:21,326 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:21,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:22:21,330 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:21,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:21,382 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:21,382 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:179, output treesize:143 [2021-06-05 14:22:21,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:21,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:21,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 15 treesize of output 11 [2021-06-05 14:22:21,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:21,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:21,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 25 treesize of output 19 [2021-06-05 14:22:21,612 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:21,644 INFO L628 ElimStorePlain]: treesize reduction 59, result has 43.3 percent of original size [2021-06-05 14:22:21,645 INFO L518 ElimStorePlain]: Eliminatee v_prenex_836 vanished before elimination [2021-06-05 14:22:21,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:21,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 19 treesize of output 15 [2021-06-05 14:22:21,647 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:21,657 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:21,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:21,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 11 treesize of output 7 [2021-06-05 14:22:21,661 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:21,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:21,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:21,671 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:122, output treesize:16 [2021-06-05 14:22:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:21,699 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146692876] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:21,699 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:21,699 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2021-06-05 14:22:21,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937455660] [2021-06-05 14:22:21,699 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:22:21,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:21,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:22:21,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:22:21,699 INFO L87 Difference]: Start difference. First operand 748 states and 2701 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:22:21,990 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 14:22:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:22,352 INFO L93 Difference]: Finished difference Result 792 states and 2815 transitions. [2021-06-05 14:22:22,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:22,353 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:22:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:22,354 INFO L225 Difference]: With dead ends: 792 [2021-06-05 14:22:22,354 INFO L226 Difference]: Without dead ends: 787 [2021-06-05 14:22:22,354 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 922.1ms TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:22:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-06-05 14:22:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 754. [2021-06-05 14:22:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 3.6188579017264275) internal successors, (2725), 753 states have internal predecessors, (2725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 2725 transitions. [2021-06-05 14:22:22,362 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 2725 transitions. Word has length 18 [2021-06-05 14:22:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:22,362 INFO L482 AbstractCegarLoop]: Abstraction has 754 states and 2725 transitions. [2021-06-05 14:22:22,362 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:22:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 2725 transitions. [2021-06-05 14:22:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:22,363 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:22,363 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:22,563 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3339,296 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:22,563 INFO L430 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:22,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:22,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1217568094, now seen corresponding path program 150 times [2021-06-05 14:22:22,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:22,563 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128045650] [2021-06-05 14:22:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:22,801 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:22,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128045650] [2021-06-05 14:22:22,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128045650] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:22,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289275679] [2021-06-05 14:22:22,801 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 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:22:22,827 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:22:22,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:22,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:22,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:22,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 16 treesize of output 12 [2021-06-05 14:22:22,902 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:22,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 25 treesize of output 19 [2021-06-05 14:22:22,905 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:22,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:22:22,908 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:22,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 15 treesize of output 11 [2021-06-05 14:22:22,911 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:22,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:22,953 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:22,953 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:119 [2021-06-05 14:22:23,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:23,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:23,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 25 treesize of output 19 [2021-06-05 14:22:23,141 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:23,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:23,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:23,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 27 treesize of output 21 [2021-06-05 14:22:23,145 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:23,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:23,149 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:23,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 15 treesize of output 11 [2021-06-05 14:22:23,150 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:23,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:23,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:22:23,153 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:23,206 INFO L628 ElimStorePlain]: treesize reduction 86, result has 39.0 percent of original size [2021-06-05 14:22:23,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:23,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 11 treesize of output 7 [2021-06-05 14:22:23,210 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:23,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:23,229 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:23,229 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:167, output treesize:35 [2021-06-05 14:22:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:23,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289275679] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:23,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:23,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:22:23,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431193933] [2021-06-05 14:22:23,288 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:23,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:23,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:23,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:23,289 INFO L87 Difference]: Start difference. First operand 754 states and 2725 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:22:23,538 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2021-06-05 14:22:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:23,891 INFO L93 Difference]: Finished difference Result 812 states and 2883 transitions. [2021-06-05 14:22:23,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:23,891 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:22:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:23,893 INFO L225 Difference]: With dead ends: 812 [2021-06-05 14:22:23,893 INFO L226 Difference]: Without dead ends: 807 [2021-06-05 14:22:23,893 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 713.2ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:22:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-06-05 14:22:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 747. [2021-06-05 14:22:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 3.6152815013404824) internal successors, (2697), 746 states have internal predecessors, (2697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 2697 transitions. [2021-06-05 14:22:23,900 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 2697 transitions. Word has length 18 [2021-06-05 14:22:23,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:23,900 INFO L482 AbstractCegarLoop]: Abstraction has 747 states and 2697 transitions. [2021-06-05 14:22:23,901 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:22:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 2697 transitions. [2021-06-05 14:22:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:23,901 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:23,901 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:24,102 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 297 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3356 [2021-06-05 14:22:24,102 INFO L430 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash 929513634, now seen corresponding path program 151 times [2021-06-05 14:22:24,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:24,102 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285568765] [2021-06-05 14:22:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:24,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:24,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:24,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285568765] [2021-06-05 14:22:24,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285568765] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:24,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586572472] [2021-06-05 14:22:24,402 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:22:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:24,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:24,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:24,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:24,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 25 treesize of output 19 [2021-06-05 14:22:24,518 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:24,521 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22: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 15 treesize of output 11 [2021-06-05 14:22:24,522 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:24,524 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:24,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 16 treesize of output 12 [2021-06-05 14:22:24,525 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:24,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 26 treesize of output 20 [2021-06-05 14:22:24,528 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:24,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:24,564 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:24,564 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:107 [2021-06-05 14:22:24,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:24,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 25 treesize of output 19 [2021-06-05 14:22:24,682 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:24,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:24,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:22:24,685 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:24,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:24,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 17 treesize of output 13 [2021-06-05 14:22:24,688 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:24,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 15 treesize of output 11 [2021-06-05 14:22:24,691 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:24,728 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 14:22:24,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:22:24,730 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:24,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:24,744 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:24,744 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 14:22:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:24,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586572472] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:24,809 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:24,809 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:22:24,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009710388] [2021-06-05 14:22:24,809 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:22:24,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:22:24,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:22:24,809 INFO L87 Difference]: Start difference. First operand 747 states and 2697 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:25,193 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2021-06-05 14:22:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:25,617 INFO L93 Difference]: Finished difference Result 795 states and 2837 transitions. [2021-06-05 14:22:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:22:25,617 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:25,619 INFO L225 Difference]: With dead ends: 795 [2021-06-05 14:22:25,619 INFO L226 Difference]: Without dead ends: 790 [2021-06-05 14:22:25,619 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 963.5ms TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:22:25,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-06-05 14:22:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 748. [2021-06-05 14:22:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 3.6131191432396252) internal successors, (2699), 747 states have internal predecessors, (2699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 2699 transitions. [2021-06-05 14:22:25,627 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 2699 transitions. Word has length 18 [2021-06-05 14:22:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:25,627 INFO L482 AbstractCegarLoop]: Abstraction has 748 states and 2699 transitions. [2021-06-05 14:22:25,627 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 2699 transitions. [2021-06-05 14:22:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:25,628 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:25,628 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:25,828 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 298 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3371 [2021-06-05 14:22:25,828 INFO L430 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:25,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1966146404, now seen corresponding path program 152 times [2021-06-05 14:22:25,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:25,829 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784392965] [2021-06-05 14:22:25,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:22:25,880 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:25,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784392965] [2021-06-05 14:22:25,880 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784392965] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:25,880 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503549431] [2021-06-05 14:22:25,880 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 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:22:25,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:22:25,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:25,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:25,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:25,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:25,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:25,963 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:25,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:25,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 26 treesize of output 20 [2021-06-05 14:22:25,966 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:25,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:25,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:22:25,969 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:25,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:22:25,972 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:25,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:25,996 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:25,996 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:75 [2021-06-05 14:22:26,101 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:26,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 18 treesize of output 14 [2021-06-05 14:22:26,102 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:26,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22: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 15 treesize of output 11 [2021-06-05 14:22:26,105 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:26,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:26,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 16 treesize of output 12 [2021-06-05 14:22:26,108 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:26,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:22:26,111 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:26,140 INFO L628 ElimStorePlain]: treesize reduction 56, result has 38.5 percent of original size [2021-06-05 14:22:26,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 12 treesize of output 8 [2021-06-05 14:22:26,144 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:26,155 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:26,155 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:26,155 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:115, output treesize:27 [2021-06-05 14:22:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:26,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503549431] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:26,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:26,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:22:26,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398966213] [2021-06-05 14:22:26,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:26,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:26,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:26,184 INFO L87 Difference]: Start difference. First operand 748 states and 2699 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:22:27,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:27,089 INFO L93 Difference]: Finished difference Result 1086 states and 3629 transitions. [2021-06-05 14:22:27,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 14:22:27,089 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:22:27,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:27,091 INFO L225 Difference]: With dead ends: 1086 [2021-06-05 14:22:27,091 INFO L226 Difference]: Without dead ends: 963 [2021-06-05 14:22:27,091 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 797.2ms TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2021-06-05 14:22:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2021-06-05 14:22:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 781. [2021-06-05 14:22:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 3.693589743589744) internal successors, (2881), 780 states have internal predecessors, (2881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 2881 transitions. [2021-06-05 14:22:27,101 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 2881 transitions. Word has length 18 [2021-06-05 14:22:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:27,101 INFO L482 AbstractCegarLoop]: Abstraction has 781 states and 2881 transitions. [2021-06-05 14:22:27,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:22:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 2881 transitions. [2021-06-05 14:22:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:27,102 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:27,102 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:27,303 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 299 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3386 [2021-06-05 14:22:27,303 INFO L430 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:27,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1651169188, now seen corresponding path program 153 times [2021-06-05 14:22:27,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:27,303 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591561041] [2021-06-05 14:22:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:22:27,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:27,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591561041] [2021-06-05 14:22:27,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591561041] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:27,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147777655] [2021-06-05 14:22:27,346 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 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:22:27,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:22:27,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:27,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:27,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:27,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:22:27,466 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,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 7 treesize of output 5 [2021-06-05 14:22:27,469 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,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 16 treesize of output 12 [2021-06-05 14:22:27,472 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,484 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:27,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 18 treesize of output 14 [2021-06-05 14:22:27,487 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:27,499 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:27,499 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:37 [2021-06-05 14:22:27,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:27,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 17 treesize of output 13 [2021-06-05 14:22:27,535 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,537 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:22:27,537 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:22:27,540 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:22:27,543 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,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 7 treesize of output 5 [2021-06-05 14:22:27,545 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,573 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:22:27,574 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,576 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:22:27,577 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:22:27,579 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:27,606 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 14:22:27,606 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:22:27,607 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:27,607 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 14:22:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:27,639 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147777655] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:27,639 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:27,639 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:22:27,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244910495] [2021-06-05 14:22:27,640 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:27,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:27,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:27,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:27,640 INFO L87 Difference]: Start difference. First operand 781 states and 2881 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:22:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:28,247 INFO L93 Difference]: Finished difference Result 1046 states and 3567 transitions. [2021-06-05 14:22:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 14:22:28,247 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:22:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:28,249 INFO L225 Difference]: With dead ends: 1046 [2021-06-05 14:22:28,249 INFO L226 Difference]: Without dead ends: 980 [2021-06-05 14:22:28,249 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 451.8ms TimeCoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:22:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2021-06-05 14:22:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 829. [2021-06-05 14:22:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 3.6642512077294684) internal successors, (3034), 828 states have internal predecessors, (3034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 3034 transitions. [2021-06-05 14:22:28,258 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 3034 transitions. Word has length 18 [2021-06-05 14:22:28,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:28,259 INFO L482 AbstractCegarLoop]: Abstraction has 829 states and 3034 transitions. [2021-06-05 14:22:28,259 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:22:28,259 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 3034 transitions. [2021-06-05 14:22:28,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:28,260 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:28,260 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:28,460 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 300 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3397 [2021-06-05 14:22:28,460 INFO L430 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:28,461 INFO L82 PathProgramCache]: Analyzing trace with hash 555703338, now seen corresponding path program 154 times [2021-06-05 14:22:28,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:28,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148799485] [2021-06-05 14:22:28,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:28,981 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:28,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148799485] [2021-06-05 14:22:28,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148799485] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:28,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739925752] [2021-06-05 14:22:28,981 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 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:22:29,007 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:22:29,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:29,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:22:29,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:29,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:22:29,154 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,157 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:22:29,158 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,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 15 treesize of output 11 [2021-06-05 14:22:29,162 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:29,167 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,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 26 treesize of output 20 [2021-06-05 14:22:29,171 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,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 25 treesize of output 19 [2021-06-05 14:22:29,175 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,178 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,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 16 treesize of output 12 [2021-06-05 14:22:29,179 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,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 26 treesize of output 20 [2021-06-05 14:22:29,183 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,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 25 treesize of output 19 [2021-06-05 14:22:29,187 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:29,191 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,305 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2021-06-05 14:22:29,305 INFO L628 ElimStorePlain]: treesize reduction 128, result has 57.2 percent of original size [2021-06-05 14:22:29,306 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:22:29,306 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:385, output treesize:171 [2021-06-05 14:22:29,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:22:29,466 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,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 25 treesize of output 19 [2021-06-05 14:22:29,470 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:29,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:22:29,474 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,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 15 treesize of output 11 [2021-06-05 14:22:29,477 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:29,521 INFO L628 ElimStorePlain]: treesize reduction 71, result has 39.3 percent of original size [2021-06-05 14:22:29,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 11 treesize of output 7 [2021-06-05 14:22:29,526 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:29,546 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:29,547 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:29,547 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 14:22:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:29,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739925752] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:29,635 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:29,635 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:22:29,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4969147] [2021-06-05 14:22:29,635 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:22:29,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:22:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:22:29,636 INFO L87 Difference]: Start difference. First operand 829 states and 3034 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:30,202 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 57 [2021-06-05 14:22:30,392 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2021-06-05 14:22:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:30,515 INFO L93 Difference]: Finished difference Result 858 states and 3091 transitions. [2021-06-05 14:22:30,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:30,516 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:30,517 INFO L225 Difference]: With dead ends: 858 [2021-06-05 14:22:30,517 INFO L226 Difference]: Without dead ends: 844 [2021-06-05 14:22:30,517 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1354.6ms TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:22:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-06-05 14:22:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 826. [2021-06-05 14:22:30,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 3.667878787878788) internal successors, (3026), 825 states have internal predecessors, (3026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 3026 transitions. [2021-06-05 14:22:30,526 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 3026 transitions. Word has length 18 [2021-06-05 14:22:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:30,526 INFO L482 AbstractCegarLoop]: Abstraction has 826 states and 3026 transitions. [2021-06-05 14:22:30,526 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:30,526 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 3026 transitions. [2021-06-05 14:22:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:30,527 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:30,527 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:30,727 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3407,301 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:30,727 INFO L430 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash -623377692, now seen corresponding path program 155 times [2021-06-05 14:22:30,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:30,728 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759594571] [2021-06-05 14:22:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:22:30,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:30,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759594571] [2021-06-05 14:22:30,772 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759594571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:30,772 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505876490] [2021-06-05 14:22:30,773 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 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:22:30,799 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:22:30,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:30,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 14:22:30,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:30,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 7 treesize of output 5 [2021-06-05 14:22:30,848 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:30,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 18 treesize of output 14 [2021-06-05 14:22:30,850 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:30,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:30,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 10 treesize of output 6 [2021-06-05 14:22:30,864 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:30,875 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:30,875 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:30,875 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 14:22:30,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:22:30,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505876490] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:30,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:30,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-06-05 14:22:30,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969130238] [2021-06-05 14:22:30,932 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 14:22:30,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:30,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 14:22:30,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-06-05 14:22:30,933 INFO L87 Difference]: Start difference. First operand 826 states and 3026 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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:22:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:31,307 INFO L93 Difference]: Finished difference Result 1161 states and 3992 transitions. [2021-06-05 14:22:31,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:22:31,308 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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:22:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:31,309 INFO L225 Difference]: With dead ends: 1161 [2021-06-05 14:22:31,309 INFO L226 Difference]: Without dead ends: 1098 [2021-06-05 14:22:31,310 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 327.5ms TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:22:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2021-06-05 14:22:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 856. [2021-06-05 14:22:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 3.709941520467836) internal successors, (3172), 855 states have internal predecessors, (3172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 3172 transitions. [2021-06-05 14:22:31,321 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 3172 transitions. Word has length 18 [2021-06-05 14:22:31,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:31,322 INFO L482 AbstractCegarLoop]: Abstraction has 856 states and 3172 transitions. [2021-06-05 14:22:31,322 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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:22:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 3172 transitions. [2021-06-05 14:22:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:31,330 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:31,330 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:31,530 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3421,302 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:31,531 INFO L430 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:31,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:31,531 INFO L82 PathProgramCache]: Analyzing trace with hash -869997864, now seen corresponding path program 156 times [2021-06-05 14:22:31,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:31,531 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376773809] [2021-06-05 14:22:31,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:22:31,581 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:31,581 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376773809] [2021-06-05 14:22:31,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376773809] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:31,581 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158856001] [2021-06-05 14:22:31,581 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 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:22:31,607 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:22:31,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:31,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:22:31,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:31,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:31,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 17 treesize of output 13 [2021-06-05 14:22:31,691 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:31,693 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:22:31,693 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:31,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:31,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:22:31,696 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:31,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:22:31,699 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:31,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:22:31,702 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:31,704 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:22:31,705 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:31,737 INFO L628 ElimStorePlain]: treesize reduction 6, result has 88.5 percent of original size [2021-06-05 14:22:31,738 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:31,738 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:129, output treesize:46 [2021-06-05 14:22:31,774 INFO L446 ElimStorePlain]: Different costs {0=[array_0, array_2, v_prenex_841], 1=[v_prenex_842]} [2021-06-05 14:22:31,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 18 treesize of output 14 [2021-06-05 14:22:31,777 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:31,801 INFO L628 ElimStorePlain]: treesize reduction 40, result has 47.4 percent of original size [2021-06-05 14:22:31,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 10 treesize of output 6 [2021-06-05 14:22:31,804 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:31,815 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:31,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_841 vanished before elimination [2021-06-05 14:22:31,815 INFO L518 ElimStorePlain]: Eliminatee v_prenex_842 vanished before elimination [2021-06-05 14:22:31,816 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:31,816 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:83, output treesize:30 [2021-06-05 14:22:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:31,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158856001] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:31,848 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:31,848 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:22:31,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891412656] [2021-06-05 14:22:31,848 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:31,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:31,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:31,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:31,849 INFO L87 Difference]: Start difference. First operand 856 states and 3172 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:32,603 INFO L93 Difference]: Finished difference Result 1058 states and 3660 transitions. [2021-06-05 14:22:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 14:22:32,603 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:32,605 INFO L225 Difference]: With dead ends: 1058 [2021-06-05 14:22:32,605 INFO L226 Difference]: Without dead ends: 996 [2021-06-05 14:22:32,605 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 578.7ms TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2021-06-05 14:22:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-06-05 14:22:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 834. [2021-06-05 14:22:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 833 states have (on average 3.6614645858343335) internal successors, (3050), 833 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 3050 transitions. [2021-06-05 14:22:32,615 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 3050 transitions. Word has length 18 [2021-06-05 14:22:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:32,615 INFO L482 AbstractCegarLoop]: Abstraction has 834 states and 3050 transitions. [2021-06-05 14:22:32,615 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 3050 transitions. [2021-06-05 14:22:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:32,616 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:32,616 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:32,816 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3428,303 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:32,816 INFO L430 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:32,817 INFO L82 PathProgramCache]: Analyzing trace with hash -696750172, now seen corresponding path program 157 times [2021-06-05 14:22:32,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:32,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269518087] [2021-06-05 14:22:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:22:32,873 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:32,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269518087] [2021-06-05 14:22:32,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269518087] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:32,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161053342] [2021-06-05 14:22:32,873 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 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:22:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:32,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:22:32,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:32,980 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:32,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 17 treesize of output 13 [2021-06-05 14:22:32,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:32,983 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:22:32,984 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:32,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:32,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 16 treesize of output 12 [2021-06-05 14:22:32,987 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:32,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 7 treesize of output 5 [2021-06-05 14:22:32,989 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:32,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 7 treesize of output 5 [2021-06-05 14:22:32,992 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:32,994 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:22:32,995 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:33,027 INFO L628 ElimStorePlain]: treesize reduction 6, result has 88.5 percent of original size [2021-06-05 14:22:33,027 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:33,027 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:129, output treesize:46 [2021-06-05 14:22:33,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:22:33,082 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:33,085 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 14:22:33,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 10 treesize of output 6 [2021-06-05 14:22:33,087 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:33,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:33,089 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:33,089 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 14:22:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:33,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161053342] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:33,100 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:33,100 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:22:33,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774811465] [2021-06-05 14:22:33,100 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:33,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:33,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:33,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:33,101 INFO L87 Difference]: Start difference. First operand 834 states and 3050 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:34,129 INFO L93 Difference]: Finished difference Result 1132 states and 3930 transitions. [2021-06-05 14:22:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 14:22:34,130 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:34,131 INFO L225 Difference]: With dead ends: 1132 [2021-06-05 14:22:34,131 INFO L226 Difference]: Without dead ends: 1078 [2021-06-05 14:22:34,132 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 759.0ms TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 14:22:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2021-06-05 14:22:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 837. [2021-06-05 14:22:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 3.648325358851675) internal successors, (3050), 836 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 3050 transitions. [2021-06-05 14:22:34,142 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 3050 transitions. Word has length 18 [2021-06-05 14:22:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:34,142 INFO L482 AbstractCegarLoop]: Abstraction has 837 states and 3050 transitions. [2021-06-05 14:22:34,142 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:22:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 3050 transitions. [2021-06-05 14:22:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:34,143 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:34,143 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:34,344 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 304 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3438 [2021-06-05 14:22:34,344 INFO L430 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash -565449940, now seen corresponding path program 158 times [2021-06-05 14:22:34,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:34,346 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138244104] [2021-06-05 14:22:34,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:34,749 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2021-06-05 14:22:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:35,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:35,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138244104] [2021-06-05 14:22:35,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138244104] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:35,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874923597] [2021-06-05 14:22:35,020 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 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:22:35,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:22:35,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:35,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:35,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:35,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:35,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 16 treesize of output 12 [2021-06-05 14:22:35,168 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:35,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:35,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 26 treesize of output 20 [2021-06-05 14:22:35,172 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:35,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:35,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:35,176 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22: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 15 treesize of output 11 [2021-06-05 14:22:35,179 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:35,223 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:35,224 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:35,224 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 14:22:35,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:22:35,431 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:35,438 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:35,438 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:22:35,438 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:35,438 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:22:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:35,477 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874923597] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:35,477 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:35,477 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:22:35,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669255874] [2021-06-05 14:22:35,477 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:22:35,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:35,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:22:35,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:22:35,479 INFO L87 Difference]: Start difference. First operand 837 states and 3050 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:36,233 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-06-05 14:22:36,606 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2021-06-05 14:22:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:36,752 INFO L93 Difference]: Finished difference Result 932 states and 3319 transitions. [2021-06-05 14:22:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:22:36,754 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:36,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:36,762 INFO L225 Difference]: With dead ends: 932 [2021-06-05 14:22:36,762 INFO L226 Difference]: Without dead ends: 922 [2021-06-05 14:22:36,762 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1634.4ms TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:22:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2021-06-05 14:22:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 841. [2021-06-05 14:22:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 3.645238095238095) internal successors, (3062), 840 states have internal predecessors, (3062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 3062 transitions. [2021-06-05 14:22:36,775 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 3062 transitions. Word has length 18 [2021-06-05 14:22:36,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:36,775 INFO L482 AbstractCegarLoop]: Abstraction has 841 states and 3062 transitions. [2021-06-05 14:22:36,775 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:36,775 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 3062 transitions. [2021-06-05 14:22:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:36,776 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:36,776 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:36,977 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 305 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3448 [2021-06-05 14:22:36,977 INFO L430 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:36,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:36,977 INFO L82 PathProgramCache]: Analyzing trace with hash 733291496, now seen corresponding path program 159 times [2021-06-05 14:22:36,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:36,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402097153] [2021-06-05 14:22:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:37,023 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:37,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402097153] [2021-06-05 14:22:37,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402097153] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:37,023 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747752623] [2021-06-05 14:22:37,023 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 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:22:37,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:22:37,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:37,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:22:37,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:37,124 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:37,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 15 treesize of output 11 [2021-06-05 14:22:37,125 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:37,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:22:37,128 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:37,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 25 treesize of output 19 [2021-06-05 14:22:37,132 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,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 26 treesize of output 20 [2021-06-05 14:22:37,134 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:37,163 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:37,163 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:87 [2021-06-05 14:22:37,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:37,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 17 treesize of output 13 [2021-06-05 14:22:37,255 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,257 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:22:37,257 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,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 7 treesize of output 5 [2021-06-05 14:22:37,260 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:22:37,263 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:22:37,266 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,267 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:22:37,268 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,270 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:22:37,270 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,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 16 treesize of output 12 [2021-06-05 14:22:37,272 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:37,298 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 14:22:37,298 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:22:37,299 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:37,299 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 14:22:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:37,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747752623] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:37,334 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:37,334 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:22:37,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768407476] [2021-06-05 14:22:37,335 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:37,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:37,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:37,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:37,335 INFO L87 Difference]: Start difference. First operand 841 states and 3062 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:22:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:37,965 INFO L93 Difference]: Finished difference Result 1193 states and 4069 transitions. [2021-06-05 14:22:37,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 14:22:37,965 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:22:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:37,967 INFO L225 Difference]: With dead ends: 1193 [2021-06-05 14:22:37,967 INFO L226 Difference]: Without dead ends: 1117 [2021-06-05 14:22:37,967 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 504.0ms TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:22:37,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2021-06-05 14:22:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 866. [2021-06-05 14:22:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 865 states have (on average 3.7179190751445086) internal successors, (3216), 865 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 3216 transitions. [2021-06-05 14:22:37,979 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 3216 transitions. Word has length 18 [2021-06-05 14:22:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:37,979 INFO L482 AbstractCegarLoop]: Abstraction has 866 states and 3216 transitions. [2021-06-05 14:22:37,979 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:22:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 3216 transitions. [2021-06-05 14:22:37,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:37,980 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:37,980 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:38,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 306 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3462 [2021-06-05 14:22:38,180 INFO L430 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:38,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:38,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290764, now seen corresponding path program 160 times [2021-06-05 14:22:38,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:38,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474300493] [2021-06-05 14:22:38,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:38,377 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:38,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474300493] [2021-06-05 14:22:38,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474300493] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:38,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244511186] [2021-06-05 14:22:38,377 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 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:22:38,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:22:38,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:38,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:22:38,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:38,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:38,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:38,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 15 treesize of output 11 [2021-06-05 14:22:38,524 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:38,557 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:38,558 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:38,558 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:71 [2021-06-05 14:22:38,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:38,732 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:38,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 27 treesize of output 21 [2021-06-05 14:22:38,733 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:38,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:38,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:38,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:22:38,738 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:38,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:38,741 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:38,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 25 treesize of output 19 [2021-06-05 14:22:38,742 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:38,745 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:38,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:22:38,746 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:38,800 INFO L628 ElimStorePlain]: treesize reduction 79, result has 42.3 percent of original size [2021-06-05 14:22:38,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:38,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 11 treesize of output 7 [2021-06-05 14:22:38,804 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:38,823 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:38,825 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:38,825 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:173, output treesize:44 [2021-06-05 14:22:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:38,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244511186] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:38,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:38,888 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 14:22:38,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381256648] [2021-06-05 14:22:38,888 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:22:38,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:38,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:22:38,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:22:38,888 INFO L87 Difference]: Start difference. First operand 866 states and 3216 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:22:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:39,169 INFO L93 Difference]: Finished difference Result 900 states and 3303 transitions. [2021-06-05 14:22:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:39,169 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:22:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:39,171 INFO L225 Difference]: With dead ends: 900 [2021-06-05 14:22:39,171 INFO L226 Difference]: Without dead ends: 887 [2021-06-05 14:22:39,171 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 503.8ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:22:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-06-05 14:22:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 873. [2021-06-05 14:22:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 3.7121559633027523) internal successors, (3237), 872 states have internal predecessors, (3237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 3237 transitions. [2021-06-05 14:22:39,180 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 3237 transitions. Word has length 18 [2021-06-05 14:22:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:39,180 INFO L482 AbstractCegarLoop]: Abstraction has 873 states and 3237 transitions. [2021-06-05 14:22:39,180 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:22:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 3237 transitions. [2021-06-05 14:22:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:39,181 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:39,181 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:39,381 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 307 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3474 [2021-06-05 14:22:39,382 INFO L430 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:39,382 INFO L82 PathProgramCache]: Analyzing trace with hash -642697982, now seen corresponding path program 161 times [2021-06-05 14:22:39,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:39,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991706665] [2021-06-05 14:22:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:39,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:39,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991706665] [2021-06-05 14:22:39,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991706665] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:39,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152024853] [2021-06-05 14:22:39,572 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 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:22:39,598 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:22:39,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:39,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:39,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:39,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:39,687 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:39,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 25 treesize of output 19 [2021-06-05 14:22:39,690 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:39,714 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:39,715 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:39,715 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 14:22:39,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:39,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:39,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:22:39,770 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:39,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:39,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:39,774 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:39,823 INFO L628 ElimStorePlain]: treesize reduction 85, result has 39.7 percent of original size [2021-06-05 14:22:39,823 INFO L518 ElimStorePlain]: Eliminatee v_prenex_845 vanished before elimination [2021-06-05 14:22:39,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:39,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:22:39,826 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:39,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:39,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:39,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:22:39,847 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:39,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:39,864 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:39,864 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 14:22:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:39,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152024853] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:39,917 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:39,917 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:22:39,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285631735] [2021-06-05 14:22:39,917 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:22:39,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:39,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:22:39,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:22:39,918 INFO L87 Difference]: Start difference. First operand 873 states and 3237 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:22:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:40,204 INFO L93 Difference]: Finished difference Result 902 states and 3320 transitions. [2021-06-05 14:22:40,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:40,205 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:22:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:40,206 INFO L225 Difference]: With dead ends: 902 [2021-06-05 14:22:40,206 INFO L226 Difference]: Without dead ends: 897 [2021-06-05 14:22:40,206 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 359.5ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:22:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-06-05 14:22:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 870. [2021-06-05 14:22:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 3.714614499424626) internal successors, (3228), 869 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 3228 transitions. [2021-06-05 14:22:40,215 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 3228 transitions. Word has length 18 [2021-06-05 14:22:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:40,215 INFO L482 AbstractCegarLoop]: Abstraction has 870 states and 3228 transitions. [2021-06-05 14:22:40,215 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:22:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 3228 transitions. [2021-06-05 14:22:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:40,216 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:40,216 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:40,417 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3488,308 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:40,417 INFO L430 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1516438662, now seen corresponding path program 162 times [2021-06-05 14:22:40,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:40,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773824435] [2021-06-05 14:22:40,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:40,635 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:40,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773824435] [2021-06-05 14:22:40,635 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773824435] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:40,635 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103273450] [2021-06-05 14:22:40,635 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 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:22:40,663 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:22:40,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:40,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:40,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:40,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 25 treesize of output 19 [2021-06-05 14:22:40,768 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:40,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 15 treesize of output 11 [2021-06-05 14:22:40,771 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:40,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:40,786 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:40,786 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:50 [2021-06-05 14:22:40,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:40,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 25 treesize of output 19 [2021-06-05 14:22:40,834 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:40,836 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:40,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:22:40,837 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:40,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:40,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:22:40,840 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:40,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 15 treesize of output 11 [2021-06-05 14:22:40,843 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:40,878 INFO L628 ElimStorePlain]: treesize reduction 68, result has 38.7 percent of original size [2021-06-05 14:22:40,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 11 treesize of output 7 [2021-06-05 14:22:40,882 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:40,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:40,896 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:40,896 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 14:22:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:40,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103273450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:40,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:40,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:22:40,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062483586] [2021-06-05 14:22:40,957 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:22:40,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:40,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:22:40,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:22:40,957 INFO L87 Difference]: Start difference. First operand 870 states and 3228 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:41,491 INFO L93 Difference]: Finished difference Result 905 states and 3329 transitions. [2021-06-05 14:22:41,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:41,492 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:41,493 INFO L225 Difference]: With dead ends: 905 [2021-06-05 14:22:41,493 INFO L226 Difference]: Without dead ends: 900 [2021-06-05 14:22:41,493 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 615.3ms TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:22:41,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-06-05 14:22:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 870. [2021-06-05 14:22:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 3.714614499424626) internal successors, (3228), 869 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 3228 transitions. [2021-06-05 14:22:41,502 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 3228 transitions. Word has length 18 [2021-06-05 14:22:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:41,502 INFO L482 AbstractCegarLoop]: Abstraction has 870 states and 3228 transitions. [2021-06-05 14:22:41,502 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 3228 transitions. [2021-06-05 14:22:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:41,503 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:41,503 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:41,703 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3498,309 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:41,704 INFO L430 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:41,704 INFO L82 PathProgramCache]: Analyzing trace with hash -967522252, now seen corresponding path program 163 times [2021-06-05 14:22:41,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:41,704 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542981870] [2021-06-05 14:22:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:42,008 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:42,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542981870] [2021-06-05 14:22:42,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542981870] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:42,008 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262387726] [2021-06-05 14:22:42,008 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 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:42,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:22:42,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:42,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:42,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:22:42,129 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:42,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:42,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 26 treesize of output 20 [2021-06-05 14:22:42,132 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:42,135 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:42,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:42,136 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:42,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:22:42,139 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:42,183 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:42,184 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:42,184 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 14:22:42,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:42,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:42,351 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:42,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:42,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:22:42,355 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:42,357 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:42,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:42,358 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:42,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:42,361 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:42,399 INFO L628 ElimStorePlain]: treesize reduction 67, result has 43.7 percent of original size [2021-06-05 14:22:42,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:22:42,402 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:42,416 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:42,417 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:42,417 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 14:22:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:42,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262387726] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:42,481 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:42,481 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 14:22:42,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531515501] [2021-06-05 14:22:42,481 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:22:42,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:42,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:22:42,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:22:42,482 INFO L87 Difference]: Start difference. First operand 870 states and 3228 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:42,936 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-06-05 14:22:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:43,323 INFO L93 Difference]: Finished difference Result 909 states and 3329 transitions. [2021-06-05 14:22:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:43,324 INFO L225 Difference]: With dead ends: 909 [2021-06-05 14:22:43,324 INFO L226 Difference]: Without dead ends: 896 [2021-06-05 14:22:43,324 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1071.2ms TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:22:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2021-06-05 14:22:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 877. [2021-06-05 14:22:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7100456621004567) internal successors, (3250), 876 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3250 transitions. [2021-06-05 14:22:43,334 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3250 transitions. Word has length 18 [2021-06-05 14:22:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:43,334 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3250 transitions. [2021-06-05 14:22:43,334 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3250 transitions. [2021-06-05 14:22:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:43,335 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:43,335 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:43,535 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 310 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3509 [2021-06-05 14:22:43,536 INFO L430 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:43,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:43,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1387456298, now seen corresponding path program 164 times [2021-06-05 14:22:43,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:43,536 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836268183] [2021-06-05 14:22:43,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:43,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:43,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836268183] [2021-06-05 14:22:43,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836268183] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:43,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380378343] [2021-06-05 14:22:43,834 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 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:43,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:22:43,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:43,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:43,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:43,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:43,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 26 treesize of output 20 [2021-06-05 14:22:43,945 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:43,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:43,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:22:43,948 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:43,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:43,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 16 treesize of output 12 [2021-06-05 14:22:43,952 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:43,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:43,955 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:43,989 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:43,990 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:43,990 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:111 [2021-06-05 14:22:44,097 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:44,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 25 treesize of output 19 [2021-06-05 14:22:44,098 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:44,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:44,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 35 treesize of output 27 [2021-06-05 14:22:44,102 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:44,104 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:44,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:22:44,105 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:44,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:44,108 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:44,143 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 14:22:44,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 22 treesize of output 14 [2021-06-05 14:22:44,146 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:44,159 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:44,160 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:44,160 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:22:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:44,223 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380378343] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:44,223 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:44,223 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:22:44,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496087192] [2021-06-05 14:22:44,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:22:44,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:44,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:22:44,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:22:44,224 INFO L87 Difference]: Start difference. First operand 877 states and 3250 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:44,826 INFO L93 Difference]: Finished difference Result 917 states and 3367 transitions. [2021-06-05 14:22:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:44,826 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:44,827 INFO L225 Difference]: With dead ends: 917 [2021-06-05 14:22:44,827 INFO L226 Difference]: Without dead ends: 912 [2021-06-05 14:22:44,827 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 775.9ms TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:22:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2021-06-05 14:22:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 874. [2021-06-05 14:22:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 3.7124856815578466) internal successors, (3241), 873 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:44,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 3241 transitions. [2021-06-05 14:22:44,837 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 3241 transitions. Word has length 18 [2021-06-05 14:22:44,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:44,837 INFO L482 AbstractCegarLoop]: Abstraction has 874 states and 3241 transitions. [2021-06-05 14:22:44,837 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 3241 transitions. [2021-06-05 14:22:44,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:44,838 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:44,838 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:45,038 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3522,311 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:45,038 INFO L430 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:45,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:45,038 INFO L82 PathProgramCache]: Analyzing trace with hash -760429270, now seen corresponding path program 165 times [2021-06-05 14:22:45,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:45,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94864595] [2021-06-05 14:22:45,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:45,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:45,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94864595] [2021-06-05 14:22:45,284 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94864595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:45,284 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588240165] [2021-06-05 14:22:45,284 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 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:45,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:22:45,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:45,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:45,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:45,378 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:45,379 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:45,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 16 treesize of output 12 [2021-06-05 14:22:45,379 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:45,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:45,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:45,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 25 treesize of output 19 [2021-06-05 14:22:45,384 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:45,386 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:45,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:45,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:22:45,388 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:45,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:45,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 26 treesize of output 20 [2021-06-05 14:22:45,391 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:45,432 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:45,433 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:45,433 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:179, output treesize:147 [2021-06-05 14:22:45,548 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 14:22:45,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 15 treesize of output 11 [2021-06-05 14:22:45,551 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:45,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 25 treesize of output 19 [2021-06-05 14:22:45,555 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:45,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 25 treesize of output 19 [2021-06-05 14:22:45,558 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:45,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:22:45,561 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:45,602 INFO L628 ElimStorePlain]: treesize reduction 80, result has 38.0 percent of original size [2021-06-05 14:22:45,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:45,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 11 treesize of output 7 [2021-06-05 14:22:45,606 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:45,622 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:45,623 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:45,623 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:163, output treesize:41 [2021-06-05 14:22:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:45,688 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588240165] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:45,688 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:45,688 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:22:45,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712918299] [2021-06-05 14:22:45,688 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:22:45,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:45,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:22:45,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:22:45,689 INFO L87 Difference]: Start difference. First operand 874 states and 3241 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:22:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:46,179 INFO L93 Difference]: Finished difference Result 914 states and 3363 transitions. [2021-06-05 14:22:46,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:46,180 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:22:46,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:46,181 INFO L225 Difference]: With dead ends: 914 [2021-06-05 14:22:46,181 INFO L226 Difference]: Without dead ends: 909 [2021-06-05 14:22:46,181 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 614.7ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:22:46,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-06-05 14:22:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 876. [2021-06-05 14:22:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 3.7142857142857144) internal successors, (3250), 875 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 3250 transitions. [2021-06-05 14:22:46,190 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 3250 transitions. Word has length 18 [2021-06-05 14:22:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:46,191 INFO L482 AbstractCegarLoop]: Abstraction has 876 states and 3250 transitions. [2021-06-05 14:22:46,191 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:22:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 3250 transitions. [2021-06-05 14:22:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:46,192 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:46,192 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:46,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 312 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3537 [2021-06-05 14:22:46,392 INFO L430 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:46,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:46,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1410421392, now seen corresponding path program 166 times [2021-06-05 14:22:46,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:46,392 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777891191] [2021-06-05 14:22:46,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:46,793 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 14:22:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:47,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:47,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777891191] [2021-06-05 14:22:47,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777891191] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:47,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662416662] [2021-06-05 14:22:47,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 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:47,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:22:47,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:47,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:47,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:47,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:47,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:22:47,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:47,339 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:47,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:22:47,340 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:47,342 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:47,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 25 treesize of output 19 [2021-06-05 14:22:47,343 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:47,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:47,346 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:47,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:47,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:47,392 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 14:22:47,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:22:47,561 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:47,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 19 treesize of output 15 [2021-06-05 14:22:47,563 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:47,576 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 14:22:47,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 11 treesize of output 7 [2021-06-05 14:22:47,578 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:47,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:47,584 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:47,584 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 14:22:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:47,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662416662] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:47,617 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:47,617 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:22:47,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057306792] [2021-06-05 14:22:47,617 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:22:47,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:22:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:22:47,617 INFO L87 Difference]: Start difference. First operand 876 states and 3250 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:48,142 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-06-05 14:22:48,363 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2021-06-05 14:22:48,585 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 60 [2021-06-05 14:22:48,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:48,668 INFO L93 Difference]: Finished difference Result 914 states and 3350 transitions. [2021-06-05 14:22:48,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:48,668 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:48,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:48,669 INFO L225 Difference]: With dead ends: 914 [2021-06-05 14:22:48,669 INFO L226 Difference]: Without dead ends: 909 [2021-06-05 14:22:48,670 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1657.8ms TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:22:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-06-05 14:22:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 881. [2021-06-05 14:22:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7170454545454548) internal successors, (3271), 880 states have internal predecessors, (3271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3271 transitions. [2021-06-05 14:22:48,679 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3271 transitions. Word has length 18 [2021-06-05 14:22:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:48,679 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3271 transitions. [2021-06-05 14:22:48,679 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:48,679 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3271 transitions. [2021-06-05 14:22:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:48,680 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:48,680 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:48,880 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 313 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3551 [2021-06-05 14:22:48,881 INFO L430 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:48,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:48,881 INFO L82 PathProgramCache]: Analyzing trace with hash 944557158, now seen corresponding path program 167 times [2021-06-05 14:22:48,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:48,881 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710156587] [2021-06-05 14:22:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:49,325 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:49,325 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710156587] [2021-06-05 14:22:49,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710156587] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:49,325 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875102798] [2021-06-05 14:22:49,325 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 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:49,353 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:22:49,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:49,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 14:22:49,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:49,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:49,541 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:22:49,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 14:22:49,542 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:49,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:49,547 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:22:49,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 14:22:49,548 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:49,553 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:49,557 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 14:22:49,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 14:22:49,558 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:49,565 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 14:22:49,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 36 [2021-06-05 14:22:49,566 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:49,683 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2021-06-05 14:22:49,683 INFO L628 ElimStorePlain]: treesize reduction 8, result has 94.7 percent of original size [2021-06-05 14:22:49,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:49,685 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:211, output treesize:135 [2021-06-05 14:22:49,770 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_847, array_2], 1=[v_prenex_848, array_4]} [2021-06-05 14:22:49,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 35 treesize of output 27 [2021-06-05 14:22:49,774 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22: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 25 treesize of output 19 [2021-06-05 14:22:49,777 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:49,818 INFO L628 ElimStorePlain]: treesize reduction 75, result has 42.7 percent of original size [2021-06-05 14:22:49,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 7 treesize of output 5 [2021-06-05 14:22:49,821 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:49,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:49,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 22 treesize of output 14 [2021-06-05 14:22:49,837 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:49,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:49,851 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:22:49,852 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:49,852 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 14:22:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:49,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875102798] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:49,917 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:49,917 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:22:49,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943469862] [2021-06-05 14:22:49,917 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:22:49,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:49,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:22:49,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:22:49,917 INFO L87 Difference]: Start difference. First operand 881 states and 3271 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:50,365 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2021-06-05 14:22:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:50,682 INFO L93 Difference]: Finished difference Result 937 states and 3411 transitions. [2021-06-05 14:22:50,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:50,682 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:50,684 INFO L225 Difference]: With dead ends: 937 [2021-06-05 14:22:50,684 INFO L226 Difference]: Without dead ends: 932 [2021-06-05 14:22:50,684 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1054.1ms TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:22:50,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2021-06-05 14:22:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 877. [2021-06-05 14:22:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7146118721461185) internal successors, (3254), 876 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3254 transitions. [2021-06-05 14:22:50,693 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3254 transitions. Word has length 18 [2021-06-05 14:22:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:50,693 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3254 transitions. [2021-06-05 14:22:50,693 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3254 transitions. [2021-06-05 14:22:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:50,694 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:50,694 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:50,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3565,314 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:50,895 INFO L430 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:50,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:50,895 INFO L82 PathProgramCache]: Analyzing trace with hash 2143112230, now seen corresponding path program 168 times [2021-06-05 14:22:50,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:50,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241542995] [2021-06-05 14:22:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:51,381 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 14:22:51,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:51,703 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:51,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241542995] [2021-06-05 14:22:51,703 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241542995] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:51,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130633297] [2021-06-05 14:22:51,703 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 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:51,729 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:22:51,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:51,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:51,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:51,837 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:51,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 16 treesize of output 12 [2021-06-05 14:22:51,838 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:51,841 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:51,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 26 treesize of output 20 [2021-06-05 14:22:51,842 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:51,845 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:51,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:51,846 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:51,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:51,849 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:51,893 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:51,894 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:51,894 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 14:22:52,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 27 treesize of output 21 [2021-06-05 14:22:52,080 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:52,086 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:52,086 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:22:52,086 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:52,086 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:22:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:52,117 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130633297] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:52,117 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:52,117 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:22:52,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143448061] [2021-06-05 14:22:52,117 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:22:52,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:52,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:22:52,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:22:52,117 INFO L87 Difference]: Start difference. First operand 877 states and 3254 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:52,658 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2021-06-05 14:22:53,110 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 79 [2021-06-05 14:22:53,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:53,376 INFO L93 Difference]: Finished difference Result 911 states and 3339 transitions. [2021-06-05 14:22:53,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:22:53,376 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:53,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:53,378 INFO L225 Difference]: With dead ends: 911 [2021-06-05 14:22:53,378 INFO L226 Difference]: Without dead ends: 906 [2021-06-05 14:22:53,378 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1803.3ms TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:22:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-06-05 14:22:53,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 877. [2021-06-05 14:22:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7146118721461185) internal successors, (3254), 876 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:53,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3254 transitions. [2021-06-05 14:22:53,396 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3254 transitions. Word has length 18 [2021-06-05 14:22:53,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:53,396 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3254 transitions. [2021-06-05 14:22:53,396 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:53,396 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3254 transitions. [2021-06-05 14:22:53,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:53,397 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:53,397 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:53,597 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 315 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3580 [2021-06-05 14:22:53,598 INFO L430 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:53,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:53,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1636765964, now seen corresponding path program 169 times [2021-06-05 14:22:53,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:53,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333194430] [2021-06-05 14:22:53,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:54,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:54,119 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:54,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333194430] [2021-06-05 14:22:54,119 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333194430] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:54,119 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988449766] [2021-06-05 14:22:54,119 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 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:54,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:54,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:54,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:54,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 16 treesize of output 12 [2021-06-05 14:22:54,306 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:54,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:54,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:54,311 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:54,315 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:54,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:22:54,316 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:54,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:54,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 16 treesize of output 12 [2021-06-05 14:22:54,321 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:54,325 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:54,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:54,326 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:54,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:54,330 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:54,381 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:54,382 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:22:54,382 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:135 [2021-06-05 14:22:54,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:22:54,493 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:54,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 19 treesize of output 15 [2021-06-05 14:22:54,496 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:54,508 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 14:22:54,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:22:54,511 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:54,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:54,517 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:22:54,517 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 14:22:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:54,544 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988449766] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:54,544 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:54,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:22:54,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269389991] [2021-06-05 14:22:54,545 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:22:54,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:22:54,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:22:54,545 INFO L87 Difference]: Start difference. First operand 877 states and 3254 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:55,043 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2021-06-05 14:22:55,206 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-06-05 14:22:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:55,285 INFO L93 Difference]: Finished difference Result 906 states and 3325 transitions. [2021-06-05 14:22:55,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:22:55,285 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:55,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:55,286 INFO L225 Difference]: With dead ends: 906 [2021-06-05 14:22:55,287 INFO L226 Difference]: Without dead ends: 901 [2021-06-05 14:22:55,287 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1197.3ms TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:22:55,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2021-06-05 14:22:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 877. [2021-06-05 14:22:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 3.7146118721461185) internal successors, (3254), 876 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 3254 transitions. [2021-06-05 14:22:55,296 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 3254 transitions. Word has length 18 [2021-06-05 14:22:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:55,296 INFO L482 AbstractCegarLoop]: Abstraction has 877 states and 3254 transitions. [2021-06-05 14:22:55,296 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 3254 transitions. [2021-06-05 14:22:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:55,297 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:55,297 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:55,497 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 316 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3595 [2021-06-05 14:22:55,498 INFO L430 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:55,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:55,498 INFO L82 PathProgramCache]: Analyzing trace with hash 233346690, now seen corresponding path program 170 times [2021-06-05 14:22:55,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:55,498 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524478555] [2021-06-05 14:22:55,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:56,076 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2021-06-05 14:22:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:56,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:56,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524478555] [2021-06-05 14:22:56,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524478555] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:56,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465048428] [2021-06-05 14:22:56,359 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 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:56,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:22:56,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:56,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:56,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:56,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:56,504 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:22:56,507 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,510 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:56,511 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,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 25 treesize of output 19 [2021-06-05 14:22:56,514 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,549 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:56,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:56,550 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:113 [2021-06-05 14:22:56,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 23 [2021-06-05 14:22:56,629 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,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 15 treesize of output 11 [2021-06-05 14:22:56,633 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,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 30 treesize of output 24 [2021-06-05 14:22:56,637 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,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 18 treesize of output 14 [2021-06-05 14:22:56,640 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:22:56,644 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,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 18 treesize of output 14 [2021-06-05 14:22:56,648 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,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 16 treesize of output 12 [2021-06-05 14:22:56,652 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,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 17 treesize of output 13 [2021-06-05 14:22:56,655 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:56,750 INFO L628 ElimStorePlain]: treesize reduction 112, result has 51.9 percent of original size [2021-06-05 14:22:56,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,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 12 treesize of output 8 [2021-06-05 14:22:56,754 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:56,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:56,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 11 treesize of output 7 [2021-06-05 14:22:56,758 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22: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 12 treesize of output 8 [2021-06-05 14:22:56,762 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:56,801 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:56,802 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:22:56,802 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:297, output treesize:97 [2021-06-05 14:22:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:56,946 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465048428] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:56,946 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:56,946 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:22:56,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294224329] [2021-06-05 14:22:56,946 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:22:56,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:56,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:22:56,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:22:56,947 INFO L87 Difference]: Start difference. First operand 877 states and 3254 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:57,629 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2021-06-05 14:22:57,843 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2021-06-05 14:22:58,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:22:58,247 INFO L93 Difference]: Finished difference Result 946 states and 3440 transitions. [2021-06-05 14:22:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:22:58,248 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:22:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:22:58,249 INFO L225 Difference]: With dead ends: 946 [2021-06-05 14:22:58,249 INFO L226 Difference]: Without dead ends: 941 [2021-06-05 14:22:58,249 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1854.6ms TimeCoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:22:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2021-06-05 14:22:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 881. [2021-06-05 14:22:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.715909090909091) internal successors, (3270), 880 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3270 transitions. [2021-06-05 14:22:58,259 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3270 transitions. Word has length 18 [2021-06-05 14:22:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:22:58,259 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3270 transitions. [2021-06-05 14:22:58,259 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:22:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3270 transitions. [2021-06-05 14:22:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:22:58,260 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:22:58,260 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:22:58,460 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 317 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3609 [2021-06-05 14:22:58,460 INFO L430 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:22:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:22:58,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1594902796, now seen corresponding path program 171 times [2021-06-05 14:22:58,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:22:58,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457390458] [2021-06-05 14:22:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:22:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:22:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:59,097 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:22:59,097 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457390458] [2021-06-05 14:22:59,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457390458] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:59,097 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365476429] [2021-06-05 14:22:59,097 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 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:22:59,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:22:59,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:22:59,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:22:59,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:22:59,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:59,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:22:59,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:59,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 35 treesize of output 27 [2021-06-05 14:22:59,240 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:59,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 25 treesize of output 19 [2021-06-05 14:22:59,244 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:59,247 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,281 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:59,282 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:22:59,282 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:117 [2021-06-05 14:22:59,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:59,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:22:59,361 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,364 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:59,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-06-05 14:22:59,365 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,367 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:59,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 17 treesize of output 13 [2021-06-05 14:22:59,368 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:59,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:22:59,372 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:59,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:22:59,376 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,379 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:59,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:22:59,380 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:59,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 16 treesize of output 12 [2021-06-05 14:22:59,383 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,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 30 treesize of output 24 [2021-06-05 14:22:59,387 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:22:59,481 INFO L628 ElimStorePlain]: treesize reduction 116, result has 49.3 percent of original size [2021-06-05 14:22:59,484 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:22:59,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:22:59,485 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:59,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 11 treesize of output 7 [2021-06-05 14:22:59,489 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:22:59,529 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:22:59,530 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:22:59,530 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:305, output treesize:97 [2021-06-05 14:22:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:22:59,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365476429] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:22:59,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:22:59,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:22:59,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316937474] [2021-06-05 14:22:59,712 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:22:59,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:22:59,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:22:59,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:22:59,712 INFO L87 Difference]: Start difference. First operand 881 states and 3270 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:00,045 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 54 [2021-06-05 14:23:00,225 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2021-06-05 14:23:00,795 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2021-06-05 14:23:00,998 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2021-06-05 14:23:01,485 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2021-06-05 14:23:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:01,641 INFO L93 Difference]: Finished difference Result 928 states and 3392 transitions. [2021-06-05 14:23:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:23:01,641 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:01,643 INFO L225 Difference]: With dead ends: 928 [2021-06-05 14:23:01,643 INFO L226 Difference]: Without dead ends: 922 [2021-06-05 14:23:01,643 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2288.4ms TimeCoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2021-06-05 14:23:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2021-06-05 14:23:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 879. [2021-06-05 14:23:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 3.715261958997722) internal successors, (3262), 878 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3262 transitions. [2021-06-05 14:23:01,653 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3262 transitions. Word has length 18 [2021-06-05 14:23:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:01,653 INFO L482 AbstractCegarLoop]: Abstraction has 879 states and 3262 transitions. [2021-06-05 14:23:01,653 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3262 transitions. [2021-06-05 14:23:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:01,654 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:01,654 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:01,854 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3625,318 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:01,854 INFO L430 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2132758374, now seen corresponding path program 172 times [2021-06-05 14:23:01,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:01,855 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500155096] [2021-06-05 14:23:01,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:02,304 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:02,304 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500155096] [2021-06-05 14:23:02,304 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500155096] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:02,304 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903741958] [2021-06-05 14:23:02,304 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 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:02,330 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:23:02,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:02,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:23:02,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:02,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:23:02,433 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,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 25 treesize of output 19 [2021-06-05 14:23:02,437 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:02,441 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,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 35 treesize of output 27 [2021-06-05 14:23:02,444 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,490 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:02,492 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:02,492 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:169, output treesize:131 [2021-06-05 14:23:02,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:23:02,656 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,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 18 treesize of output 14 [2021-06-05 14:23:02,661 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:02,665 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,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 30 treesize of output 24 [2021-06-05 14:23:02,669 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,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 18 treesize of output 14 [2021-06-05 14:23:02,673 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:23:02,678 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:23:02,682 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,686 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,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:23:02,687 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,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 17 treesize of output 13 [2021-06-05 14:23:02,691 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,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 18 treesize of output 14 [2021-06-05 14:23:02,695 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:23:02,699 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,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 29 treesize of output 23 [2021-06-05 14:23:02,703 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:02,850 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2021-06-05 14:23:02,850 INFO L628 ElimStorePlain]: treesize reduction 201, result has 45.8 percent of original size [2021-06-05 14:23:02,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:23:02,855 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:02,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:02,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 11 treesize of output 7 [2021-06-05 14:23:02,859 INFO L550 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:02,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:23:02,862 INFO L550 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:02,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:02,924 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 14:23:02,924 INFO L247 ElimStorePlain]: Needed 16 recursive calls to eliminate 2 variables, input treesize:461, output treesize:148 [2021-06-05 14:23:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:03,082 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903741958] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:03,082 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:03,082 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 14:23:03,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126006559] [2021-06-05 14:23:03,082 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:23:03,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:03,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:23:03,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:23:03,083 INFO L87 Difference]: Start difference. First operand 879 states and 3262 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:03,523 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2021-06-05 14:23:03,769 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 61 [2021-06-05 14:23:03,979 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2021-06-05 14:23:04,251 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2021-06-05 14:23:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:04,363 INFO L93 Difference]: Finished difference Result 913 states and 3340 transitions. [2021-06-05 14:23:04,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:23:04,363 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:04,365 INFO L225 Difference]: With dead ends: 913 [2021-06-05 14:23:04,365 INFO L226 Difference]: Without dead ends: 902 [2021-06-05 14:23:04,365 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1689.6ms TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:23:04,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2021-06-05 14:23:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 880. [2021-06-05 14:23:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 3.7110352673492604) internal successors, (3262), 879 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3262 transitions. [2021-06-05 14:23:04,374 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 3262 transitions. Word has length 18 [2021-06-05 14:23:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:04,374 INFO L482 AbstractCegarLoop]: Abstraction has 880 states and 3262 transitions. [2021-06-05 14:23:04,374 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 3262 transitions. [2021-06-05 14:23:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:04,375 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:04,375 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:04,575 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 319 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3643 [2021-06-05 14:23:04,575 INFO L430 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:04,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:04,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2089126690, now seen corresponding path program 173 times [2021-06-05 14:23:04,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:04,576 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519865047] [2021-06-05 14:23:04,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:05,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:05,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519865047] [2021-06-05 14:23:05,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519865047] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:05,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243168054] [2021-06-05 14:23:05,288 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 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:05,315 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:23:05,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:05,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:05,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:05,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:05,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:05,415 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:05,418 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:05,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:05,419 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:05,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:05,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:23:05,422 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:05,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 26 treesize of output 20 [2021-06-05 14:23:05,426 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:05,460 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:05,461 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:05,461 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:111 [2021-06-05 14:23:05,578 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:05,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 25 treesize of output 19 [2021-06-05 14:23:05,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:05,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:05,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:23:05,582 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:05,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:05,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 15 treesize of output 11 [2021-06-05 14:23:05,586 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:05,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:05,589 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:05,625 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 14:23:05,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 22 treesize of output 14 [2021-06-05 14:23:05,627 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:05,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:05,642 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:05,642 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:23:05,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:05,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243168054] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:05,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:05,713 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:23:05,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261045237] [2021-06-05 14:23:05,713 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:23:05,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:05,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:23:05,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:23:05,713 INFO L87 Difference]: Start difference. First operand 880 states and 3262 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:06,244 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2021-06-05 14:23:06,443 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2021-06-05 14:23:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:06,810 INFO L93 Difference]: Finished difference Result 919 states and 3375 transitions. [2021-06-05 14:23:06,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:06,810 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:06,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:06,811 INFO L225 Difference]: With dead ends: 919 [2021-06-05 14:23:06,811 INFO L226 Difference]: Without dead ends: 914 [2021-06-05 14:23:06,812 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1546.2ms TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:23:06,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-06-05 14:23:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 883. [2021-06-05 14:23:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 14:23:06,822 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 14:23:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:06,822 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 14:23:06,822 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 14:23:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:06,823 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:06,823 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:07,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 320 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3658 [2021-06-05 14:23:07,024 INFO L430 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:07,024 INFO L82 PathProgramCache]: Analyzing trace with hash 214606282, now seen corresponding path program 174 times [2021-06-05 14:23:07,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:07,024 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357425993] [2021-06-05 14:23:07,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:07,226 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:07,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357425993] [2021-06-05 14:23:07,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357425993] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:07,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556204433] [2021-06-05 14:23:07,226 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:07,253 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:23:07,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:07,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:07,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:07,366 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:07,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:07,367 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:07,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:23:07,371 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:07,398 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:07,399 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:07,399 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:63 [2021-06-05 14:23:07,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 27 treesize of output 21 [2021-06-05 14:23:07,484 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:07,490 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:07,490 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:23:07,490 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:07,490 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:23:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:07,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556204433] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:07,516 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:07,516 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:23:07,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844612777] [2021-06-05 14:23:07,517 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:07,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:07,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:07,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:07,517 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:08,008 INFO L93 Difference]: Finished difference Result 964 states and 3516 transitions. [2021-06-05 14:23:08,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:08,008 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:08,010 INFO L225 Difference]: With dead ends: 964 [2021-06-05 14:23:08,010 INFO L226 Difference]: Without dead ends: 959 [2021-06-05 14:23:08,010 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 531.8ms TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:23:08,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-06-05 14:23:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 892. [2021-06-05 14:23:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 3.705948372615039) internal successors, (3302), 891 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:08,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 3302 transitions. [2021-06-05 14:23:08,020 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 3302 transitions. Word has length 18 [2021-06-05 14:23:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:08,020 INFO L482 AbstractCegarLoop]: Abstraction has 892 states and 3302 transitions. [2021-06-05 14:23:08,020 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 3302 transitions. [2021-06-05 14:23:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:08,021 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:08,021 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:08,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3673,321 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:08,222 INFO L430 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:08,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:08,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1725382464, now seen corresponding path program 175 times [2021-06-05 14:23:08,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:08,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935038124] [2021-06-05 14:23:08,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:08,439 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:08,439 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935038124] [2021-06-05 14:23:08,439 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935038124] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:08,439 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087815400] [2021-06-05 14:23:08,439 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 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:08,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 14:23:08,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:08,584 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:08,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:23:08,585 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:08,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 25 treesize of output 19 [2021-06-05 14:23:08,588 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:08,613 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:08,613 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:08,614 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:69 [2021-06-05 14:23:08,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:08,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:23:08,675 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:08,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:08,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:08,678 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:08,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:08,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 35 treesize of output 27 [2021-06-05 14:23:08,682 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:08,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:08,685 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:08,739 INFO L628 ElimStorePlain]: treesize reduction 87, result has 42.4 percent of original size [2021-06-05 14:23:08,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:23:08,743 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:08,765 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:08,766 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:08,766 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:181, output treesize:50 [2021-06-05 14:23:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:08,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087815400] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:08,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:08,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 14:23:08,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098917582] [2021-06-05 14:23:08,870 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:23:08,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:08,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:23:08,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:23:08,870 INFO L87 Difference]: Start difference. First operand 892 states and 3302 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:09,388 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-06-05 14:23:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:09,701 INFO L93 Difference]: Finished difference Result 974 states and 3541 transitions. [2021-06-05 14:23:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:09,701 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:09,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:09,703 INFO L225 Difference]: With dead ends: 974 [2021-06-05 14:23:09,703 INFO L226 Difference]: Without dead ends: 962 [2021-06-05 14:23:09,703 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 899.5ms TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:23:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-06-05 14:23:09,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 889. [2021-06-05 14:23:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 3.704954954954955) internal successors, (3290), 888 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 3290 transitions. [2021-06-05 14:23:09,713 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 3290 transitions. Word has length 18 [2021-06-05 14:23:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:09,713 INFO L482 AbstractCegarLoop]: Abstraction has 889 states and 3290 transitions. [2021-06-05 14:23:09,713 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 3290 transitions. [2021-06-05 14:23:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:09,714 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:09,714 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:09,914 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 322 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3683 [2021-06-05 14:23:09,914 INFO L430 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:09,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:09,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1695844152, now seen corresponding path program 176 times [2021-06-05 14:23:09,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:09,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540968562] [2021-06-05 14:23:09,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:10,196 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:10,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540968562] [2021-06-05 14:23:10,196 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540968562] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:10,196 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521921925] [2021-06-05 14:23:10,196 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 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:10,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:23:10,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:10,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:10,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:10,341 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:10,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 25 treesize of output 19 [2021-06-05 14:23:10,342 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:10,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:10,345 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:10,365 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:10,366 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:10,366 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 14:23:10,415 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_849], 1=[array_4, v_prenex_850]} [2021-06-05 14:23:10,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:23:10,418 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:10,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 15 treesize of output 11 [2021-06-05 14:23:10,421 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:10,462 INFO L628 ElimStorePlain]: treesize reduction 79, result has 38.8 percent of original size [2021-06-05 14:23:10,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 19 treesize of output 15 [2021-06-05 14:23:10,464 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:10,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:10,478 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:23:10,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 11 treesize of output 7 [2021-06-05 14:23:10,481 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:10,495 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:10,495 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:10,496 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 14:23:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:10,559 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521921925] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:10,559 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:10,559 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:23:10,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824452096] [2021-06-05 14:23:10,559 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:10,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:10,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:10,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:10,559 INFO L87 Difference]: Start difference. First operand 889 states and 3290 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:11,257 INFO L93 Difference]: Finished difference Result 982 states and 3566 transitions. [2021-06-05 14:23:11,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:11,257 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:11,259 INFO L225 Difference]: With dead ends: 982 [2021-06-05 14:23:11,259 INFO L226 Difference]: Without dead ends: 977 [2021-06-05 14:23:11,259 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 791.4ms TimeCoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:23:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-06-05 14:23:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 892. [2021-06-05 14:23:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 3.705948372615039) internal successors, (3302), 891 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 3302 transitions. [2021-06-05 14:23:11,268 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 3302 transitions. Word has length 18 [2021-06-05 14:23:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:11,268 INFO L482 AbstractCegarLoop]: Abstraction has 892 states and 3302 transitions. [2021-06-05 14:23:11,268 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 3302 transitions. [2021-06-05 14:23:11,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:11,269 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:11,269 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:11,470 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 323 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3693 [2021-06-05 14:23:11,470 INFO L430 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:11,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:11,470 INFO L82 PathProgramCache]: Analyzing trace with hash 24868136, now seen corresponding path program 177 times [2021-06-05 14:23:11,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:11,470 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604374184] [2021-06-05 14:23:11,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:11,699 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:11,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604374184] [2021-06-05 14:23:11,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604374184] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:11,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702769566] [2021-06-05 14:23:11,700 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 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:11,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:23:11,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:11,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:11,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:11,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:11,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 25 treesize of output 19 [2021-06-05 14:23:11,827 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:11,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 15 treesize of output 11 [2021-06-05 14:23:11,829 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:11,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:11,850 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:11,850 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 14:23:11,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 19 treesize of output 15 [2021-06-05 14:23:11,929 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:11,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 17 treesize of output 13 [2021-06-05 14:23:11,931 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:11,943 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 14:23:11,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 11 treesize of output 7 [2021-06-05 14:23:11,946 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:11,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:11,952 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:11,952 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 14:23:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:11,979 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702769566] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:11,979 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:11,979 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:23:11,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103888593] [2021-06-05 14:23:11,979 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:11,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:11,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:11,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:11,980 INFO L87 Difference]: Start difference. First operand 892 states and 3302 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:12,464 INFO L93 Difference]: Finished difference Result 965 states and 3523 transitions. [2021-06-05 14:23:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:12,464 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:12,466 INFO L225 Difference]: With dead ends: 965 [2021-06-05 14:23:12,466 INFO L226 Difference]: Without dead ends: 960 [2021-06-05 14:23:12,466 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 513.9ms TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:23:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-06-05 14:23:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 886. [2021-06-05 14:23:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7073446327683617) internal successors, (3281), 885 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3281 transitions. [2021-06-05 14:23:12,476 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3281 transitions. Word has length 18 [2021-06-05 14:23:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:12,476 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3281 transitions. [2021-06-05 14:23:12,476 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3281 transitions. [2021-06-05 14:23:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:12,477 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:12,477 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:12,677 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 324 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3704 [2021-06-05 14:23:12,677 INFO L430 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:12,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:12,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1124389346, now seen corresponding path program 178 times [2021-06-05 14:23:12,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:12,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187301181] [2021-06-05 14:23:12,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:12,877 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:12,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187301181] [2021-06-05 14:23:12,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187301181] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:12,877 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391892841] [2021-06-05 14:23:12,877 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 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:12,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:23:12,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:12,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:12,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:12,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 25 treesize of output 19 [2021-06-05 14:23:12,991 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:12,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 15 treesize of output 11 [2021-06-05 14:23:12,993 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:13,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:13,003 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:13,003 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:38 [2021-06-05 14:23:13,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:13,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 25 treesize of output 19 [2021-06-05 14:23:13,072 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:13,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:13,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 35 treesize of output 27 [2021-06-05 14:23:13,076 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:13,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23: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 15 treesize of output 11 [2021-06-05 14:23:13,079 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:13,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:13,082 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:13,119 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 14:23:13,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 22 treesize of output 14 [2021-06-05 14:23:13,130 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:13,144 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:13,145 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:13,145 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:23:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:13,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391892841] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:13,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:13,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:23:13,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325075144] [2021-06-05 14:23:13,208 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:13,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:13,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:13,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:13,208 INFO L87 Difference]: Start difference. First operand 886 states and 3281 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:13,914 INFO L93 Difference]: Finished difference Result 1055 states and 3833 transitions. [2021-06-05 14:23:13,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:23:13,914 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:13,916 INFO L225 Difference]: With dead ends: 1055 [2021-06-05 14:23:13,916 INFO L226 Difference]: Without dead ends: 1050 [2021-06-05 14:23:13,916 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 677.0ms TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:23:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2021-06-05 14:23:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 883. [2021-06-05 14:23:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 14:23:13,926 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 14:23:13,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:13,926 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 14:23:13,926 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:13,926 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 14:23:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:13,927 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:13,927 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:14,128 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3714,325 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:14,128 INFO L430 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:14,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:14,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1083309636, now seen corresponding path program 179 times [2021-06-05 14:23:14,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:14,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276970302] [2021-06-05 14:23:14,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:14,301 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:14,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276970302] [2021-06-05 14:23:14,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276970302] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:14,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065252914] [2021-06-05 14:23:14,301 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 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:14,328 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:23:14,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:14,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:14,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:14,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:14,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:14,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 25 treesize of output 19 [2021-06-05 14:23:14,466 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:14,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:14,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 15 treesize of output 11 [2021-06-05 14:23:14,469 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:14,502 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:14,518 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:23:14,518 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:81 [2021-06-05 14:23:14,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:14,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:14,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:23:14,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:14,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:14,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 15 [2021-06-05 14:23:14,701 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:14,750 INFO L628 ElimStorePlain]: treesize reduction 79, result has 43.6 percent of original size [2021-06-05 14:23:14,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:14,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 11 treesize of output 7 [2021-06-05 14:23:14,754 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:14,771 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:14,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 7 treesize of output 5 [2021-06-05 14:23:14,774 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:14,789 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:14,789 INFO L518 ElimStorePlain]: Eliminatee v_prenex_853 vanished before elimination [2021-06-05 14:23:14,790 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:14,790 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:154, output treesize:16 [2021-06-05 14:23:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:14,805 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065252914] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:14,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:14,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:23:14,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138777521] [2021-06-05 14:23:14,806 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:23:14,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:14,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:23:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:23:14,806 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:23:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:15,093 INFO L93 Difference]: Finished difference Result 925 states and 3382 transitions. [2021-06-05 14:23:15,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:15,094 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:23:15,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:15,095 INFO L225 Difference]: With dead ends: 925 [2021-06-05 14:23:15,095 INFO L226 Difference]: Without dead ends: 920 [2021-06-05 14:23:15,095 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 392.3ms TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:23:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-06-05 14:23:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 889. [2021-06-05 14:23:15,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 3.7083333333333335) internal successors, (3293), 888 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 3293 transitions. [2021-06-05 14:23:15,104 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 3293 transitions. Word has length 18 [2021-06-05 14:23:15,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:15,105 INFO L482 AbstractCegarLoop]: Abstraction has 889 states and 3293 transitions. [2021-06-05 14:23:15,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:23:15,105 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 3293 transitions. [2021-06-05 14:23:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:15,106 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:15,106 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:15,306 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 326 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3724 [2021-06-05 14:23:15,306 INFO L430 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:15,306 INFO L82 PathProgramCache]: Analyzing trace with hash -856679110, now seen corresponding path program 180 times [2021-06-05 14:23:15,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:15,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388787991] [2021-06-05 14:23:15,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:15,480 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:15,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388787991] [2021-06-05 14:23:15,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388787991] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:15,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946031488] [2021-06-05 14:23:15,481 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 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:15,507 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:23:15,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:15,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:15,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:15,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:15,634 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:15,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 25 treesize of output 19 [2021-06-05 14:23:15,635 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:15,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:15,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 15 treesize of output 11 [2021-06-05 14:23:15,638 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:15,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:15,672 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:23:15,672 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:81 [2021-06-05 14:23:15,759 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_858, array_4], 3=[v_prenex_856, array_2]} [2021-06-05 14:23:15,763 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:15,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:15,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 17 treesize of output 13 [2021-06-05 14:23:15,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:15,768 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:15,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:23:15,769 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:15,832 INFO L628 ElimStorePlain]: treesize reduction 109, result has 41.7 percent of original size [2021-06-05 14:23:15,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:15,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 19 treesize of output 15 [2021-06-05 14:23:15,836 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:15,860 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:15,861 INFO L518 ElimStorePlain]: Eliminatee v_prenex_856 vanished before elimination [2021-06-05 14:23:15,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:15,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:23:15,865 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:15,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:15,890 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:15,890 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:199, output treesize:35 [2021-06-05 14:23:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:15,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946031488] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:15,939 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:15,939 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:23:15,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27542162] [2021-06-05 14:23:15,939 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:23:15,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:15,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:23:15,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:23:15,940 INFO L87 Difference]: Start difference. First operand 889 states and 3293 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:23:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:16,177 INFO L93 Difference]: Finished difference Result 935 states and 3414 transitions. [2021-06-05 14:23:16,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:16,178 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:23:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:16,179 INFO L225 Difference]: With dead ends: 935 [2021-06-05 14:23:16,179 INFO L226 Difference]: Without dead ends: 930 [2021-06-05 14:23:16,179 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 337.3ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:23:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2021-06-05 14:23:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 886. [2021-06-05 14:23:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7073446327683617) internal successors, (3281), 885 states have internal predecessors, (3281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3281 transitions. [2021-06-05 14:23:16,189 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3281 transitions. Word has length 18 [2021-06-05 14:23:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:16,189 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3281 transitions. [2021-06-05 14:23:16,189 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:23:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3281 transitions. [2021-06-05 14:23:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:16,190 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:16,190 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:16,390 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3751,327 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:16,391 INFO L430 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1730419790, now seen corresponding path program 181 times [2021-06-05 14:23:16,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:16,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859898513] [2021-06-05 14:23:16,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:16,579 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:16,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859898513] [2021-06-05 14:23:16,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859898513] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:16,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110536363] [2021-06-05 14:23:16,579 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 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:16,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 14:23:16,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:16,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:16,742 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:16,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 25 treesize of output 19 [2021-06-05 14:23:16,743 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:16,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:16,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:16,747 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:16,775 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:16,779 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 14:23:16,779 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:78 [2021-06-05 14:23:16,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:16,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:16,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 15 treesize of output 11 [2021-06-05 14:23:16,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:16,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:16,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:16,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:23:16,877 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:16,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:16,881 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:16,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 27 treesize of output 21 [2021-06-05 14:23:16,882 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:16,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:16,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 25 treesize of output 19 [2021-06-05 14:23:16,887 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:16,944 INFO L628 ElimStorePlain]: treesize reduction 96, result has 42.5 percent of original size [2021-06-05 14:23:16,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:16,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 11 treesize of output 7 [2021-06-05 14:23:16,948 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:16,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:16,973 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:16,973 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:199, output treesize:35 [2021-06-05 14:23:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:17,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110536363] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:17,024 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:17,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:23:17,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926121476] [2021-06-05 14:23:17,024 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:23:17,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:17,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:23:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:23:17,024 INFO L87 Difference]: Start difference. First operand 886 states and 3281 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:23:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:17,414 INFO L93 Difference]: Finished difference Result 930 states and 3404 transitions. [2021-06-05 14:23:17,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:17,414 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:23:17,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:17,416 INFO L225 Difference]: With dead ends: 930 [2021-06-05 14:23:17,416 INFO L226 Difference]: Without dead ends: 925 [2021-06-05 14:23:17,416 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 418.7ms TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:23:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2021-06-05 14:23:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 883. [2021-06-05 14:23:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 14:23:17,425 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 14:23:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:17,425 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 14:23:17,425 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:23:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 14:23:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:17,426 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:17,426 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:17,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3764,328 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:17,626 INFO L430 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:17,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:17,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1181503380, now seen corresponding path program 182 times [2021-06-05 14:23:17,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:17,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826316075] [2021-06-05 14:23:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:17,969 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:17,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826316075] [2021-06-05 14:23:17,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826316075] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:17,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575231328] [2021-06-05 14:23:17,969 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 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:17,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:23:17,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:17,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:17,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:18,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:18,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:18,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 16 treesize of output 12 [2021-06-05 14:23:18,075 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:18,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:18,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:18,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 26 treesize of output 20 [2021-06-05 14:23:18,079 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:18,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:18,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:18,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:18,083 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:18,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:18,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:18,087 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:18,144 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:18,145 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:18,145 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:205, output treesize:169 [2021-06-05 14:23:18,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:18,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:18,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 17 treesize of output 13 [2021-06-05 14:23:18,470 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:18,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:18,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:23:18,474 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:18,522 INFO L628 ElimStorePlain]: treesize reduction 79, result has 43.6 percent of original size [2021-06-05 14:23:18,525 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:18,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 11 treesize of output 7 [2021-06-05 14:23:18,526 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:18,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:18,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 7 treesize of output 5 [2021-06-05 14:23:18,546 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:18,561 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:18,562 INFO L518 ElimStorePlain]: Eliminatee v_prenex_871 vanished before elimination [2021-06-05 14:23:18,563 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:18,563 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:154, output treesize:16 [2021-06-05 14:23:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:18,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575231328] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:18,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:18,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2021-06-05 14:23:18,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970575130] [2021-06-05 14:23:18,591 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:23:18,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:18,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:23:18,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:23:18,592 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:23:18,924 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2021-06-05 14:23:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:19,290 INFO L93 Difference]: Finished difference Result 928 states and 3388 transitions. [2021-06-05 14:23:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:19,290 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:23:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:19,291 INFO L225 Difference]: With dead ends: 928 [2021-06-05 14:23:19,291 INFO L226 Difference]: Without dead ends: 923 [2021-06-05 14:23:19,292 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 943.4ms TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:23:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-06-05 14:23:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 887. [2021-06-05 14:23:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 3.7121896162528216) internal successors, (3289), 886 states have internal predecessors, (3289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 3289 transitions. [2021-06-05 14:23:19,301 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 3289 transitions. Word has length 18 [2021-06-05 14:23:19,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:19,301 INFO L482 AbstractCegarLoop]: Abstraction has 887 states and 3289 transitions. [2021-06-05 14:23:19,301 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:23:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 3289 transitions. [2021-06-05 14:23:19,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:19,302 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:19,302 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:19,502 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 329 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3778 [2021-06-05 14:23:19,503 INFO L430 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:19,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:19,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1173475170, now seen corresponding path program 183 times [2021-06-05 14:23:19,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:19,503 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766957758] [2021-06-05 14:23:19,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:19,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:19,753 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:19,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766957758] [2021-06-05 14:23:19,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766957758] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:19,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551796014] [2021-06-05 14:23:19,753 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 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:19,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:23:19,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:19,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:19,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:19,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:19,858 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:19,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 16 treesize of output 12 [2021-06-05 14:23:19,859 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:19,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:19,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:19,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:23:19,863 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:19,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:19,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:19,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:23:19,867 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:19,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:19,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:19,871 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:19,917 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:19,918 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:19,918 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:187, output treesize:155 [2021-06-05 14:23:20,159 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 14:23:20,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:20,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23: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 25 treesize of output 19 [2021-06-05 14:23:20,164 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:20,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:20,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:20,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 25 treesize of output 19 [2021-06-05 14:23:20,168 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:20,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:20,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:20,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 15 treesize of output 11 [2021-06-05 14:23:20,173 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:20,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:20,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 35 treesize of output 27 [2021-06-05 14:23:20,177 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:20,236 INFO L628 ElimStorePlain]: treesize reduction 95, result has 41.7 percent of original size [2021-06-05 14:23:20,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:20,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 11 treesize of output 7 [2021-06-05 14:23:20,240 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:20,261 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:20,262 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:20,262 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:201, output treesize:75 [2021-06-05 14:23:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:20,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551796014] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:20,345 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:20,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:23:20,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078616041] [2021-06-05 14:23:20,345 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:23:20,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:20,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:23:20,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:23:20,345 INFO L87 Difference]: Start difference. First operand 887 states and 3289 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:23:20,651 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2021-06-05 14:23:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:20,970 INFO L93 Difference]: Finished difference Result 944 states and 3442 transitions. [2021-06-05 14:23:20,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:20,970 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:23:20,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:20,971 INFO L225 Difference]: With dead ends: 944 [2021-06-05 14:23:20,971 INFO L226 Difference]: Without dead ends: 939 [2021-06-05 14:23:20,972 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 791.8ms TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:23:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2021-06-05 14:23:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 883. [2021-06-05 14:23:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 14:23:20,981 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 14:23:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:20,981 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 14:23:20,981 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:23:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 14:23:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:20,982 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:20,982 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:21,182 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 330 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3807 [2021-06-05 14:23:21,182 INFO L430 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:21,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:21,183 INFO L82 PathProgramCache]: Analyzing trace with hash -974410398, now seen corresponding path program 184 times [2021-06-05 14:23:21,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:21,183 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985912739] [2021-06-05 14:23:21,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:21,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:21,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985912739] [2021-06-05 14:23:21,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985912739] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:21,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635560506] [2021-06-05 14:23:21,423 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 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:21,449 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:23:21,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:21,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:21,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:21,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,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 26 treesize of output 20 [2021-06-05 14:23:21,577 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:21,580 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:23:21,582 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:21,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,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 25 treesize of output 19 [2021-06-05 14:23:21,586 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:21,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:21,590 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:21,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:21,645 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:23:21,645 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:193, output treesize:161 [2021-06-05 14:23:21,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:21,903 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:21,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:21,907 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:21,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,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 35 treesize of output 27 [2021-06-05 14:23:21,912 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:21,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,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 25 treesize of output 19 [2021-06-05 14:23:21,916 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:21,983 INFO L628 ElimStorePlain]: treesize reduction 100, result has 43.5 percent of original size [2021-06-05 14:23:21,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:21,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 22 treesize of output 14 [2021-06-05 14:23:21,987 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:22,010 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:22,011 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:22,012 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:207, output treesize:35 [2021-06-05 14:23:22,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:22,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635560506] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:22,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:22,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:23:22,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006965880] [2021-06-05 14:23:22,073 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:23:22,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:22,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:23:22,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:23:22,074 INFO L87 Difference]: Start difference. First operand 883 states and 3272 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:23:22,346 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2021-06-05 14:23:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:22,586 INFO L93 Difference]: Finished difference Result 932 states and 3416 transitions. [2021-06-05 14:23:22,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:22,586 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:23:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:22,587 INFO L225 Difference]: With dead ends: 932 [2021-06-05 14:23:22,587 INFO L226 Difference]: Without dead ends: 927 [2021-06-05 14:23:22,587 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 722.6ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:23:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2021-06-05 14:23:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 884. [2021-06-05 14:23:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.710079275198188) internal successors, (3276), 883 states have internal predecessors, (3276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:22,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3276 transitions. [2021-06-05 14:23:22,596 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3276 transitions. Word has length 18 [2021-06-05 14:23:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:22,597 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3276 transitions. [2021-06-05 14:23:22,597 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:23:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3276 transitions. [2021-06-05 14:23:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:22,598 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:22,598 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:22,798 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 331 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3834 [2021-06-05 14:23:22,798 INFO L430 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:22,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:22,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1209123278, now seen corresponding path program 185 times [2021-06-05 14:23:22,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:22,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318505848] [2021-06-05 14:23:22,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:23,075 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:23,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318505848] [2021-06-05 14:23:23,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318505848] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:23,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410203231] [2021-06-05 14:23:23,076 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 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:23,102 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:23:23,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:23,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:23,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:23,177 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:23,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 26 treesize of output 20 [2021-06-05 14:23:23,178 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:23,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:23,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 15 treesize of output 11 [2021-06-05 14:23:23,182 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:23,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:23,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 25 treesize of output 19 [2021-06-05 14:23:23,185 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:23,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 16 treesize of output 12 [2021-06-05 14:23:23,188 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:23,212 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:23,212 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:23,212 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 14:23:23,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:23,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:23,330 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:23,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:23,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 35 treesize of output 27 [2021-06-05 14:23:23,333 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:23,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:23,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:23,337 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:23,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:23,340 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:23,375 INFO L628 ElimStorePlain]: treesize reduction 74, result has 36.8 percent of original size [2021-06-05 14:23:23,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 11 treesize of output 7 [2021-06-05 14:23:23,378 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:23,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:23,393 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:23,393 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:23:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:23,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410203231] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:23,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:23,457 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:23:23,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385238338] [2021-06-05 14:23:23,457 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:23,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:23,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:23,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:23,458 INFO L87 Difference]: Start difference. First operand 884 states and 3276 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:24,303 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-06-05 14:23:24,435 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2021-06-05 14:23:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:24,505 INFO L93 Difference]: Finished difference Result 1062 states and 3819 transitions. [2021-06-05 14:23:24,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:23:24,506 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:24,507 INFO L225 Difference]: With dead ends: 1062 [2021-06-05 14:23:24,507 INFO L226 Difference]: Without dead ends: 1057 [2021-06-05 14:23:24,507 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1054.9ms TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:23:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-06-05 14:23:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 886. [2021-06-05 14:23:24,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7096045197740115) internal successors, (3283), 885 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3283 transitions. [2021-06-05 14:23:24,518 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3283 transitions. Word has length 18 [2021-06-05 14:23:24,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:24,518 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3283 transitions. [2021-06-05 14:23:24,518 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:24,518 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3283 transitions. [2021-06-05 14:23:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:24,519 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:24,519 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:24,719 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3861,332 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:24,719 INFO L430 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash 65825400, now seen corresponding path program 186 times [2021-06-05 14:23:24,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:24,720 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184930155] [2021-06-05 14:23:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:25,006 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:25,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184930155] [2021-06-05 14:23:25,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184930155] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:25,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527339366] [2021-06-05 14:23:25,006 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 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:25,033 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:23:25,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:25,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:25,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:25,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:25,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 26 treesize of output 20 [2021-06-05 14:23:25,097 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:25,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:25,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:23:25,100 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:25,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:25,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 25 treesize of output 19 [2021-06-05 14:23:25,103 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:25,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 16 treesize of output 12 [2021-06-05 14:23:25,105 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:25,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:25,130 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:25,130 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 14:23:25,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:25,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 25 treesize of output 19 [2021-06-05 14:23:25,280 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:25,282 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:25,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:23:25,283 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:25,285 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:25,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:25,286 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:25,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 25 treesize of output 19 [2021-06-05 14:23:25,289 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:25,325 INFO L628 ElimStorePlain]: treesize reduction 74, result has 36.8 percent of original size [2021-06-05 14:23:25,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:23:25,328 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:25,341 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:25,342 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:25,342 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:23:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:25,406 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527339366] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:25,406 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:25,406 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:23:25,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548581532] [2021-06-05 14:23:25,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:25,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:25,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:25,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:25,407 INFO L87 Difference]: Start difference. First operand 886 states and 3283 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:26,110 INFO L93 Difference]: Finished difference Result 978 states and 3533 transitions. [2021-06-05 14:23:26,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:26,110 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:26,112 INFO L225 Difference]: With dead ends: 978 [2021-06-05 14:23:26,112 INFO L226 Difference]: Without dead ends: 973 [2021-06-05 14:23:26,112 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 790.4ms TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:23:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-06-05 14:23:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 884. [2021-06-05 14:23:26,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.711211778029445) internal successors, (3277), 883 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3277 transitions. [2021-06-05 14:23:26,121 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3277 transitions. Word has length 18 [2021-06-05 14:23:26,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:26,121 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3277 transitions. [2021-06-05 14:23:26,121 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3277 transitions. [2021-06-05 14:23:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:26,122 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:26,122 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:26,323 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 333 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3875 [2021-06-05 14:23:26,323 INFO L430 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:26,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash 660823910, now seen corresponding path program 187 times [2021-06-05 14:23:26,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:26,323 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621373081] [2021-06-05 14:23:26,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:26,512 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:26,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621373081] [2021-06-05 14:23:26,512 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621373081] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:26,512 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202769943] [2021-06-05 14:23:26,512 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 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:26,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:23:26,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:26,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:26,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:26,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:26,665 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:26,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23: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 25 treesize of output 19 [2021-06-05 14:23:26,669 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:26,705 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:26,708 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:23:26,708 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:111, output treesize:93 [2021-06-05 14:23:26,861 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 14:23:26,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:26,864 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:26,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 15 treesize of output 11 [2021-06-05 14:23:26,865 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:26,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:26,869 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:26,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 25 treesize of output 19 [2021-06-05 14:23:26,870 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:26,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:26,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:26,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 27 treesize of output 21 [2021-06-05 14:23:26,874 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:26,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:26,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 17 treesize of output 13 [2021-06-05 14:23:26,878 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:26,942 INFO L628 ElimStorePlain]: treesize reduction 100, result has 41.5 percent of original size [2021-06-05 14:23:26,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:26,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 11 treesize of output 7 [2021-06-05 14:23:26,946 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:26,968 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:26,970 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:26,970 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:199, output treesize:78 [2021-06-05 14:23:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:27,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202769943] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:27,051 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:27,051 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 14:23:27,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037639667] [2021-06-05 14:23:27,051 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:23:27,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:27,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:23:27,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:23:27,051 INFO L87 Difference]: Start difference. First operand 884 states and 3277 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:23:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:27,318 INFO L93 Difference]: Finished difference Result 917 states and 3361 transitions. [2021-06-05 14:23:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:27,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:23:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:27,320 INFO L225 Difference]: With dead ends: 917 [2021-06-05 14:23:27,320 INFO L226 Difference]: Without dead ends: 904 [2021-06-05 14:23:27,320 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 454.1ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:23:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2021-06-05 14:23:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 890. [2021-06-05 14:23:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 3.706411698537683) internal successors, (3295), 889 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 3295 transitions. [2021-06-05 14:23:27,329 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 3295 transitions. Word has length 18 [2021-06-05 14:23:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:27,329 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 3295 transitions. [2021-06-05 14:23:27,329 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:23:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 3295 transitions. [2021-06-05 14:23:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:27,330 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:27,330 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:27,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3889,334 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:27,531 INFO L430 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:27,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:27,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1279164836, now seen corresponding path program 188 times [2021-06-05 14:23:27,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:27,531 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123392426] [2021-06-05 14:23:27,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:27,733 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:27,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123392426] [2021-06-05 14:23:27,733 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123392426] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:27,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803489076] [2021-06-05 14:23:27,733 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 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:27,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:23:27,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:27,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:27,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:27,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:27,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:27,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 25 treesize of output 19 [2021-06-05 14:23:27,891 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:27,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:27,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 15 treesize of output 11 [2021-06-05 14:23:27,895 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:27,926 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:27,928 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:23:27,928 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:81 [2021-06-05 14:23:28,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:28,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:28,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:28,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:28,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:28,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:28,055 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:28,128 INFO L628 ElimStorePlain]: treesize reduction 103, result has 43.1 percent of original size [2021-06-05 14:23:28,128 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:23:28,131 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:28,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 19 treesize of output 15 [2021-06-05 14:23:28,132 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:28,156 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:28,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:28,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 11 treesize of output 7 [2021-06-05 14:23:28,160 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:28,183 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:28,184 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:28,185 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:199, output treesize:35 [2021-06-05 14:23:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:28,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803489076] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:28,233 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:28,233 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:23:28,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445986553] [2021-06-05 14:23:28,233 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:23:28,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:28,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:23:28,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:23:28,233 INFO L87 Difference]: Start difference. First operand 890 states and 3295 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:23:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:28,572 INFO L93 Difference]: Finished difference Result 919 states and 3378 transitions. [2021-06-05 14:23:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:28,572 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:23:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:28,574 INFO L225 Difference]: With dead ends: 919 [2021-06-05 14:23:28,574 INFO L226 Difference]: Without dead ends: 914 [2021-06-05 14:23:28,574 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 379.2ms TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:23:28,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-06-05 14:23:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 887. [2021-06-05 14:23:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 3.708803611738149) internal successors, (3286), 886 states have internal predecessors, (3286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 3286 transitions. [2021-06-05 14:23:28,583 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 3286 transitions. Word has length 18 [2021-06-05 14:23:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:28,583 INFO L482 AbstractCegarLoop]: Abstraction has 887 states and 3286 transitions. [2021-06-05 14:23:28,583 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:23:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 3286 transitions. [2021-06-05 14:23:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:28,584 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:28,585 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:28,785 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 335 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3915 [2021-06-05 14:23:28,785 INFO L430 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash 2142061780, now seen corresponding path program 189 times [2021-06-05 14:23:28,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:28,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496505620] [2021-06-05 14:23:28,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:29,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:29,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496505620] [2021-06-05 14:23:29,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496505620] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:29,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540422606] [2021-06-05 14:23:29,116 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 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:29,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:23:29,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:29,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:29,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:29,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:29,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:29,265 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:29,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:23:29,268 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:29,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:29,289 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:29,289 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 14:23:29,339 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_887], 1=[v_prenex_888, array_4]} [2021-06-05 14:23:29,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 25 treesize of output 19 [2021-06-05 14:23:29,342 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:29,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:29,345 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:29,386 INFO L628 ElimStorePlain]: treesize reduction 75, result has 41.9 percent of original size [2021-06-05 14:23:29,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:23:29,389 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:29,403 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:29,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 11 treesize of output 7 [2021-06-05 14:23:29,406 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:29,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:29,420 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:23:29,420 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:29,420 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 14:23:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:29,483 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540422606] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:29,483 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:29,483 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:23:29,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448081602] [2021-06-05 14:23:29,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:29,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:29,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:29,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:29,484 INFO L87 Difference]: Start difference. First operand 887 states and 3286 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:30,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:30,237 INFO L93 Difference]: Finished difference Result 930 states and 3401 transitions. [2021-06-05 14:23:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:23:30,238 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:30,239 INFO L225 Difference]: With dead ends: 930 [2021-06-05 14:23:30,239 INFO L226 Difference]: Without dead ends: 920 [2021-06-05 14:23:30,239 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 897.6ms TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:23:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2021-06-05 14:23:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 884. [2021-06-05 14:23:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.711211778029445) internal successors, (3277), 883 states have internal predecessors, (3277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3277 transitions. [2021-06-05 14:23:30,248 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3277 transitions. Word has length 18 [2021-06-05 14:23:30,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:30,248 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3277 transitions. [2021-06-05 14:23:30,248 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3277 transitions. [2021-06-05 14:23:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:30,249 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:30,249 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:30,449 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3942,336 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:30,450 INFO L430 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:30,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:30,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1603989106, now seen corresponding path program 190 times [2021-06-05 14:23:30,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:30,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819496100] [2021-06-05 14:23:30,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:30,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:30,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819496100] [2021-06-05 14:23:30,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819496100] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:30,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010597499] [2021-06-05 14:23:30,707 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 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:30,732 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:23:30,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:30,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:23:30,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:30,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:30,805 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:30,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 16 treesize of output 12 [2021-06-05 14:23:30,806 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:30,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:30,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:30,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 26 treesize of output 20 [2021-06-05 14:23:30,810 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:30,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:30,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:30,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 25 treesize of output 19 [2021-06-05 14:23:30,814 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:30,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:30,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 15 treesize of output 11 [2021-06-05 14:23:30,818 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:30,876 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:30,878 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:30,878 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:205, output treesize:169 [2021-06-05 14:23:31,162 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_2]} [2021-06-05 14:23:31,165 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:31,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:31,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:31,167 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:31,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:31,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:31,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 27 treesize of output 21 [2021-06-05 14:23:31,172 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:31,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:31,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:31,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 15 treesize of output 11 [2021-06-05 14:23:31,176 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:31,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:31,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:23:31,180 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:31,234 INFO L628 ElimStorePlain]: treesize reduction 96, result has 42.5 percent of original size [2021-06-05 14:23:31,236 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:31,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:23:31,238 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:31,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:31,262 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:31,262 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:199, output treesize:78 [2021-06-05 14:23:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:31,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010597499] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:31,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:31,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 14:23:31,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732187260] [2021-06-05 14:23:31,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:23:31,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:31,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:23:31,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:23:31,354 INFO L87 Difference]: Start difference. First operand 884 states and 3277 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:23:31,610 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2021-06-05 14:23:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:31,800 INFO L93 Difference]: Finished difference Result 922 states and 3374 transitions. [2021-06-05 14:23:31,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:31,800 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:23:31,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:31,802 INFO L225 Difference]: With dead ends: 922 [2021-06-05 14:23:31,802 INFO L226 Difference]: Without dead ends: 909 [2021-06-05 14:23:31,802 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 777.5ms TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-06-05 14:23:31,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 890. [2021-06-05 14:23:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 3.706411698537683) internal successors, (3295), 889 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 3295 transitions. [2021-06-05 14:23:31,811 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 3295 transitions. Word has length 18 [2021-06-05 14:23:31,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:31,811 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 3295 transitions. [2021-06-05 14:23:31,811 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:23:31,811 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 3295 transitions. [2021-06-05 14:23:31,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:31,812 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:31,812 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:32,013 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3953,337 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:32,013 INFO L430 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:32,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash 750989444, now seen corresponding path program 191 times [2021-06-05 14:23:32,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:32,013 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153778027] [2021-06-05 14:23:32,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:32,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:32,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153778027] [2021-06-05 14:23:32,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153778027] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:32,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082007173] [2021-06-05 14:23:32,312 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 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:32,339 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:23:32,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:32,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:32,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:32,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:32,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:23:32,424 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:32,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:32,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 26 treesize of output 20 [2021-06-05 14:23:32,427 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:32,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:32,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:32,431 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:32,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:23:32,434 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:32,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:32,480 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:32,480 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 14:23:32,601 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_894], 1=[array_4, v_prenex_895]} [2021-06-05 14:23:32,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 15 treesize of output 11 [2021-06-05 14:23:32,613 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:32,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:32,616 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:32,656 INFO L628 ElimStorePlain]: treesize reduction 79, result has 40.6 percent of original size [2021-06-05 14:23:32,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 27 treesize of output 21 [2021-06-05 14:23:32,659 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:32,673 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:32,674 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:23:32,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:23:32,676 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:32,690 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:32,691 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:32,691 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 14:23:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:32,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082007173] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:32,754 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:32,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:23:32,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093989382] [2021-06-05 14:23:32,755 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:32,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:32,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:32,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:32,755 INFO L87 Difference]: Start difference. First operand 890 states and 3295 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:33,152 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-06-05 14:23:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:33,571 INFO L93 Difference]: Finished difference Result 939 states and 3429 transitions. [2021-06-05 14:23:33,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:23:33,571 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:33,573 INFO L225 Difference]: With dead ends: 939 [2021-06-05 14:23:33,573 INFO L226 Difference]: Without dead ends: 929 [2021-06-05 14:23:33,573 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 987.1ms TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:23:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2021-06-05 14:23:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 883. [2021-06-05 14:23:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.7108843537414966) internal successors, (3273), 882 states have internal predecessors, (3273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3273 transitions. [2021-06-05 14:23:33,582 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3273 transitions. Word has length 18 [2021-06-05 14:23:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:33,582 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3273 transitions. [2021-06-05 14:23:33,582 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3273 transitions. [2021-06-05 14:23:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:33,583 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:33,583 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:33,784 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 338 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3968 [2021-06-05 14:23:33,784 INFO L430 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1396896124, now seen corresponding path program 192 times [2021-06-05 14:23:33,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:33,784 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309875472] [2021-06-05 14:23:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:34,044 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:34,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309875472] [2021-06-05 14:23:34,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309875472] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:34,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514748986] [2021-06-05 14:23:34,044 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 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:34,070 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:23:34,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:34,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:34,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:34,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:23:34,176 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:34,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:23:34,180 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:34,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,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 25 treesize of output 19 [2021-06-05 14:23:34,185 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:34,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:34,190 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:34,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:34,247 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:23:34,248 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:193, output treesize:157 [2021-06-05 14:23:34,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:34,508 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:34,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:34,513 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:34,517 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,518 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:23:34,519 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:34,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:23:34,523 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:34,581 INFO L628 ElimStorePlain]: treesize reduction 96, result has 44.5 percent of original size [2021-06-05 14:23:34,584 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:34,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:23:34,585 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:34,608 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:34,610 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:34,610 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:199, output treesize:35 [2021-06-05 14:23:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:34,672 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514748986] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:34,672 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:34,672 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:23:34,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373066488] [2021-06-05 14:23:34,672 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:23:34,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:34,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:23:34,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:23:34,672 INFO L87 Difference]: Start difference. First operand 883 states and 3273 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:23:34,986 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2021-06-05 14:23:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:35,262 INFO L93 Difference]: Finished difference Result 922 states and 3391 transitions. [2021-06-05 14:23:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:35,263 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:23:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:35,264 INFO L225 Difference]: With dead ends: 922 [2021-06-05 14:23:35,264 INFO L226 Difference]: Without dead ends: 917 [2021-06-05 14:23:35,264 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 727.4ms TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:23:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-06-05 14:23:35,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 881. [2021-06-05 14:23:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7113636363636364) internal successors, (3266), 880 states have internal predecessors, (3266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3266 transitions. [2021-06-05 14:23:35,273 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3266 transitions. Word has length 18 [2021-06-05 14:23:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:35,274 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3266 transitions. [2021-06-05 14:23:35,274 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:23:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3266 transitions. [2021-06-05 14:23:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:35,275 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:35,275 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:35,475 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3983,339 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:35,475 INFO L430 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:35,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2046888246, now seen corresponding path program 193 times [2021-06-05 14:23:35,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:35,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590731775] [2021-06-05 14:23:35,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:35,831 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 14:23:36,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:36,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:36,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590731775] [2021-06-05 14:23:36,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590731775] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:36,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635754430] [2021-06-05 14:23:36,222 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 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:36,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:23:36,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:36,364 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:36,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:23:36,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:36,368 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:36,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 26 treesize of output 20 [2021-06-05 14:23:36,369 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:36,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:36,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 25 treesize of output 19 [2021-06-05 14:23:36,372 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:36,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:36,376 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:36,420 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:36,422 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:36,422 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 14:23:36,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:36,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:23:36,603 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:36,605 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:36,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 25 treesize of output 19 [2021-06-05 14:23:36,606 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:36,609 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:36,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 17 treesize of output 13 [2021-06-05 14:23:36,609 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:36,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:23:36,612 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:36,651 INFO L628 ElimStorePlain]: treesize reduction 77, result has 37.4 percent of original size [2021-06-05 14:23:36,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 11 treesize of output 7 [2021-06-05 14:23:36,654 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:36,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:36,670 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:36,670 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 14:23:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:36,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635754430] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:36,737 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:36,737 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 14:23:36,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115809936] [2021-06-05 14:23:36,738 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 14:23:36,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:36,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 14:23:36,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:23:36,738 INFO L87 Difference]: Start difference. First operand 881 states and 3266 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:37,236 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-06-05 14:23:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:37,652 INFO L93 Difference]: Finished difference Result 935 states and 3409 transitions. [2021-06-05 14:23:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:23:37,652 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:37,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:37,654 INFO L225 Difference]: With dead ends: 935 [2021-06-05 14:23:37,654 INFO L226 Difference]: Without dead ends: 917 [2021-06-05 14:23:37,654 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1504.1ms TimeCoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:23:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2021-06-05 14:23:37,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 882. [2021-06-05 14:23:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 3.7116912599318956) internal successors, (3270), 881 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 3270 transitions. [2021-06-05 14:23:37,663 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 3270 transitions. Word has length 18 [2021-06-05 14:23:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:37,663 INFO L482 AbstractCegarLoop]: Abstraction has 882 states and 3270 transitions. [2021-06-05 14:23:37,663 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 3270 transitions. [2021-06-05 14:23:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:37,664 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:37,664 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:37,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 340 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4009 [2021-06-05 14:23:37,864 INFO L430 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:37,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:37,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1569373752, now seen corresponding path program 194 times [2021-06-05 14:23:37,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:37,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911016304] [2021-06-05 14:23:37,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:38,579 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:38,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911016304] [2021-06-05 14:23:38,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911016304] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:38,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538297384] [2021-06-05 14:23:38,579 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 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:38,609 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:23:38,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:38,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:23:38,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:38,716 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:38,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:23:38,717 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:38,720 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:38,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:23:38,721 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:38,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:38,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:38,725 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:38,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 16 treesize of output 12 [2021-06-05 14:23:38,728 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:38,783 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:38,784 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:38,784 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 14:23:38,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:38,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 25 treesize of output 19 [2021-06-05 14:23:38,925 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:38,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:38,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 15 treesize of output 11 [2021-06-05 14:23:38,929 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:38,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:38,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:38,932 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:38,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:23:38,935 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:38,991 INFO L628 ElimStorePlain]: treesize reduction 79, result has 44.8 percent of original size [2021-06-05 14:23:38,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 22 treesize of output 14 [2021-06-05 14:23:38,994 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:39,017 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:39,018 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:39,018 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:181, output treesize:50 [2021-06-05 14:23:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:39,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538297384] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:39,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:39,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 14:23:39,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58955135] [2021-06-05 14:23:39,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 14:23:39,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:39,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 14:23:39,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:23:39,138 INFO L87 Difference]: Start difference. First operand 882 states and 3270 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:39,397 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 46 [2021-06-05 14:23:39,672 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2021-06-05 14:23:39,862 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2021-06-05 14:23:40,090 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2021-06-05 14:23:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:40,310 INFO L93 Difference]: Finished difference Result 928 states and 3397 transitions. [2021-06-05 14:23:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:23:40,310 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:40,312 INFO L225 Difference]: With dead ends: 928 [2021-06-05 14:23:40,312 INFO L226 Difference]: Without dead ends: 916 [2021-06-05 14:23:40,312 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1744.3ms TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:23:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-06-05 14:23:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 884. [2021-06-05 14:23:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.712344280860702) internal successors, (3278), 883 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3278 transitions. [2021-06-05 14:23:40,321 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3278 transitions. Word has length 18 [2021-06-05 14:23:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:40,321 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3278 transitions. [2021-06-05 14:23:40,321 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3278 transitions. [2021-06-05 14:23:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:40,322 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:40,322 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:40,522 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 341 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4023 [2021-06-05 14:23:40,523 INFO L430 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:40,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:40,523 INFO L82 PathProgramCache]: Analyzing trace with hash 550929662, now seen corresponding path program 195 times [2021-06-05 14:23:40,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:40,523 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529062261] [2021-06-05 14:23:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:40,878 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:40,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529062261] [2021-06-05 14:23:40,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529062261] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:40,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767992761] [2021-06-05 14:23:40,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:40,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:23:40,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:40,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:40,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:40,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:40,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:40,976 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:40,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:40,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 16 treesize of output 12 [2021-06-05 14:23:40,980 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:40,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:40,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 25 treesize of output 19 [2021-06-05 14:23:40,983 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:40,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 26 treesize of output 20 [2021-06-05 14:23:40,986 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:41,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:41,020 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:41,020 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 14:23:41,163 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_906], 1=[array_4, v_prenex_907]} [2021-06-05 14:23:41,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 25 treesize of output 19 [2021-06-05 14:23:41,167 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:41,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 35 treesize of output 27 [2021-06-05 14:23:41,170 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:41,209 INFO L628 ElimStorePlain]: treesize reduction 79, result has 41.5 percent of original size [2021-06-05 14:23:41,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 7 treesize of output 5 [2021-06-05 14:23:41,211 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:41,226 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:41,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 22 treesize of output 14 [2021-06-05 14:23:41,228 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:41,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:41,251 INFO L518 ElimStorePlain]: Eliminatee v_prenex_907 vanished before elimination [2021-06-05 14:23:41,251 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:41,251 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 14:23:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:41,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767992761] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:41,316 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:41,316 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:23:41,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95833295] [2021-06-05 14:23:41,316 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:41,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:41,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:41,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:41,317 INFO L87 Difference]: Start difference. First operand 884 states and 3278 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:41,701 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-06-05 14:23:42,013 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2021-06-05 14:23:42,212 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2021-06-05 14:23:42,406 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-06-05 14:23:42,577 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2021-06-05 14:23:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:42,648 INFO L93 Difference]: Finished difference Result 1071 states and 3832 transitions. [2021-06-05 14:23:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:23:42,648 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:42,650 INFO L225 Difference]: With dead ends: 1071 [2021-06-05 14:23:42,650 INFO L226 Difference]: Without dead ends: 1061 [2021-06-05 14:23:42,650 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1485.3ms TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:23:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2021-06-05 14:23:42,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 886. [2021-06-05 14:23:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 3.7084745762711866) internal successors, (3282), 885 states have internal predecessors, (3282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:42,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 3282 transitions. [2021-06-05 14:23:42,660 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 3282 transitions. Word has length 18 [2021-06-05 14:23:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:42,660 INFO L482 AbstractCegarLoop]: Abstraction has 886 states and 3282 transitions. [2021-06-05 14:23:42,660 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 3282 transitions. [2021-06-05 14:23:42,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:42,661 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:42,661 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:42,861 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4037,342 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:42,862 INFO L430 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:42,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:42,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1825878340, now seen corresponding path program 196 times [2021-06-05 14:23:42,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:42,862 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604046642] [2021-06-05 14:23:42,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:43,251 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 59 [2021-06-05 14:23:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:43,521 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:43,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604046642] [2021-06-05 14:23:43,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604046642] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:43,521 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631041555] [2021-06-05 14:23:43,521 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 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:43,547 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:23:43,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:43,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:43,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:43,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:43,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 26 treesize of output 20 [2021-06-05 14:23:43,618 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:43,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:43,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 15 treesize of output 11 [2021-06-05 14:23:43,621 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:43,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:43,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:43,624 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:43,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:23:43,627 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:43,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:43,651 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:43,651 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 14:23:43,806 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:43,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 25 treesize of output 19 [2021-06-05 14:23:43,807 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:43,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:43,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 35 treesize of output 27 [2021-06-05 14:23:43,810 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:43,813 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:43,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:23:43,814 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:43,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 25 treesize of output 19 [2021-06-05 14:23:43,816 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:43,852 INFO L628 ElimStorePlain]: treesize reduction 72, result has 40.5 percent of original size [2021-06-05 14:23:43,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 14 [2021-06-05 14:23:43,854 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:43,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:43,868 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:43,868 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:23:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:43,944 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631041555] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:43,944 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:43,944 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:23:43,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8387902] [2021-06-05 14:23:43,944 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:23:43,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:23:43,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:23:43,945 INFO L87 Difference]: Start difference. First operand 886 states and 3282 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:44,374 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2021-06-05 14:23:44,610 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2021-06-05 14:23:44,996 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2021-06-05 14:23:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:45,552 INFO L93 Difference]: Finished difference Result 996 states and 3571 transitions. [2021-06-05 14:23:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:23:45,553 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:45,554 INFO L225 Difference]: With dead ends: 996 [2021-06-05 14:23:45,554 INFO L226 Difference]: Without dead ends: 987 [2021-06-05 14:23:45,555 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1829.8ms TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2021-06-05 14:23:45,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2021-06-05 14:23:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 885. [2021-06-05 14:23:45,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 3.7104072398190047) internal successors, (3280), 884 states have internal predecessors, (3280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 3280 transitions. [2021-06-05 14:23:45,564 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 3280 transitions. Word has length 18 [2021-06-05 14:23:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:45,564 INFO L482 AbstractCegarLoop]: Abstraction has 885 states and 3280 transitions. [2021-06-05 14:23:45,564 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 3280 transitions. [2021-06-05 14:23:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:45,565 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:45,565 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:45,765 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 343 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4052 [2021-06-05 14:23:45,766 INFO L430 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:45,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:45,766 INFO L82 PathProgramCache]: Analyzing trace with hash -543054878, now seen corresponding path program 197 times [2021-06-05 14:23:45,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:45,766 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105502758] [2021-06-05 14:23:45,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:46,059 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:46,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105502758] [2021-06-05 14:23:46,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105502758] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:46,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631988278] [2021-06-05 14:23:46,059 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 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:46,086 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:23:46,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:46,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:46,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:46,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:46,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 25 treesize of output 19 [2021-06-05 14:23:46,177 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:46,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:46,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:46,180 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:46,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:46,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 16 treesize of output 12 [2021-06-05 14:23:46,184 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:46,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 26 treesize of output 20 [2021-06-05 14:23:46,187 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:46,221 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:46,222 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:23:46,222 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:111 [2021-06-05 14:23:46,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:46,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 25 treesize of output 19 [2021-06-05 14:23:46,331 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:46,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:46,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 35 treesize of output 27 [2021-06-05 14:23:46,334 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:46,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:46,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:46,347 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:46,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:46,349 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:46,384 INFO L628 ElimStorePlain]: treesize reduction 78, result has 35.5 percent of original size [2021-06-05 14:23:46,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 11 treesize of output 7 [2021-06-05 14:23:46,387 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:46,401 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:46,401 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:46,401 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:23:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:46,465 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631988278] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:46,465 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:46,465 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:23:46,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715019535] [2021-06-05 14:23:46,466 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:46,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:46,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:46,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:46,466 INFO L87 Difference]: Start difference. First operand 885 states and 3280 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:47,016 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-06-05 14:23:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:47,365 INFO L93 Difference]: Finished difference Result 936 states and 3421 transitions. [2021-06-05 14:23:47,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:23:47,365 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:47,367 INFO L225 Difference]: With dead ends: 936 [2021-06-05 14:23:47,367 INFO L226 Difference]: Without dead ends: 931 [2021-06-05 14:23:47,367 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 985.1ms TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:23:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-06-05 14:23:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 883. [2021-06-05 14:23:47,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 3.709750566893424) internal successors, (3272), 882 states have internal predecessors, (3272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 3272 transitions. [2021-06-05 14:23:47,376 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 3272 transitions. Word has length 18 [2021-06-05 14:23:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:47,376 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 3272 transitions. [2021-06-05 14:23:47,376 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 3272 transitions. [2021-06-05 14:23:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:47,377 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:47,377 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:47,577 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4066,344 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:47,578 INFO L430 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:47,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1647567582, now seen corresponding path program 198 times [2021-06-05 14:23:47,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:47,578 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132727467] [2021-06-05 14:23:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:23:47,645 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:47,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132727467] [2021-06-05 14:23:47,645 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132727467] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:47,645 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228655789] [2021-06-05 14:23:47,645 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 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:47,671 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:23:47,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:47,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 14:23:47,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:47,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 18 treesize of output 14 [2021-06-05 14:23:47,696 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:47,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 7 treesize of output 5 [2021-06-05 14:23:47,699 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:47,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:47,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 10 treesize of output 6 [2021-06-05 14:23:47,713 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:47,724 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:47,725 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:47,725 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 14:23:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:23:47,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228655789] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:47,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:47,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:23:47,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029826357] [2021-06-05 14:23:47,806 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:23:47,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:47,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:23:47,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:23:47,807 INFO L87 Difference]: Start difference. First operand 883 states and 3272 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:23:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:48,359 INFO L93 Difference]: Finished difference Result 1362 states and 4657 transitions. [2021-06-05 14:23:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:23:48,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:23:48,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:48,362 INFO L225 Difference]: With dead ends: 1362 [2021-06-05 14:23:48,362 INFO L226 Difference]: Without dead ends: 1265 [2021-06-05 14:23:48,362 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 498.3ms TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:23:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-06-05 14:23:48,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 950. [2021-06-05 14:23:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.7829293993677555) internal successors, (3590), 949 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3590 transitions. [2021-06-05 14:23:48,378 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3590 transitions. Word has length 18 [2021-06-05 14:23:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:48,378 INFO L482 AbstractCegarLoop]: Abstraction has 950 states and 3590 transitions. [2021-06-05 14:23:48,378 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:23:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3590 transitions. [2021-06-05 14:23:48,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:48,380 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:48,380 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:48,603 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 345 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4081 [2021-06-05 14:23:48,603 INFO L430 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:48,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:48,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2349128, now seen corresponding path program 199 times [2021-06-05 14:23:48,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:48,603 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000134249] [2021-06-05 14:23:48,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:48,872 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:48,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000134249] [2021-06-05 14:23:48,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000134249] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:48,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750591814] [2021-06-05 14:23:48,872 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 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:48,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:23:48,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:48,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:48,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:48,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:23:48,983 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:48,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:48,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 25 treesize of output 19 [2021-06-05 14:23:48,986 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:49,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:49,007 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:49,007 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:55 [2021-06-05 14:23:49,203 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_4]} [2021-06-05 14:23:49,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:49,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 25 treesize of output 19 [2021-06-05 14:23:49,208 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:49,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:49,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 17 treesize of output 13 [2021-06-05 14:23:49,212 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:49,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:49,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:23:49,216 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:49,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:23:49,220 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:49,270 INFO L628 ElimStorePlain]: treesize reduction 79, result has 42.3 percent of original size [2021-06-05 14:23:49,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:49,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 11 treesize of output 7 [2021-06-05 14:23:49,273 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:49,293 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:49,295 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:49,295 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:173, output treesize:38 [2021-06-05 14:23:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:49,356 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750591814] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:49,356 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:49,356 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:23:49,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100385751] [2021-06-05 14:23:49,357 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:23:49,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:49,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:23:49,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:23:49,357 INFO L87 Difference]: Start difference. First operand 950 states and 3590 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:23:50,110 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2021-06-05 14:23:50,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:50,157 INFO L93 Difference]: Finished difference Result 1072 states and 3951 transitions. [2021-06-05 14:23:50,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:23:50,158 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:23:50,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:50,159 INFO L225 Difference]: With dead ends: 1072 [2021-06-05 14:23:50,159 INFO L226 Difference]: Without dead ends: 1053 [2021-06-05 14:23:50,159 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 872.0ms TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:23:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2021-06-05 14:23:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 955. [2021-06-05 14:23:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 3.7788259958071277) internal successors, (3605), 954 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 3605 transitions. [2021-06-05 14:23:50,170 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 3605 transitions. Word has length 18 [2021-06-05 14:23:50,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:50,170 INFO L482 AbstractCegarLoop]: Abstraction has 955 states and 3605 transitions. [2021-06-05 14:23:50,170 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:23:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 3605 transitions. [2021-06-05 14:23:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:50,171 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:50,171 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:50,372 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 346 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4089 [2021-06-05 14:23:50,372 INFO L430 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:50,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:50,372 INFO L82 PathProgramCache]: Analyzing trace with hash 858845074, now seen corresponding path program 200 times [2021-06-05 14:23:50,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:50,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687042820] [2021-06-05 14:23:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:50,657 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:50,657 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687042820] [2021-06-05 14:23:50,657 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687042820] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:50,657 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336420097] [2021-06-05 14:23:50,657 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 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:50,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:23:50,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:50,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:50,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:50,766 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:50,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:50,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 15 treesize of output 11 [2021-06-05 14:23:50,768 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:50,770 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:50,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:50,771 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:50,791 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:50,792 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:50,792 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:55 [2021-06-05 14:23:50,976 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_913, array_2], 1=[v_prenex_914, array_4]} [2021-06-05 14:23:50,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 19 treesize of output 15 [2021-06-05 14:23:50,980 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:50,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 17 treesize of output 13 [2021-06-05 14:23:50,983 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:51,015 INFO L628 ElimStorePlain]: treesize reduction 63, result has 42.7 percent of original size [2021-06-05 14:23:51,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:23:51,018 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:51,028 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:51,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:51,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 11 treesize of output 7 [2021-06-05 14:23:51,032 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:51,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:51,042 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:23:51,043 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:51,043 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 14:23:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:51,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336420097] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:51,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:51,071 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 14:23:51,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705006525] [2021-06-05 14:23:51,071 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:51,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:51,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:51,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:51,071 INFO L87 Difference]: Start difference. First operand 955 states and 3605 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:23:51,680 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 61 [2021-06-05 14:23:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:52,054 INFO L93 Difference]: Finished difference Result 1084 states and 3991 transitions. [2021-06-05 14:23:52,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:23:52,055 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:23:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:52,056 INFO L225 Difference]: With dead ends: 1084 [2021-06-05 14:23:52,056 INFO L226 Difference]: Without dead ends: 1074 [2021-06-05 14:23:52,056 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1000.2ms TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:23:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2021-06-05 14:23:52,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 950. [2021-06-05 14:23:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.7829293993677555) internal successors, (3590), 949 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3590 transitions. [2021-06-05 14:23:52,067 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3590 transitions. Word has length 18 [2021-06-05 14:23:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:52,067 INFO L482 AbstractCegarLoop]: Abstraction has 950 states and 3590 transitions. [2021-06-05 14:23:52,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:23:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3590 transitions. [2021-06-05 14:23:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:52,068 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:52,068 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:52,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 347 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4101 [2021-06-05 14:23:52,268 INFO L430 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:52,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1946717226, now seen corresponding path program 201 times [2021-06-05 14:23:52,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:52,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741459535] [2021-06-05 14:23:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:52,474 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:52,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741459535] [2021-06-05 14:23:52,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741459535] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:52,475 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582578713] [2021-06-05 14:23:52,475 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 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:52,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:23:52,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:52,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:52,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:52,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:52,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:52,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 25 treesize of output 19 [2021-06-05 14:23:52,600 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:52,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:52,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:52,603 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:52,627 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:52,627 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:52,628 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:86, output treesize:68 [2021-06-05 14:23:52,763 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_917], 1=[array_4, v_prenex_918]} [2021-06-05 14:23:52,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 25 treesize of output 19 [2021-06-05 14:23:52,766 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:52,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 15 treesize of output 11 [2021-06-05 14:23:52,769 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:52,803 INFO L628 ElimStorePlain]: treesize reduction 61, result has 42.5 percent of original size [2021-06-05 14:23:52,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 19 treesize of output 15 [2021-06-05 14:23:52,806 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:52,816 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:52,816 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:23:52,818 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:52,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 11 treesize of output 7 [2021-06-05 14:23:52,819 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:52,829 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:52,830 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:52,830 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:120, output treesize:16 [2021-06-05 14:23:52,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:52,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582578713] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:52,854 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:52,854 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:23:52,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283368077] [2021-06-05 14:23:52,855 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:23:52,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:52,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:23:52,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:23:52,855 INFO L87 Difference]: Start difference. First operand 950 states and 3590 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:23:53,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:53,272 INFO L93 Difference]: Finished difference Result 1011 states and 3762 transitions. [2021-06-05 14:23:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:53,272 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:23:53,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:53,274 INFO L225 Difference]: With dead ends: 1011 [2021-06-05 14:23:53,274 INFO L226 Difference]: Without dead ends: 1006 [2021-06-05 14:23:53,274 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 493.5ms TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:23:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-06-05 14:23:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 956. [2021-06-05 14:23:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 955 states have (on average 3.781151832460733) internal successors, (3611), 955 states have internal predecessors, (3611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 3611 transitions. [2021-06-05 14:23:53,284 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 3611 transitions. Word has length 18 [2021-06-05 14:23:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:53,284 INFO L482 AbstractCegarLoop]: Abstraction has 956 states and 3611 transitions. [2021-06-05 14:23:53,284 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:23:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 3611 transitions. [2021-06-05 14:23:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:53,285 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:53,285 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:53,486 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4116,348 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:53,486 INFO L430 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:53,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:53,486 INFO L82 PathProgramCache]: Analyzing trace with hash 408261324, now seen corresponding path program 202 times [2021-06-05 14:23:53,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:53,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621943427] [2021-06-05 14:23:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:53,723 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:53,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621943427] [2021-06-05 14:23:53,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621943427] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:53,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996578149] [2021-06-05 14:23:53,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:53,749 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:23:53,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:53,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:23:53,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:53,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:53,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:53,853 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:53,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:53,856 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:53,880 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:53,881 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:53,881 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 14:23:53,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:53,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:23:53,939 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:53,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:53,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:53,943 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:53,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:53,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 17 treesize of output 13 [2021-06-05 14:23:53,946 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:53,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 25 treesize of output 19 [2021-06-05 14:23:53,949 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:54,004 INFO L628 ElimStorePlain]: treesize reduction 85, result has 40.6 percent of original size [2021-06-05 14:23:54,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 11 treesize of output 7 [2021-06-05 14:23:54,008 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:54,030 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:54,031 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:54,031 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:173, output treesize:50 [2021-06-05 14:23:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:54,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996578149] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:54,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:54,133 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-06-05 14:23:54,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399434718] [2021-06-05 14:23:54,133 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:23:54,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:54,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:23:54,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:23:54,133 INFO L87 Difference]: Start difference. First operand 956 states and 3611 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:54,623 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2021-06-05 14:23:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:54,950 INFO L93 Difference]: Finished difference Result 1021 states and 3787 transitions. [2021-06-05 14:23:54,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:54,950 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:54,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:54,952 INFO L225 Difference]: With dead ends: 1021 [2021-06-05 14:23:54,952 INFO L226 Difference]: Without dead ends: 1009 [2021-06-05 14:23:54,952 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 878.4ms TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:23:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-06-05 14:23:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 953. [2021-06-05 14:23:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 952 states have (on average 3.7804621848739495) internal successors, (3599), 952 states have internal predecessors, (3599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 3599 transitions. [2021-06-05 14:23:54,965 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 3599 transitions. Word has length 18 [2021-06-05 14:23:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:54,965 INFO L482 AbstractCegarLoop]: Abstraction has 953 states and 3599 transitions. [2021-06-05 14:23:54,966 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 3599 transitions. [2021-06-05 14:23:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:54,967 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:54,967 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:55,180 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4130,349 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:55,181 INFO L430 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:55,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:55,181 INFO L82 PathProgramCache]: Analyzing trace with hash -465479356, now seen corresponding path program 203 times [2021-06-05 14:23:55,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:55,181 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560858504] [2021-06-05 14:23:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:55,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:55,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560858504] [2021-06-05 14:23:55,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560858504] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:55,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925855483] [2021-06-05 14:23:55,431 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 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:55,458 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:23:55,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:55,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:55,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:55,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 25 treesize of output 19 [2021-06-05 14:23:55,564 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:55,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:55,566 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:55,582 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:55,583 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:55,583 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 14:23:55,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:55,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:55,633 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:55,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:55,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 35 treesize of output 27 [2021-06-05 14:23:55,637 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:55,640 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:55,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:55,641 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:55,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:23:55,644 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:55,689 INFO L628 ElimStorePlain]: treesize reduction 64, result has 43.4 percent of original size [2021-06-05 14:23:55,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:23:55,692 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:55,706 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:55,707 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:55,707 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:23:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:55,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925855483] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:55,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:55,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:23:55,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695404641] [2021-06-05 14:23:55,766 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:23:55,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:55,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:23:55,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:23:55,767 INFO L87 Difference]: Start difference. First operand 953 states and 3599 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:56,519 INFO L93 Difference]: Finished difference Result 1019 states and 3793 transitions. [2021-06-05 14:23:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:23:56,519 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:23:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:56,521 INFO L225 Difference]: With dead ends: 1019 [2021-06-05 14:23:56,521 INFO L226 Difference]: Without dead ends: 1014 [2021-06-05 14:23:56,521 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 818.5ms TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:23:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-06-05 14:23:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 950. [2021-06-05 14:23:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.7829293993677555) internal successors, (3590), 949 states have internal predecessors, (3590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3590 transitions. [2021-06-05 14:23:56,531 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3590 transitions. Word has length 18 [2021-06-05 14:23:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:56,531 INFO L482 AbstractCegarLoop]: Abstraction has 950 states and 3590 transitions. [2021-06-05 14:23:56,531 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:56,531 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3590 transitions. [2021-06-05 14:23:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:56,532 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:56,532 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:56,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 350 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4141 [2021-06-05 14:23:56,733 INFO L430 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:56,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash -786313054, now seen corresponding path program 204 times [2021-06-05 14:23:56,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:56,733 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481121237] [2021-06-05 14:23:56,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:23:56,798 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:56,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481121237] [2021-06-05 14:23:56,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481121237] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:56,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581479060] [2021-06-05 14:23:56,799 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 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:56,825 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:23:56,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:56,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 14:23:56,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:56,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 18 treesize of output 14 [2021-06-05 14:23:56,850 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:56,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 7 treesize of output 5 [2021-06-05 14:23:56,853 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:56,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:56,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 10 treesize of output 6 [2021-06-05 14:23:56,867 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:56,878 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:56,879 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:56,879 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 14:23:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:23:56,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581479060] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:56,956 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:56,956 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2021-06-05 14:23:56,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621544827] [2021-06-05 14:23:56,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 14:23:56,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:56,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 14:23:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 14:23:56,956 INFO L87 Difference]: Start difference. First operand 950 states and 3590 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:23:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:57,579 INFO L93 Difference]: Finished difference Result 1682 states and 5831 transitions. [2021-06-05 14:23:57,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:23:57,580 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:23:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:57,582 INFO L225 Difference]: With dead ends: 1682 [2021-06-05 14:23:57,582 INFO L226 Difference]: Without dead ends: 1571 [2021-06-05 14:23:57,582 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 565.8ms TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:23:57,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2021-06-05 14:23:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 932. [2021-06-05 14:23:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 14:23:57,596 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 14:23:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:57,596 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 14:23:57,596 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:23:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 14:23:57,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:57,598 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:57,598 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:57,798 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 351 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4151 [2021-06-05 14:23:57,798 INFO L430 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:57,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:57,798 INFO L82 PathProgramCache]: Analyzing trace with hash 436630378, now seen corresponding path program 205 times [2021-06-05 14:23:57,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:57,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183672380] [2021-06-05 14:23:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:57,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:57,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183672380] [2021-06-05 14:23:57,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183672380] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:57,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978679305] [2021-06-05 14:23:57,972 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 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:57,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:23:57,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:58,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:58,128 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:58,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 25 treesize of output 19 [2021-06-05 14:23:58,129 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:58,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:58,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:58,141 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:58,177 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:58,179 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:23:58,179 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:90 [2021-06-05 14:23:58,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:58,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:58,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:58,418 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:58,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:58,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:58,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:23:58,424 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:58,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:58,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:58,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 25 treesize of output 19 [2021-06-05 14:23:58,430 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:58,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:58,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:23:58,435 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:58,495 INFO L628 ElimStorePlain]: treesize reduction 99, result has 42.8 percent of original size [2021-06-05 14:23:58,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:58,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 11 treesize of output 7 [2021-06-05 14:23:58,499 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:58,524 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:58,526 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:58,526 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:205, output treesize:44 [2021-06-05 14:23:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:58,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978679305] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:58,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:58,589 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 14:23:58,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38716200] [2021-06-05 14:23:58,589 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:23:58,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:58,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:23:58,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:23:58,590 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:23:58,919 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2021-06-05 14:23:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:23:58,974 INFO L93 Difference]: Finished difference Result 979 states and 3632 transitions. [2021-06-05 14:23:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:23:58,974 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:23:58,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:23:58,976 INFO L225 Difference]: With dead ends: 979 [2021-06-05 14:23:58,976 INFO L226 Difference]: Without dead ends: 966 [2021-06-05 14:23:58,976 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 527.7ms TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:23:58,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-06-05 14:23:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 938. [2021-06-05 14:23:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 3.7630736392742796) internal successors, (3526), 937 states have internal predecessors, (3526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:23:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 3526 transitions. [2021-06-05 14:23:58,985 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 3526 transitions. Word has length 18 [2021-06-05 14:23:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:23:58,985 INFO L482 AbstractCegarLoop]: Abstraction has 938 states and 3526 transitions. [2021-06-05 14:23:58,986 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:23:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 3526 transitions. [2021-06-05 14:23:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:23:58,987 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:23:58,987 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:23:59,187 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4160,352 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:59,187 INFO L430 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:23:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:23:59,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1503358368, now seen corresponding path program 206 times [2021-06-05 14:23:59,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:23:59,188 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717942829] [2021-06-05 14:23:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:23:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:23:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:59,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:23:59,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717942829] [2021-06-05 14:23:59,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717942829] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:59,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58865056] [2021-06-05 14:23:59,347 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 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:23:59,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:23:59,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:23:59,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:23:59,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:23:59,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:59,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:59,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 25 treesize of output 19 [2021-06-05 14:23:59,516 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:59,520 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:59,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:23:59,521 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:59,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:59,567 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:23:59,567 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:84 [2021-06-05 14:23:59,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:59,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:59,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 17 treesize of output 13 [2021-06-05 14:23:59,650 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:59,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:59,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 27 treesize of output 21 [2021-06-05 14:23:59,654 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:59,722 INFO L628 ElimStorePlain]: treesize reduction 106, result has 41.4 percent of original size [2021-06-05 14:23:59,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 7 treesize of output 5 [2021-06-05 14:23:59,726 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:23:59,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:59,747 INFO L518 ElimStorePlain]: Eliminatee v_prenex_928 vanished before elimination [2021-06-05 14:23:59,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:23:59,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 11 treesize of output 7 [2021-06-05 14:23:59,751 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:23:59,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:23:59,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:23:59,774 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:193, output treesize:76 [2021-06-05 14:23:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:23:59,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58865056] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:23:59,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:23:59,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:23:59,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076411048] [2021-06-05 14:23:59,856 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:23:59,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:23:59,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:23:59,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:23:59,856 INFO L87 Difference]: Start difference. First operand 938 states and 3526 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:24:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:00,209 INFO L93 Difference]: Finished difference Result 981 states and 3649 transitions. [2021-06-05 14:24:00,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:00,210 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:24:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:00,211 INFO L225 Difference]: With dead ends: 981 [2021-06-05 14:24:00,211 INFO L226 Difference]: Without dead ends: 976 [2021-06-05 14:24:00,211 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 369.8ms TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:24:00,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2021-06-05 14:24:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 935. [2021-06-05 14:24:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 934 states have (on average 3.7655246252676657) internal successors, (3517), 934 states have internal predecessors, (3517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 3517 transitions. [2021-06-05 14:24:00,221 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 3517 transitions. Word has length 18 [2021-06-05 14:24:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:00,221 INFO L482 AbstractCegarLoop]: Abstraction has 935 states and 3517 transitions. [2021-06-05 14:24:00,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:24:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 3517 transitions. [2021-06-05 14:24:00,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:00,222 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:00,222 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:00,423 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 353 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4176 [2021-06-05 14:24:00,423 INFO L430 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:00,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:00,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1917868248, now seen corresponding path program 207 times [2021-06-05 14:24:00,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:00,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029167337] [2021-06-05 14:24:00,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:00,612 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:00,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029167337] [2021-06-05 14:24:00,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029167337] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:00,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913104509] [2021-06-05 14:24:00,612 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 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:00,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:24:00,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:00,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:00,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:00,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:00,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:00,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:24:00,777 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:00,780 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:00,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:00,781 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:00,814 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:00,816 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:24:00,816 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:93 [2021-06-05 14:24:00,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:00,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:00,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:00,944 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:00,947 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:00,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:24:00,948 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:01,023 INFO L628 ElimStorePlain]: treesize reduction 111, result has 42.5 percent of original size [2021-06-05 14:24:01,023 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:01,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:01,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:24:01,027 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:01,052 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:01,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:01,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 22 treesize of output 14 [2021-06-05 14:24:01,056 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:01,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:01,081 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:01,081 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:207, output treesize:35 [2021-06-05 14:24:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:01,135 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913104509] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:01,135 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:01,135 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2021-06-05 14:24:01,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356701685] [2021-06-05 14:24:01,135 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:24:01,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:01,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:24:01,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:24:01,135 INFO L87 Difference]: Start difference. First operand 935 states and 3517 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:24:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:01,792 INFO L93 Difference]: Finished difference Result 994 states and 3674 transitions. [2021-06-05 14:24:01,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:24:01,792 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:24:01,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:01,794 INFO L225 Difference]: With dead ends: 994 [2021-06-05 14:24:01,794 INFO L226 Difference]: Without dead ends: 989 [2021-06-05 14:24:01,794 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 627.6ms TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:24:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-06-05 14:24:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 938. [2021-06-05 14:24:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 3.7662753468516543) internal successors, (3529), 937 states have internal predecessors, (3529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 3529 transitions. [2021-06-05 14:24:01,804 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 3529 transitions. Word has length 18 [2021-06-05 14:24:01,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:01,804 INFO L482 AbstractCegarLoop]: Abstraction has 938 states and 3529 transitions. [2021-06-05 14:24:01,804 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:24:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 3529 transitions. [2021-06-05 14:24:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:01,805 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:01,805 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:02,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4195,354 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:02,005 INFO L430 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:02,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:02,006 INFO L82 PathProgramCache]: Analyzing trace with hash 246892232, now seen corresponding path program 208 times [2021-06-05 14:24:02,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:02,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110153019] [2021-06-05 14:24:02,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:02,215 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:02,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110153019] [2021-06-05 14:24:02,215 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110153019] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:02,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927692113] [2021-06-05 14:24:02,215 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 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:02,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:24:02,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:02,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:24:02,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:02,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:02,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:02,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 15 treesize of output 11 [2021-06-05 14:24:02,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:02,375 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:02,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:02,376 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:02,413 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:02,416 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:24:02,416 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:103 [2021-06-05 14:24:02,546 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 14:24:02,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:02,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:02,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 25 treesize of output 19 [2021-06-05 14:24:02,552 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:02,555 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:02,555 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:02,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 15 treesize of output 11 [2021-06-05 14:24:02,556 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:02,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:02,560 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:02,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 35 treesize of output 27 [2021-06-05 14:24:02,561 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:02,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:02,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 25 treesize of output 19 [2021-06-05 14:24:02,566 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:02,618 INFO L628 ElimStorePlain]: treesize reduction 98, result has 42.0 percent of original size [2021-06-05 14:24:02,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:02,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:24:02,622 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:02,644 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:02,646 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:02,646 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:207, output treesize:79 [2021-06-05 14:24:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:02,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927692113] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:02,735 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:02,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-06-05 14:24:02,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906078640] [2021-06-05 14:24:02,735 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:24:02,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:02,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:24:02,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:24:02,736 INFO L87 Difference]: Start difference. First operand 938 states and 3529 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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:24:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:03,014 INFO L93 Difference]: Finished difference Result 977 states and 3628 transitions. [2021-06-05 14:24:03,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:03,015 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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:24:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:03,016 INFO L225 Difference]: With dead ends: 977 [2021-06-05 14:24:03,016 INFO L226 Difference]: Without dead ends: 966 [2021-06-05 14:24:03,016 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 476.4ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:24:03,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-06-05 14:24:03,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 932. [2021-06-05 14:24:03,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 14:24:03,026 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 14:24:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:03,026 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 14:24:03,026 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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:24:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 14:24:03,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:03,027 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:03,027 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:03,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 355 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4222 [2021-06-05 14:24:03,227 INFO L430 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:03,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:03,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1828182638, now seen corresponding path program 209 times [2021-06-05 14:24:03,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:03,228 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160017668] [2021-06-05 14:24:03,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:03,531 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:03,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160017668] [2021-06-05 14:24:03,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160017668] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:03,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6454488] [2021-06-05 14:24:03,532 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 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:03,558 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:24:03,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:03,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:24:03,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:03,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:03,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:03,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:03,643 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:03,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:03,647 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:03,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 26 treesize of output 20 [2021-06-05 14:24:03,648 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:03,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:03,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:03,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 15 treesize of output 11 [2021-06-05 14:24:03,652 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:03,655 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:03,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:03,656 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:03,715 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:03,717 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:03,717 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:199, output treesize:163 [2021-06-05 14:24:04,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:04,074 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:04,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 25 treesize of output 19 [2021-06-05 14:24:04,076 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:04,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:04,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:04,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 27 treesize of output 21 [2021-06-05 14:24:04,084 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:04,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:04,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:04,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:24:04,089 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:04,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:04,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:24:04,094 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:04,156 INFO L628 ElimStorePlain]: treesize reduction 95, result has 43.8 percent of original size [2021-06-05 14:24:04,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:04,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:24:04,160 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:04,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:04,187 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:04,188 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:205, output treesize:41 [2021-06-05 14:24:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:04,265 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6454488] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:04,265 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:04,265 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2021-06-05 14:24:04,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189384503] [2021-06-05 14:24:04,265 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:24:04,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:04,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:24:04,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:24:04,265 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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:24:04,558 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2021-06-05 14:24:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:04,789 INFO L93 Difference]: Finished difference Result 984 states and 3645 transitions. [2021-06-05 14:24:04,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:04,789 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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:24:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:04,790 INFO L225 Difference]: With dead ends: 984 [2021-06-05 14:24:04,790 INFO L226 Difference]: Without dead ends: 971 [2021-06-05 14:24:04,791 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 863.2ms TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:24:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-06-05 14:24:04,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 938. [2021-06-05 14:24:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 937 states have (on average 3.7630736392742796) internal successors, (3526), 937 states have internal predecessors, (3526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 3526 transitions. [2021-06-05 14:24:04,800 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 3526 transitions. Word has length 18 [2021-06-05 14:24:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:04,800 INFO L482 AbstractCegarLoop]: Abstraction has 938 states and 3526 transitions. [2021-06-05 14:24:04,800 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 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:24:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 3526 transitions. [2021-06-05 14:24:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:04,802 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:04,802 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:05,002 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4237,356 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:05,002 INFO L430 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:05,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:05,003 INFO L82 PathProgramCache]: Analyzing trace with hash 526795912, now seen corresponding path program 210 times [2021-06-05 14:24:05,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:05,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302726081] [2021-06-05 14:24:05,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:05,278 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:05,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302726081] [2021-06-05 14:24:05,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302726081] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:05,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845476795] [2021-06-05 14:24:05,278 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 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:05,311 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:24:05,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:05,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:05,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:05,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,438 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:24:05,439 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:05,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,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 25 treesize of output 19 [2021-06-05 14:24:05,443 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:05,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:05,448 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:05,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,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 26 treesize of output 20 [2021-06-05 14:24:05,451 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:05,504 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:05,508 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:24:05,508 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:193, output treesize:161 [2021-06-05 14:24:05,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,781 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:24:05,782 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:05,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,786 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:05,787 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:05,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:05,792 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:05,795 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:24:05,796 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:05,865 INFO L628 ElimStorePlain]: treesize reduction 92, result has 45.6 percent of original size [2021-06-05 14:24:05,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:05,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:24:05,869 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:05,893 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:05,894 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:05,894 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:207, output treesize:35 [2021-06-05 14:24:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:05,948 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845476795] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:05,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:05,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:24:05,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792290055] [2021-06-05 14:24:05,948 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:24:05,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:05,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:24:05,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:24:05,948 INFO L87 Difference]: Start difference. First operand 938 states and 3526 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:24:06,250 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 62 [2021-06-05 14:24:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:06,640 INFO L93 Difference]: Finished difference Result 996 states and 3695 transitions. [2021-06-05 14:24:06,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:06,640 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:24:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:06,642 INFO L225 Difference]: With dead ends: 996 [2021-06-05 14:24:06,642 INFO L226 Difference]: Without dead ends: 991 [2021-06-05 14:24:06,642 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 806.0ms TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:24:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2021-06-05 14:24:06,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 932. [2021-06-05 14:24:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 14:24:06,653 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 14:24:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:06,653 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 14:24:06,653 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:24:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 14:24:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:06,654 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:06,654 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:06,854 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 357 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4250 [2021-06-05 14:24:06,855 INFO L430 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:06,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1621089656, now seen corresponding path program 211 times [2021-06-05 14:24:06,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:06,855 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807363271] [2021-06-05 14:24:06,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:07,269 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:07,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807363271] [2021-06-05 14:24:07,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807363271] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:07,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393976819] [2021-06-05 14:24:07,269 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 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:07,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:24:07,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:07,384 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:07,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:07,385 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:07,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:07,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 25 treesize of output 19 [2021-06-05 14:24:07,389 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:07,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:07,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 26 treesize of output 20 [2021-06-05 14:24:07,392 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:07,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:24:07,396 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:07,448 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:07,449 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:07,449 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 14:24:07,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:07,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:07,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:07,596 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:07,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:07,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:07,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 17 treesize of output 13 [2021-06-05 14:24:07,600 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:07,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:07,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:07,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:24:07,604 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:07,607 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:07,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:24:07,608 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:07,673 INFO L628 ElimStorePlain]: treesize reduction 89, result has 44.0 percent of original size [2021-06-05 14:24:07,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:07,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:24:07,676 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:07,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:07,703 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:07,703 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:185, output treesize:56 [2021-06-05 14:24:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:07,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393976819] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:07,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:07,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 14:24:07,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196367439] [2021-06-05 14:24:07,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:24:07,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:07,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:24:07,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:24:07,845 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:24:08,255 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2021-06-05 14:24:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:08,474 INFO L93 Difference]: Finished difference Result 988 states and 3667 transitions. [2021-06-05 14:24:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:08,474 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:24:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:08,476 INFO L225 Difference]: With dead ends: 988 [2021-06-05 14:24:08,476 INFO L226 Difference]: Without dead ends: 975 [2021-06-05 14:24:08,476 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 982.9ms TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:24:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2021-06-05 14:24:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 932. [2021-06-05 14:24:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 931 states have (on average 3.7679914070891516) internal successors, (3508), 931 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 3508 transitions. [2021-06-05 14:24:08,485 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 3508 transitions. Word has length 18 [2021-06-05 14:24:08,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:08,486 INFO L482 AbstractCegarLoop]: Abstraction has 932 states and 3508 transitions. [2021-06-05 14:24:08,486 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:24:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 3508 transitions. [2021-06-05 14:24:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:08,487 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:08,487 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:08,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4279,358 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:08,687 INFO L430 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:08,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash -584456886, now seen corresponding path program 212 times [2021-06-05 14:24:08,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:08,688 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868931743] [2021-06-05 14:24:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:24:08,733 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:08,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868931743] [2021-06-05 14:24:08,733 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868931743] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:08,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854841894] [2021-06-05 14:24:08,733 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 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:08,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:24:08,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:08,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:24:08,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:08,811 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:08,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 25 treesize of output 19 [2021-06-05 14:24:08,812 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:08,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:08,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 26 treesize of output 20 [2021-06-05 14:24:08,815 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:08,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:08,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 16 treesize of output 12 [2021-06-05 14:24:08,818 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:08,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 15 treesize of output 11 [2021-06-05 14:24:08,821 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:08,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:08,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:08,845 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 14:24:08,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:08,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:08,943 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:08,945 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:08,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 15 treesize of output 11 [2021-06-05 14:24:08,946 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:08,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:08,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 26 treesize of output 20 [2021-06-05 14:24:08,949 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:08,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:08,951 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:08,979 INFO L628 ElimStorePlain]: treesize reduction 64, result has 29.7 percent of original size [2021-06-05 14:24:08,979 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:08,980 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:08,980 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:27 [2021-06-05 14:24:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:09,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854841894] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:09,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:09,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:24:09,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252924196] [2021-06-05 14:24:09,007 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:24:09,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:09,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:24:09,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:24:09,008 INFO L87 Difference]: Start difference. First operand 932 states and 3508 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:24:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:10,066 INFO L93 Difference]: Finished difference Result 1418 states and 4919 transitions. [2021-06-05 14:24:10,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 14:24:10,067 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:24:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:10,069 INFO L225 Difference]: With dead ends: 1418 [2021-06-05 14:24:10,069 INFO L226 Difference]: Without dead ends: 1269 [2021-06-05 14:24:10,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 915.5ms TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2021-06-05 14:24:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2021-06-05 14:24:10,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 878. [2021-06-05 14:24:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 14:24:10,080 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 14:24:10,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:10,080 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 14:24:10,080 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 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:24:10,080 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 14:24:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:10,081 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:10,081 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:10,282 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 359 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4293 [2021-06-05 14:24:10,282 INFO L430 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:10,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1994899952, now seen corresponding path program 213 times [2021-06-05 14:24:10,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:10,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821716693] [2021-06-05 14:24:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:10,788 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:10,788 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821716693] [2021-06-05 14:24:10,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821716693] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:10,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881432473] [2021-06-05 14:24:10,789 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 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:10,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:24:10,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:10,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:10,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:10,965 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:10,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 16 treesize of output 12 [2021-06-05 14:24:10,966 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:10,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:10,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:24:10,969 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:10,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:10,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 26 treesize of output 20 [2021-06-05 14:24:10,973 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:10,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:10,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:10,976 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:10,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:10,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:24:10,980 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:10,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 25 treesize of output 19 [2021-06-05 14:24:10,983 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:11,025 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:11,026 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:24:11,026 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:139 [2021-06-05 14:24:11,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 27 treesize of output 21 [2021-06-05 14:24:11,144 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:11,150 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:11,150 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:11,151 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:11,151 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:24:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:11,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881432473] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:11,181 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:11,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:24:11,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150066881] [2021-06-05 14:24:11,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:24:11,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:11,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:24:11,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:24:11,182 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:11,752 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 61 [2021-06-05 14:24:11,930 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2021-06-05 14:24:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:12,096 INFO L93 Difference]: Finished difference Result 924 states and 3403 transitions. [2021-06-05 14:24:12,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:12,096 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:24:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:12,097 INFO L225 Difference]: With dead ends: 924 [2021-06-05 14:24:12,097 INFO L226 Difference]: Without dead ends: 919 [2021-06-05 14:24:12,097 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1256.7ms TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:24:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2021-06-05 14:24:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 878. [2021-06-05 14:24:12,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 14:24:12,106 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 14:24:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:12,107 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 14:24:12,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 14:24:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:12,108 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:12,108 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:12,308 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4304,360 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:12,308 INFO L430 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1178914066, now seen corresponding path program 214 times [2021-06-05 14:24:12,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:12,308 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72167376] [2021-06-05 14:24:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:12,755 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2021-06-05 14:24:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:13,028 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:13,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72167376] [2021-06-05 14:24:13,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72167376] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:13,028 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006831376] [2021-06-05 14:24:13,028 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 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:13,053 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:24:13,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:13,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:24:13,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:13,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:13,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 16 treesize of output 12 [2021-06-05 14:24:13,188 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:13,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:13,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 26 treesize of output 20 [2021-06-05 14:24:13,192 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:13,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:13,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 25 treesize of output 19 [2021-06-05 14:24:13,195 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:13,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 15 treesize of output 11 [2021-06-05 14:24:13,199 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:13,243 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:13,244 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:13,244 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 14:24:13,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:13,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 25 treesize of output 19 [2021-06-05 14:24:13,428 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:13,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:13,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:24:13,431 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:13,433 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:13,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:24:13,434 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:13,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 25 treesize of output 19 [2021-06-05 14:24:13,437 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:13,477 INFO L628 ElimStorePlain]: treesize reduction 77, result has 37.4 percent of original size [2021-06-05 14:24:13,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:24:13,480 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:13,495 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:13,495 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:13,496 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:157, output treesize:38 [2021-06-05 14:24:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:13,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006831376] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:13,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:13,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 14:24:13,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180250739] [2021-06-05 14:24:13,567 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 14:24:13,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:13,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 14:24:13,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:24:13,567 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:14,194 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2021-06-05 14:24:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:14,716 INFO L93 Difference]: Finished difference Result 989 states and 3591 transitions. [2021-06-05 14:24:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:24:14,716 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:24:14,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:14,718 INFO L225 Difference]: With dead ends: 989 [2021-06-05 14:24:14,718 INFO L226 Difference]: Without dead ends: 971 [2021-06-05 14:24:14,718 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1563.7ms TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:24:14,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2021-06-05 14:24:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 878. [2021-06-05 14:24:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 14:24:14,727 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 14:24:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:14,727 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 14:24:14,728 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 14:24:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:14,729 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:14,729 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:14,929 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 361 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4318 [2021-06-05 14:24:14,929 INFO L430 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1253312526, now seen corresponding path program 215 times [2021-06-05 14:24:14,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:14,929 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549450672] [2021-06-05 14:24:14,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:15,140 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:15,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549450672] [2021-06-05 14:24:15,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549450672] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:15,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904321534] [2021-06-05 14:24:15,140 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 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:15,167 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:24:15,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:15,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:15,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:15,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:15,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:15,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 25 treesize of output 19 [2021-06-05 14:24:15,290 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:15,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:15,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 15 treesize of output 11 [2021-06-05 14:24:15,294 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:15,325 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:15,328 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:24:15,328 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:88 [2021-06-05 14:24:15,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:15,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:15,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 25 treesize of output 19 [2021-06-05 14:24:15,568 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:15,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:15,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:24:15,572 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:15,619 INFO L628 ElimStorePlain]: treesize reduction 81, result has 45.3 percent of original size [2021-06-05 14:24:15,622 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:15,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 22 treesize of output 14 [2021-06-05 14:24:15,623 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:15,639 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:15,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 7 treesize of output 5 [2021-06-05 14:24:15,642 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:15,657 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:15,657 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:15,658 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:15,658 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:160, output treesize:16 [2021-06-05 14:24:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:15,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904321534] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:15,674 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:15,674 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:24:15,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441057261] [2021-06-05 14:24:15,674 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:24:15,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:15,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:24:15,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:24:15,674 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:24:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:16,026 INFO L93 Difference]: Finished difference Result 910 states and 3365 transitions. [2021-06-05 14:24:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:16,026 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:24:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:16,028 INFO L225 Difference]: With dead ends: 910 [2021-06-05 14:24:16,028 INFO L226 Difference]: Without dead ends: 905 [2021-06-05 14:24:16,028 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 434.9ms TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:24:16,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2021-06-05 14:24:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 884. [2021-06-05 14:24:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.7440543601359004) internal successors, (3306), 883 states have internal predecessors, (3306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3306 transitions. [2021-06-05 14:24:16,037 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3306 transitions. Word has length 18 [2021-06-05 14:24:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:16,037 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3306 transitions. [2021-06-05 14:24:16,037 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:24:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3306 transitions. [2021-06-05 14:24:16,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:16,038 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:16,038 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:16,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 362 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4331 [2021-06-05 14:24:16,238 INFO L430 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:16,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1101666024, now seen corresponding path program 216 times [2021-06-05 14:24:16,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:16,239 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289735526] [2021-06-05 14:24:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:16,429 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:16,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289735526] [2021-06-05 14:24:16,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289735526] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:16,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227658504] [2021-06-05 14:24:16,429 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 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:16,457 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:24:16,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:16,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:16,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:16,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:16,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:16,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 25 treesize of output 19 [2021-06-05 14:24:16,584 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:16,587 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:16,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:24:16,587 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:16,620 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:16,622 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:24:16,622 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:84 [2021-06-05 14:24:16,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:16,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:16,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:24:16,700 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:16,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:16,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 27 treesize of output 21 [2021-06-05 14:24:16,704 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:16,789 INFO L628 ElimStorePlain]: treesize reduction 106, result has 41.4 percent of original size [2021-06-05 14:24:16,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:16,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:24:16,793 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:16,815 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:16,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 7 treesize of output 5 [2021-06-05 14:24:16,818 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:16,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:16,839 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:16,840 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:16,840 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:193, output treesize:76 [2021-06-05 14:24:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:16,922 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227658504] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:16,922 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:16,922 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:24:16,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589196290] [2021-06-05 14:24:16,923 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:24:16,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:16,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:24:16,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:24:16,923 INFO L87 Difference]: Start difference. First operand 884 states and 3306 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:24:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:17,162 INFO L93 Difference]: Finished difference Result 920 states and 3397 transitions. [2021-06-05 14:24:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:17,162 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:24:17,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:17,164 INFO L225 Difference]: With dead ends: 920 [2021-06-05 14:24:17,164 INFO L226 Difference]: Without dead ends: 915 [2021-06-05 14:24:17,164 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 388.5ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:24:17,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-06-05 14:24:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 881. [2021-06-05 14:24:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.743181818181818) internal successors, (3294), 880 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3294 transitions. [2021-06-05 14:24:17,173 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3294 transitions. Word has length 18 [2021-06-05 14:24:17,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:17,173 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3294 transitions. [2021-06-05 14:24:17,173 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:24:17,173 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3294 transitions. [2021-06-05 14:24:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:17,174 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:17,174 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:17,375 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 363 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4353 [2021-06-05 14:24:17,375 INFO L430 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:17,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:17,375 INFO L82 PathProgramCache]: Analyzing trace with hash 227925344, now seen corresponding path program 217 times [2021-06-05 14:24:17,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:17,375 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762585763] [2021-06-05 14:24:17,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:17,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:17,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762585763] [2021-06-05 14:24:17,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762585763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:17,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474512664] [2021-06-05 14:24:17,607 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 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:17,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 14:24:17,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:17,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 25 treesize of output 19 [2021-06-05 14:24:17,740 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:17,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 15 treesize of output 11 [2021-06-05 14:24:17,743 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:17,758 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:17,759 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:17,759 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 14:24:17,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:17,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:17,808 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:17,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:17,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 35 treesize of output 27 [2021-06-05 14:24:17,811 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:17,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:17,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 15 treesize of output 11 [2021-06-05 14:24:17,814 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:17,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 25 treesize of output 19 [2021-06-05 14:24:17,817 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:17,854 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 14:24:17,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:24:17,857 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:17,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:17,871 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:17,871 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:24:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:17,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474512664] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:17,931 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:17,931 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:24:17,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301721999] [2021-06-05 14:24:17,931 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:24:17,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:17,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:24:17,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:24:17,931 INFO L87 Difference]: Start difference. First operand 881 states and 3294 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:18,589 INFO L93 Difference]: Finished difference Result 915 states and 3387 transitions. [2021-06-05 14:24:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:18,589 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:24:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:18,590 INFO L225 Difference]: With dead ends: 915 [2021-06-05 14:24:18,590 INFO L226 Difference]: Without dead ends: 910 [2021-06-05 14:24:18,591 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 710.3ms TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:24:18,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2021-06-05 14:24:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 878. [2021-06-05 14:24:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 14:24:18,599 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 14:24:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:18,600 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 14:24:18,600 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 14:24:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:18,601 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:18,601 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:18,801 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 364 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4372 [2021-06-05 14:24:18,801 INFO L430 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:18,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash 776841754, now seen corresponding path program 218 times [2021-06-05 14:24:18,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:18,801 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239869579] [2021-06-05 14:24:18,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:19,087 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:19,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239869579] [2021-06-05 14:24:19,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239869579] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:19,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328345093] [2021-06-05 14:24:19,087 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 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:19,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:24:19,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:19,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:19,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:19,201 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:19,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:19,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:19,204 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:19,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 26 treesize of output 20 [2021-06-05 14:24:19,205 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:19,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:19,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:19,209 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:19,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:24:19,212 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:19,257 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:19,258 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:19,258 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 14:24:19,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 17 treesize of output 13 [2021-06-05 14:24:19,421 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:19,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:24:19,424 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:19,436 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 14:24:19,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:24:19,439 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:19,444 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:19,445 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:19,445 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 14:24:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:19,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328345093] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:19,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:19,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:24:19,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164478776] [2021-06-05 14:24:19,472 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:24:19,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:19,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:24:19,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:24:19,473 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:19,872 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-06-05 14:24:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:20,224 INFO L93 Difference]: Finished difference Result 915 states and 3378 transitions. [2021-06-05 14:24:20,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:20,225 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:24:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:20,226 INFO L225 Difference]: With dead ends: 915 [2021-06-05 14:24:20,226 INFO L226 Difference]: Without dead ends: 910 [2021-06-05 14:24:20,226 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 908.4ms TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:24:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2021-06-05 14:24:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 884. [2021-06-05 14:24:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.7474518686296716) internal successors, (3309), 883 states have internal predecessors, (3309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3309 transitions. [2021-06-05 14:24:20,235 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3309 transitions. Word has length 18 [2021-06-05 14:24:20,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:20,235 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3309 transitions. [2021-06-05 14:24:20,235 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3309 transitions. [2021-06-05 14:24:20,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:20,236 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:20,236 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:20,437 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4382,365 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:20,437 INFO L430 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:20,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:20,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1163146992, now seen corresponding path program 219 times [2021-06-05 14:24:20,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:20,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191211391] [2021-06-05 14:24:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:20,726 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:20,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191211391] [2021-06-05 14:24:20,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191211391] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:20,726 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191455905] [2021-06-05 14:24:20,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 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:20,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:24:20,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:20,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:20,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:20,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:20,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:20,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 16 treesize of output 12 [2021-06-05 14:24:20,875 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:20,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:20,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:20,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 26 treesize of output 20 [2021-06-05 14:24:20,879 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:20,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:20,882 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:20,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 25 treesize of output 19 [2021-06-05 14:24:20,883 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:20,886 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:20,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:24:20,887 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:20,933 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:20,936 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:24:20,936 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:167, output treesize:135 [2021-06-05 14:24:21,099 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 3=[array_4]} [2021-06-05 14:24:21,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:21,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:24:21,103 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:21,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:21,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 25 treesize of output 19 [2021-06-05 14:24:21,107 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:21,110 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:21,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:24:21,111 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:21,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 25 treesize of output 19 [2021-06-05 14:24:21,114 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:21,163 INFO L628 ElimStorePlain]: treesize reduction 82, result has 40.1 percent of original size [2021-06-05 14:24:21,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:21,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:24:21,167 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:21,186 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:21,187 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:21,187 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 14:24:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:21,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191455905] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:21,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:21,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:24:21,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750154224] [2021-06-05 14:24:21,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:24:21,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:24:21,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:24:21,252 INFO L87 Difference]: Start difference. First operand 884 states and 3309 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:21,650 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2021-06-05 14:24:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:21,932 INFO L93 Difference]: Finished difference Result 931 states and 3434 transitions. [2021-06-05 14:24:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:21,932 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:21,934 INFO L225 Difference]: With dead ends: 931 [2021-06-05 14:24:21,934 INFO L226 Difference]: Without dead ends: 926 [2021-06-05 14:24:21,934 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 823.9ms TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:24:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2021-06-05 14:24:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 878. [2021-06-05 14:24:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.7457240592930443) internal successors, (3285), 877 states have internal predecessors, (3285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 3285 transitions. [2021-06-05 14:24:21,943 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 3285 transitions. Word has length 18 [2021-06-05 14:24:21,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:21,943 INFO L482 AbstractCegarLoop]: Abstraction has 878 states and 3285 transitions. [2021-06-05 14:24:21,943 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 3285 transitions. [2021-06-05 14:24:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:21,944 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:21,944 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:22,144 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 366 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4396 [2021-06-05 14:24:22,145 INFO L430 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:22,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:22,145 INFO L82 PathProgramCache]: Analyzing trace with hash 983934736, now seen corresponding path program 220 times [2021-06-05 14:24:22,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:22,145 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907888995] [2021-06-05 14:24:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:22,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:22,401 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:22,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907888995] [2021-06-05 14:24:22,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907888995] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:22,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417463755] [2021-06-05 14:24:22,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 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:22,427 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:24:22,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:22,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:24:22,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:22,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,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 25 treesize of output 19 [2021-06-05 14:24:22,504 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:22,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:22,508 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:22,511 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,512 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,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:24:22,513 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:22,515 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,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 26 treesize of output 20 [2021-06-05 14:24:22,516 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:22,576 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:22,578 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:22,578 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:217, output treesize:185 [2021-06-05 14:24:22,815 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 14:24:22,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,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 25 treesize of output 19 [2021-06-05 14:24:22,820 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:22,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,824 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,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 25 treesize of output 19 [2021-06-05 14:24:22,825 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:22,828 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,829 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,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 35 treesize of output 27 [2021-06-05 14:24:22,830 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:22,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,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 15 treesize of output 11 [2021-06-05 14:24:22,834 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:22,904 INFO L628 ElimStorePlain]: treesize reduction 108, result has 45.2 percent of original size [2021-06-05 14:24:22,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:22,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:24:22,908 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:22,939 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:22,940 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:22,940 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:231, output treesize:90 [2021-06-05 14:24:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:23,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417463755] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:23,121 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:23,121 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 14:24:23,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132067127] [2021-06-05 14:24:23,121 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:24:23,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:23,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:24:23,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:24:23,121 INFO L87 Difference]: Start difference. First operand 878 states and 3285 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:24:23,371 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2021-06-05 14:24:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:23,554 INFO L93 Difference]: Finished difference Result 919 states and 3396 transitions. [2021-06-05 14:24:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:23,554 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:24:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:23,556 INFO L225 Difference]: With dead ends: 919 [2021-06-05 14:24:23,556 INFO L226 Difference]: Without dead ends: 906 [2021-06-05 14:24:23,556 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 819.7ms TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:24:23,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-06-05 14:24:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 880. [2021-06-05 14:24:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 3.7474402730375425) internal successors, (3294), 879 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3294 transitions. [2021-06-05 14:24:23,566 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 3294 transitions. Word has length 18 [2021-06-05 14:24:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:23,566 INFO L482 AbstractCegarLoop]: Abstraction has 880 states and 3294 transitions. [2021-06-05 14:24:23,566 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:24:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 3294 transitions. [2021-06-05 14:24:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:23,567 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:23,567 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:23,768 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4425,367 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:23,768 INFO L430 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:23,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:23,768 INFO L82 PathProgramCache]: Analyzing trace with hash 333942614, now seen corresponding path program 221 times [2021-06-05 14:24:23,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:23,768 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147201049] [2021-06-05 14:24:23,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:24,189 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2021-06-05 14:24:24,310 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-06-05 14:24:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:24,608 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:24,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147201049] [2021-06-05 14:24:24,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147201049] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:24,608 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498515372] [2021-06-05 14:24:24,608 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:24,635 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:24:24,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:24,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:24:24,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:24,751 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:24,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 16 treesize of output 12 [2021-06-05 14:24:24,752 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:24,754 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:24,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:24:24,755 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:24,758 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:24,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 25 treesize of output 19 [2021-06-05 14:24:24,759 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:24,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 15 treesize of output 11 [2021-06-05 14:24:24,762 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:24,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:24,808 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:24,808 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 14:24:24,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 27 treesize of output 21 [2021-06-05 14:24:24,980 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:24,986 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:24,986 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:24,986 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:24,986 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:24:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:25,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498515372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:25,020 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:25,020 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:24:25,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424857795] [2021-06-05 14:24:25,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:24:25,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:25,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:24:25,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:24:25,020 INFO L87 Difference]: Start difference. First operand 880 states and 3294 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:25,610 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2021-06-05 14:24:25,855 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2021-06-05 14:24:26,147 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 61 [2021-06-05 14:24:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:26,237 INFO L93 Difference]: Finished difference Result 916 states and 3382 transitions. [2021-06-05 14:24:26,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:26,237 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:24:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:26,239 INFO L225 Difference]: With dead ends: 916 [2021-06-05 14:24:26,239 INFO L226 Difference]: Without dead ends: 911 [2021-06-05 14:24:26,239 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1858.7ms TimeCoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:24:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2021-06-05 14:24:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 884. [2021-06-05 14:24:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.7497168742921856) internal successors, (3311), 883 states have internal predecessors, (3311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3311 transitions. [2021-06-05 14:24:26,248 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3311 transitions. Word has length 18 [2021-06-05 14:24:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:26,248 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3311 transitions. [2021-06-05 14:24:26,248 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3311 transitions. [2021-06-05 14:24:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:26,249 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:26,249 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:26,450 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 368 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4439 [2021-06-05 14:24:26,450 INFO L430 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:26,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1606046132, now seen corresponding path program 222 times [2021-06-05 14:24:26,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:26,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557058065] [2021-06-05 14:24:26,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:26,932 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:26,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557058065] [2021-06-05 14:24:26,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557058065] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:26,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992484012] [2021-06-05 14:24:26,932 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 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:26,958 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:24:26,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:26,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:26,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:27,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:27,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:27,063 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:27,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:27,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:24:27,066 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:27,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:27,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 25 treesize of output 19 [2021-06-05 14:24:27,070 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:27,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:24:27,073 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:27,118 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:27,119 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:27,119 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 14:24:27,247 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_967, array_2], 1=[v_prenex_968, array_4]} [2021-06-05 14:24:27,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:24:27,250 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:27,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:24:27,253 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:27,295 INFO L628 ElimStorePlain]: treesize reduction 83, result has 39.4 percent of original size [2021-06-05 14:24:27,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:24:27,297 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:27,312 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:27,312 INFO L518 ElimStorePlain]: Eliminatee v_prenex_968 vanished before elimination [2021-06-05 14:24:27,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:24:27,315 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:27,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:27,329 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:27,329 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 14:24:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:27,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992484012] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:27,395 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:27,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:24:27,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852129203] [2021-06-05 14:24:27,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:24:27,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:27,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:24:27,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:24:27,396 INFO L87 Difference]: Start difference. First operand 884 states and 3311 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:27,882 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2021-06-05 14:24:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:28,209 INFO L93 Difference]: Finished difference Result 939 states and 3443 transitions. [2021-06-05 14:24:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:28,209 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:24:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:28,211 INFO L225 Difference]: With dead ends: 939 [2021-06-05 14:24:28,211 INFO L226 Difference]: Without dead ends: 934 [2021-06-05 14:24:28,211 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1110.3ms TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:24:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2021-06-05 14:24:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 880. [2021-06-05 14:24:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 3.7474402730375425) internal successors, (3294), 879 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3294 transitions. [2021-06-05 14:24:28,220 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 3294 transitions. Word has length 18 [2021-06-05 14:24:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:28,221 INFO L482 AbstractCegarLoop]: Abstraction has 880 states and 3294 transitions. [2021-06-05 14:24:28,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 3294 transitions. [2021-06-05 14:24:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:28,222 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:28,222 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:28,436 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 369 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4453 [2021-06-05 14:24:28,437 INFO L430 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:28,437 INFO L82 PathProgramCache]: Analyzing trace with hash -407491060, now seen corresponding path program 223 times [2021-06-05 14:24:28,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:28,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558837686] [2021-06-05 14:24:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:28,949 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 14:24:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:29,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:29,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558837686] [2021-06-05 14:24:29,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558837686] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:29,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420361495] [2021-06-05 14:24:29,298 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 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:29,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:24:29,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:29,439 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:29,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 16 treesize of output 12 [2021-06-05 14:24:29,440 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:29,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:29,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 26 treesize of output 20 [2021-06-05 14:24:29,444 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:29,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:29,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:29,447 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:29,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:24:29,450 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:29,495 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:29,497 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:29,497 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 14:24:29,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:29,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 27 treesize of output 21 [2021-06-05 14:24:29,704 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:29,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:29,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:29,708 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:29,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:29,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:24:29,711 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:29,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:24:29,714 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:29,752 INFO L628 ElimStorePlain]: treesize reduction 71, result has 39.3 percent of original size [2021-06-05 14:24:29,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 11 treesize of output 7 [2021-06-05 14:24:29,768 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:29,787 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:29,788 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:29,788 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 14:24:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:29,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420361495] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:29,869 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:29,869 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 14:24:29,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67235883] [2021-06-05 14:24:29,869 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 14:24:29,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:29,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 14:24:29,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:24:29,869 INFO L87 Difference]: Start difference. First operand 880 states and 3294 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:30,458 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2021-06-05 14:24:30,753 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 69 [2021-06-05 14:24:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:31,002 INFO L93 Difference]: Finished difference Result 913 states and 3367 transitions. [2021-06-05 14:24:31,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:24:31,002 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:24:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:31,003 INFO L225 Difference]: With dead ends: 913 [2021-06-05 14:24:31,003 INFO L226 Difference]: Without dead ends: 900 [2021-06-05 14:24:31,003 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1825.7ms TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:24:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-06-05 14:24:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 881. [2021-06-05 14:24:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7443181818181817) internal successors, (3295), 880 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3295 transitions. [2021-06-05 14:24:31,012 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3295 transitions. Word has length 18 [2021-06-05 14:24:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:31,012 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3295 transitions. [2021-06-05 14:24:31,013 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3295 transitions. [2021-06-05 14:24:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:31,014 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:31,014 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:31,214 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4468,370 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:31,214 INFO L430 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:31,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:31,214 INFO L82 PathProgramCache]: Analyzing trace with hash -913837326, now seen corresponding path program 224 times [2021-06-05 14:24:31,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:31,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046469430] [2021-06-05 14:24:31,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:31,748 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:31,748 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046469430] [2021-06-05 14:24:31,748 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046469430] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:31,748 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338915451] [2021-06-05 14:24:31,748 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 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:31,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:24:31,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:31,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:31,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:31,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:31,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 16 treesize of output 12 [2021-06-05 14:24:31,922 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:31,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:31,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 15 treesize of output 11 [2021-06-05 14:24:31,926 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:31,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:31,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:24:31,929 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:31,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:31,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 16 treesize of output 12 [2021-06-05 14:24:31,933 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:31,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:31,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 15 treesize of output 11 [2021-06-05 14:24:31,936 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:31,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:31,940 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:31,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:31,996 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:24:31,997 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:139 [2021-06-05 14:24:32,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 27 treesize of output 21 [2021-06-05 14:24:32,140 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:32,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:32,147 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:32,148 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:32,148 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:24:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:32,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338915451] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:32,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:32,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:24:32,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822342892] [2021-06-05 14:24:32,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:24:32,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:32,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:24:32,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:24:32,184 INFO L87 Difference]: Start difference. First operand 881 states and 3295 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:32,868 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-06-05 14:24:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:32,952 INFO L93 Difference]: Finished difference Result 909 states and 3358 transitions. [2021-06-05 14:24:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:32,952 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:24:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:32,954 INFO L225 Difference]: With dead ends: 909 [2021-06-05 14:24:32,954 INFO L226 Difference]: Without dead ends: 904 [2021-06-05 14:24:32,954 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1230.8ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:24:32,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2021-06-05 14:24:32,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 881. [2021-06-05 14:24:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 3.7443181818181817) internal successors, (3295), 880 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 3295 transitions. [2021-06-05 14:24:32,963 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 3295 transitions. Word has length 18 [2021-06-05 14:24:32,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:32,963 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 3295 transitions. [2021-06-05 14:24:32,963 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 3295 transitions. [2021-06-05 14:24:32,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:32,964 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:32,964 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:33,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 371 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4482 [2021-06-05 14:24:33,164 INFO L430 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash -344762684, now seen corresponding path program 225 times [2021-06-05 14:24:33,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:33,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006150946] [2021-06-05 14:24:33,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:33,878 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:33,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006150946] [2021-06-05 14:24:33,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006150946] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:33,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635741611] [2021-06-05 14:24:33,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:33,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:24:33,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:33,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 14:24:33,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:34,091 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:24:34,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 14:24:34,092 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:34,099 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 14:24:34,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 36 [2021-06-05 14:24:34,100 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:34,105 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:24:34,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 14:24:34,106 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:34,113 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 14:24:34,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 14:24:34,114 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:34,163 INFO L628 ElimStorePlain]: treesize reduction 33, result has 70.3 percent of original size [2021-06-05 14:24:34,164 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:24:34,164 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:179, output treesize:74 [2021-06-05 14:24:34,235 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:34,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 15 treesize of output 11 [2021-06-05 14:24:34,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:34,238 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:34,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 15 treesize of output 11 [2021-06-05 14:24:34,239 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:34,242 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:34,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:24:34,243 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:34,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:34,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:24:34,246 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:34,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:34,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 25 treesize of output 19 [2021-06-05 14:24:34,250 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:34,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:34,253 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:34,315 INFO L628 ElimStorePlain]: treesize reduction 101, result has 38.0 percent of original size [2021-06-05 14:24:34,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 11 treesize of output 7 [2021-06-05 14:24:34,319 INFO L550 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:34,354 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:34,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:24:34,355 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:213, output treesize:54 [2021-06-05 14:24:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:34,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635741611] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:34,458 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:34,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:24:34,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279077320] [2021-06-05 14:24:34,458 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:24:34,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:34,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:24:34,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:24:34,459 INFO L87 Difference]: Start difference. First operand 881 states and 3295 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:35,078 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2021-06-05 14:24:35,315 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2021-06-05 14:24:35,657 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2021-06-05 14:24:35,845 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2021-06-05 14:24:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:35,921 INFO L93 Difference]: Finished difference Result 923 states and 3410 transitions. [2021-06-05 14:24:35,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:24:35,922 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:24:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:35,923 INFO L225 Difference]: With dead ends: 923 [2021-06-05 14:24:35,923 INFO L226 Difference]: Without dead ends: 918 [2021-06-05 14:24:35,923 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1914.4ms TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:24:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2021-06-05 14:24:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 879. [2021-06-05 14:24:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 3.7437357630979498) internal successors, (3287), 878 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3287 transitions. [2021-06-05 14:24:35,932 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3287 transitions. Word has length 18 [2021-06-05 14:24:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:35,932 INFO L482 AbstractCegarLoop]: Abstraction has 879 states and 3287 transitions. [2021-06-05 14:24:35,932 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3287 transitions. [2021-06-05 14:24:35,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:35,934 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:35,934 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:36,134 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 372 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4496 [2021-06-05 14:24:36,134 INFO L430 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:36,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1113995740, now seen corresponding path program 226 times [2021-06-05 14:24:36,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:36,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233391998] [2021-06-05 14:24:36,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:36,417 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:36,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233391998] [2021-06-05 14:24:36,417 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233391998] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:36,417 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799726734] [2021-06-05 14:24:36,417 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 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:36,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:24:36,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:36,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:24:36,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:36,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:36,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:36,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:36,529 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:36,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:36,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:36,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:24:36,533 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:36,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:36,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:36,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 25 treesize of output 19 [2021-06-05 14:24:36,537 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:36,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:36,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:24:36,540 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:36,579 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:36,580 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:36,580 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:105 [2021-06-05 14:24:36,832 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 3=[array_4]} [2021-06-05 14:24:36,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:36,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:24:36,836 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:36,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:36,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 17 treesize of output 13 [2021-06-05 14:24:36,840 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:36,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:36,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 25 treesize of output 19 [2021-06-05 14:24:36,844 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:36,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 27 treesize of output 21 [2021-06-05 14:24:36,847 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:36,914 INFO L628 ElimStorePlain]: treesize reduction 85, result has 40.6 percent of original size [2021-06-05 14:24:36,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:36,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:24:36,928 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:36,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:36,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:36,949 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:173, output treesize:38 [2021-06-05 14:24:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:37,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799726734] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:37,017 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:37,017 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:24:37,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307836998] [2021-06-05 14:24:37,018 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:24:37,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:37,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:24:37,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:24:37,018 INFO L87 Difference]: Start difference. First operand 879 states and 3287 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:24:37,338 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 51 [2021-06-05 14:24:37,657 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2021-06-05 14:24:37,837 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2021-06-05 14:24:38,026 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2021-06-05 14:24:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:38,080 INFO L93 Difference]: Finished difference Result 1188 states and 4247 transitions. [2021-06-05 14:24:38,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:38,080 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:24:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:38,082 INFO L225 Difference]: With dead ends: 1188 [2021-06-05 14:24:38,082 INFO L226 Difference]: Without dead ends: 1169 [2021-06-05 14:24:38,082 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1228.5ms TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:24:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-06-05 14:24:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 884. [2021-06-05 14:24:38,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.739524348810872) internal successors, (3302), 883 states have internal predecessors, (3302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 3302 transitions. [2021-06-05 14:24:38,093 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 3302 transitions. Word has length 18 [2021-06-05 14:24:38,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:38,093 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 3302 transitions. [2021-06-05 14:24:38,093 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:24:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 3302 transitions. [2021-06-05 14:24:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:38,094 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:38,094 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:38,295 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4512,373 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:38,295 INFO L430 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:38,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:38,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1970491686, now seen corresponding path program 227 times [2021-06-05 14:24:38,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:38,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587141908] [2021-06-05 14:24:38,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:38,585 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:38,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587141908] [2021-06-05 14:24:38,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587141908] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:38,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664592855] [2021-06-05 14:24:38,586 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 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:38,612 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:24:38,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:38,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:38,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:38,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:38,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:38,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:24:38,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:38,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:38,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:38,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:24:38,701 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:38,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:38,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:38,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:38,704 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:38,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:38,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:38,708 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:38,746 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:38,747 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:38,747 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:147, output treesize:115 [2021-06-05 14:24:38,977 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_974], 1=[array_4, v_prenex_975]} [2021-06-05 14:24:38,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 25 treesize of output 19 [2021-06-05 14:24:38,980 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:38,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 15 treesize of output 11 [2021-06-05 14:24:38,983 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:39,017 INFO L628 ElimStorePlain]: treesize reduction 65, result has 43.0 percent of original size [2021-06-05 14:24:39,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 27 treesize of output 21 [2021-06-05 14:24:39,019 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:39,030 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:39,030 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:39,031 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:39,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:24:39,033 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:39,043 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:39,044 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:39,044 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:128, output treesize:16 [2021-06-05 14:24:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:39,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664592855] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:39,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:39,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:24:39,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473328522] [2021-06-05 14:24:39,071 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:24:39,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:39,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:24:39,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:24:39,071 INFO L87 Difference]: Start difference. First operand 884 states and 3302 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:39,360 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2021-06-05 14:24:39,830 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2021-06-05 14:24:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:40,010 INFO L93 Difference]: Finished difference Result 1157 states and 4179 transitions. [2021-06-05 14:24:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:40,010 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:40,012 INFO L225 Difference]: With dead ends: 1157 [2021-06-05 14:24:40,012 INFO L226 Difference]: Without dead ends: 1152 [2021-06-05 14:24:40,012 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1068.7ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:24:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2021-06-05 14:24:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 887. [2021-06-05 14:24:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 886 states have (on average 3.740406320541761) internal successors, (3314), 886 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 3314 transitions. [2021-06-05 14:24:40,023 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 3314 transitions. Word has length 18 [2021-06-05 14:24:40,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:40,024 INFO L482 AbstractCegarLoop]: Abstraction has 887 states and 3314 transitions. [2021-06-05 14:24:40,024 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 3314 transitions. [2021-06-05 14:24:40,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:40,025 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:40,025 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:40,225 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 374 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4528 [2021-06-05 14:24:40,225 INFO L430 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:40,225 INFO L82 PathProgramCache]: Analyzing trace with hash 30502940, now seen corresponding path program 228 times [2021-06-05 14:24:40,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:40,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068567724] [2021-06-05 14:24:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:40,502 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:40,502 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068567724] [2021-06-05 14:24:40,502 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068567724] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:40,502 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821934363] [2021-06-05 14:24:40,502 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 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:40,528 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:24:40,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:40,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:40,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:40,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:40,613 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:40,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:24:40,614 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:40,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:40,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:40,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:24:40,617 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:40,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:40,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:40,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 25 treesize of output 19 [2021-06-05 14:24:40,621 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:40,623 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:40,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 16 treesize of output 12 [2021-06-05 14:24:40,624 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:40,663 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:40,664 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:40,664 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:147, output treesize:115 [2021-06-05 14:24:40,824 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_976, array_2], 1=[v_prenex_977, array_4]} [2021-06-05 14:24:40,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 35 treesize of output 27 [2021-06-05 14:24:40,827 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:40,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 25 treesize of output 19 [2021-06-05 14:24:40,830 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:40,876 INFO L628 ElimStorePlain]: treesize reduction 84, result has 43.6 percent of original size [2021-06-05 14:24:40,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 7 treesize of output 5 [2021-06-05 14:24:40,879 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:40,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:40,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:40,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:24:40,909 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:40,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:40,926 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:40,926 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:40,926 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:169, output treesize:44 [2021-06-05 14:24:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:40,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821934363] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:40,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:40,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:24:40,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064678677] [2021-06-05 14:24:40,997 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:24:40,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:40,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:24:40,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:24:40,998 INFO L87 Difference]: Start difference. First operand 887 states and 3314 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:41,283 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2021-06-05 14:24:41,840 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2021-06-05 14:24:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:41,897 INFO L93 Difference]: Finished difference Result 1178 states and 4230 transitions. [2021-06-05 14:24:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:41,898 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:41,899 INFO L225 Difference]: With dead ends: 1178 [2021-06-05 14:24:41,899 INFO L226 Difference]: Without dead ends: 1173 [2021-06-05 14:24:41,899 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1041.5ms TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:24:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2021-06-05 14:24:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 879. [2021-06-05 14:24:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 3.7437357630979498) internal successors, (3287), 878 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 3287 transitions. [2021-06-05 14:24:41,910 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 3287 transitions. Word has length 18 [2021-06-05 14:24:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:41,910 INFO L482 AbstractCegarLoop]: Abstraction has 879 states and 3287 transitions. [2021-06-05 14:24:41,910 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 3287 transitions. [2021-06-05 14:24:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:41,911 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:41,911 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:42,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4547,375 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:42,112 INFO L430 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1815060318, now seen corresponding path program 229 times [2021-06-05 14:24:42,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:42,112 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527899110] [2021-06-05 14:24:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:24:42,156 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:42,156 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527899110] [2021-06-05 14:24:42,156 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527899110] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:42,156 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693152029] [2021-06-05 14:24:42,156 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 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:42,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 14:24:42,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:42,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 7 treesize of output 5 [2021-06-05 14:24:42,208 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:42,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:24:42,210 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:42,222 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:42,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 10 treesize of output 6 [2021-06-05 14:24:42,225 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:42,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:42,237 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:42,237 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 14:24:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:24:42,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693152029] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:42,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:42,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2021-06-05 14:24:42,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097872083] [2021-06-05 14:24:42,301 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 14:24:42,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:42,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 14:24:42,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 14:24:42,301 INFO L87 Difference]: Start difference. First operand 879 states and 3287 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:24:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:42,868 INFO L93 Difference]: Finished difference Result 1446 states and 4960 transitions. [2021-06-05 14:24:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:24:42,869 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:24:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:42,870 INFO L225 Difference]: With dead ends: 1446 [2021-06-05 14:24:42,870 INFO L226 Difference]: Without dead ends: 1326 [2021-06-05 14:24:42,871 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 483.0ms TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:24:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2021-06-05 14:24:42,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 894. [2021-06-05 14:24:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 3.753639417693169) internal successors, (3352), 893 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 3352 transitions. [2021-06-05 14:24:42,882 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 3352 transitions. Word has length 18 [2021-06-05 14:24:42,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:42,882 INFO L482 AbstractCegarLoop]: Abstraction has 894 states and 3352 transitions. [2021-06-05 14:24:42,882 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:24:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 3352 transitions. [2021-06-05 14:24:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:42,883 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:42,883 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:43,083 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 376 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4562 [2021-06-05 14:24:43,084 INFO L430 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash -395611674, now seen corresponding path program 230 times [2021-06-05 14:24:43,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:43,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11928257] [2021-06-05 14:24:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:43,403 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 55 [2021-06-05 14:24:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:43,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:43,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11928257] [2021-06-05 14:24:43,795 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11928257] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:43,795 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004520705] [2021-06-05 14:24:43,795 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 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:43,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:24:43,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:43,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:43,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:43,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:43,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 15 treesize of output 11 [2021-06-05 14:24:43,921 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:43,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:43,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 26 treesize of output 20 [2021-06-05 14:24:43,925 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:43,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:43,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:43,928 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:43,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 16 treesize of output 12 [2021-06-05 14:24:43,931 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:43,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:43,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:43,964 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 14:24:44,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 27 treesize of output 21 [2021-06-05 14:24:44,151 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:44,157 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:44,157 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:44,157 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:44,157 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:24:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:44,188 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004520705] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:44,188 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:44,188 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:24:44,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374892554] [2021-06-05 14:24:44,189 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:24:44,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:44,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:24:44,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:24:44,189 INFO L87 Difference]: Start difference. First operand 894 states and 3352 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:44,663 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2021-06-05 14:24:44,908 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2021-06-05 14:24:45,119 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2021-06-05 14:24:45,368 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2021-06-05 14:24:45,633 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 80 [2021-06-05 14:24:46,109 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-06-05 14:24:46,332 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 63 [2021-06-05 14:24:46,672 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2021-06-05 14:24:46,854 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 59 [2021-06-05 14:24:47,094 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 67 [2021-06-05 14:24:47,303 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2021-06-05 14:24:47,518 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2021-06-05 14:24:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:47,559 INFO L93 Difference]: Finished difference Result 1366 states and 4753 transitions. [2021-06-05 14:24:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 14:24:47,559 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:24:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:47,561 INFO L225 Difference]: With dead ends: 1366 [2021-06-05 14:24:47,561 INFO L226 Difference]: Without dead ends: 1352 [2021-06-05 14:24:47,562 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 3549.9ms TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 14:24:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-06-05 14:24:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 902. [2021-06-05 14:24:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 14:24:47,574 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 14:24:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:47,574 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 14:24:47,574 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 14:24:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:47,575 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:47,575 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:47,775 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 377 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4570 [2021-06-05 14:24:47,775 INFO L430 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2075094054, now seen corresponding path program 231 times [2021-06-05 14:24:47,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:47,776 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896392526] [2021-06-05 14:24:47,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:48,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:48,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:48,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896392526] [2021-06-05 14:24:48,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896392526] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:48,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588166457] [2021-06-05 14:24:48,161 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 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:48,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:24:48,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:48,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:48,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:48,278 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:48,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 15 treesize of output 11 [2021-06-05 14:24:48,279 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:48,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:48,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:24:48,282 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:48,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:48,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:48,285 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:48,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 16 treesize of output 12 [2021-06-05 14:24:48,288 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:48,321 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:48,322 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:48,322 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 14:24:48,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 27 treesize of output 21 [2021-06-05 14:24:48,522 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:48,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:48,528 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:48,528 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:48,528 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:24:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:48,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588166457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:48,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:48,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:24:48,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282425562] [2021-06-05 14:24:48,557 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:24:48,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:48,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:24:48,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:24:48,557 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:48,974 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2021-06-05 14:24:49,260 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2021-06-05 14:24:49,545 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 74 [2021-06-05 14:24:49,771 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2021-06-05 14:24:50,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:50,010 INFO L93 Difference]: Finished difference Result 1134 states and 4071 transitions. [2021-06-05 14:24:50,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:24:50,011 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:24:50,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:50,012 INFO L225 Difference]: With dead ends: 1134 [2021-06-05 14:24:50,012 INFO L226 Difference]: Without dead ends: 1129 [2021-06-05 14:24:50,012 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1646.2ms TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:24:50,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-06-05 14:24:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 902. [2021-06-05 14:24:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 14:24:50,023 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 14:24:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:50,023 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 14:24:50,023 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 14:24:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:50,024 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:50,025 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:50,225 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 378 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4581 [2021-06-05 14:24:50,225 INFO L430 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:50,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1216089874, now seen corresponding path program 232 times [2021-06-05 14:24:50,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:50,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688496762] [2021-06-05 14:24:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:50,570 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2021-06-05 14:24:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:50,650 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:50,650 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688496762] [2021-06-05 14:24:50,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688496762] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:50,650 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020216432] [2021-06-05 14:24:50,650 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 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:50,682 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:24:50,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:50,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:24:50,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:50,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:50,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:50,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 26 treesize of output 20 [2021-06-05 14:24:50,789 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:50,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:50,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:50,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 15 treesize of output 11 [2021-06-05 14:24:50,794 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:50,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:50,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:50,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 25 treesize of output 19 [2021-06-05 14:24:50,799 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:50,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:50,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:50,803 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:50,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:50,852 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:50,852 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:147, output treesize:111 [2021-06-05 14:24:51,135 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_4]} [2021-06-05 14:24:51,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:51,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 17 treesize of output 13 [2021-06-05 14:24:51,139 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:51,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:51,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 25 treesize of output 19 [2021-06-05 14:24:51,143 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:51,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:51,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:24:51,147 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:51,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:24:51,151 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:51,200 INFO L628 ElimStorePlain]: treesize reduction 83, result has 43.5 percent of original size [2021-06-05 14:24:51,202 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:51,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 22 treesize of output 14 [2021-06-05 14:24:51,203 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:51,223 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:51,224 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:51,224 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:173, output treesize:41 [2021-06-05 14:24:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:51,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020216432] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:51,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:51,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 14:24:51,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970389173] [2021-06-05 14:24:51,301 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:24:51,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:51,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:24:51,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:24:51,301 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:24:51,614 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2021-06-05 14:24:51,905 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2021-06-05 14:24:52,207 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2021-06-05 14:24:52,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:52,364 INFO L93 Difference]: Finished difference Result 1112 states and 4026 transitions. [2021-06-05 14:24:52,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:52,364 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:24:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:52,366 INFO L225 Difference]: With dead ends: 1112 [2021-06-05 14:24:52,366 INFO L226 Difference]: Without dead ends: 1099 [2021-06-05 14:24:52,366 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1415.0ms TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:24:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2021-06-05 14:24:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 905. [2021-06-05 14:24:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 904 states have (on average 3.7488938053097347) internal successors, (3389), 904 states have internal predecessors, (3389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 3389 transitions. [2021-06-05 14:24:52,377 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 3389 transitions. Word has length 18 [2021-06-05 14:24:52,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:52,377 INFO L482 AbstractCegarLoop]: Abstraction has 905 states and 3389 transitions. [2021-06-05 14:24:52,377 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:24:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 3389 transitions. [2021-06-05 14:24:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:52,378 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:52,378 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:52,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4594,379 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:52,579 INFO L430 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:52,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:52,579 INFO L82 PathProgramCache]: Analyzing trace with hash -723898872, now seen corresponding path program 233 times [2021-06-05 14:24:52,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:52,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795727488] [2021-06-05 14:24:52,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:52,868 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:52,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795727488] [2021-06-05 14:24:52,868 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795727488] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:52,868 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024604587] [2021-06-05 14:24:52,868 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 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:52,894 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:24:52,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:52,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:52,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:52,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:52,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:52,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:52,982 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:52,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:52,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:52,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 26 treesize of output 20 [2021-06-05 14:24:52,986 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:52,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:52,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:52,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 25 treesize of output 19 [2021-06-05 14:24:52,989 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:52,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:52,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:24:52,992 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:53,030 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:53,031 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:53,031 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 14:24:53,221 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_981], 1=[array_4, v_prenex_982]} [2021-06-05 14:24:53,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 35 treesize of output 27 [2021-06-05 14:24:53,224 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:53,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 25 treesize of output 19 [2021-06-05 14:24:53,227 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:53,274 INFO L628 ElimStorePlain]: treesize reduction 91, result has 38.1 percent of original size [2021-06-05 14:24:53,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:24:53,277 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:53,294 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:53,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:53,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 11 treesize of output 7 [2021-06-05 14:24:53,298 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:53,314 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:53,315 INFO L518 ElimStorePlain]: Eliminatee v_prenex_982 vanished before elimination [2021-06-05 14:24:53,315 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:53,315 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:163, output treesize:41 [2021-06-05 14:24:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:53,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024604587] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:53,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:53,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:24:53,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344701934] [2021-06-05 14:24:53,387 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:24:53,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:53,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:24:53,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:24:53,388 INFO L87 Difference]: Start difference. First operand 905 states and 3389 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:53,726 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2021-06-05 14:24:53,978 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 59 [2021-06-05 14:24:54,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:54,454 INFO L93 Difference]: Finished difference Result 1129 states and 4070 transitions. [2021-06-05 14:24:54,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:54,455 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:54,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:54,456 INFO L225 Difference]: With dead ends: 1129 [2021-06-05 14:24:54,456 INFO L226 Difference]: Without dead ends: 1124 [2021-06-05 14:24:54,456 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1218.1ms TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:24:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-06-05 14:24:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 902. [2021-06-05 14:24:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 14:24:54,467 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 14:24:54,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:54,467 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 14:24:54,467 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:54,467 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 14:24:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:54,468 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:54,468 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:54,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4609,380 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:54,668 INFO L430 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:54,669 INFO L82 PathProgramCache]: Analyzing trace with hash 474656200, now seen corresponding path program 234 times [2021-06-05 14:24:54,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:54,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668405232] [2021-06-05 14:24:54,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:55,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:55,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668405232] [2021-06-05 14:24:55,035 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668405232] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:55,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030528640] [2021-06-05 14:24:55,035 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 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:55,062 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:24:55,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:24:55,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:24:55,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:55,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:55,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:55,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:24:55,148 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:55,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:55,151 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:55,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 26 treesize of output 20 [2021-06-05 14:24:55,152 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:55,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:55,155 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:55,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:24:55,156 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:55,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:55,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:24:55,159 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:55,197 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:55,198 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:24:55,198 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:141, output treesize:109 [2021-06-05 14:24:55,543 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 77 [2021-06-05 14:24:55,645 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_989, array_2], 1=[array_4, v_prenex_990]} [2021-06-05 14:24:55,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 27 treesize of output 21 [2021-06-05 14:24:55,649 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:55,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 25 treesize of output 19 [2021-06-05 14:24:55,652 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:55,684 INFO L628 ElimStorePlain]: treesize reduction 67, result has 41.2 percent of original size [2021-06-05 14:24:55,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 7 treesize of output 5 [2021-06-05 14:24:55,687 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:55,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:55,697 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:24:55,699 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:55,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:24:55,700 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:24:55,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:55,711 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:55,711 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:132, output treesize:16 [2021-06-05 14:24:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:55,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030528640] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:55,740 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:55,740 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:24:55,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476521456] [2021-06-05 14:24:55,740 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:24:55,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:55,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:24:55,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:24:55,741 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:56,104 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2021-06-05 14:24:56,371 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2021-06-05 14:24:56,805 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 116 [2021-06-05 14:24:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:57,137 INFO L93 Difference]: Finished difference Result 1102 states and 4004 transitions. [2021-06-05 14:24:57,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:57,138 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:57,140 INFO L225 Difference]: With dead ends: 1102 [2021-06-05 14:24:57,140 INFO L226 Difference]: Without dead ends: 1097 [2021-06-05 14:24:57,140 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1640.9ms TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:24:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2021-06-05 14:24:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 902. [2021-06-05 14:24:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 3.7513873473917867) internal successors, (3380), 901 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 3380 transitions. [2021-06-05 14:24:57,155 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 3380 transitions. Word has length 18 [2021-06-05 14:24:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:57,155 INFO L482 AbstractCegarLoop]: Abstraction has 902 states and 3380 transitions. [2021-06-05 14:24:57,155 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:24:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 3380 transitions. [2021-06-05 14:24:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:57,156 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:57,156 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:57,376 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 381 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4625 [2021-06-05 14:24:57,377 INFO L430 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:57,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:57,377 INFO L82 PathProgramCache]: Analyzing trace with hash -736738304, now seen corresponding path program 235 times [2021-06-05 14:24:57,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:57,377 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661783000] [2021-06-05 14:24:57,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:57,577 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:24:57,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661783000] [2021-06-05 14:24:57,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661783000] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:57,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726395335] [2021-06-05 14:24:57,577 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 382 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 382 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:24:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:24:57,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:24:57,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:24:57,791 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:57,792 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:57,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:24:57,793 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:57,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:57,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:57,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 16 treesize of output 12 [2021-06-05 14:24:57,810 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:57,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:57,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:57,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:24:57,816 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:57,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:57,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:57,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 25 treesize of output 19 [2021-06-05 14:24:57,822 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:57,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:57,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:57,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 16 treesize of output 12 [2021-06-05 14:24:57,828 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:57,831 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:57,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:24:57,832 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:57,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:57,903 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 14:24:57,903 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:221, output treesize:175 [2021-06-05 14:24:58,222 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_4]} [2021-06-05 14:24:58,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:58,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:24:58,226 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:58,229 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:58,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 25 treesize of output 19 [2021-06-05 14:24:58,230 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:58,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:58,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 25 treesize of output 19 [2021-06-05 14:24:58,234 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:58,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:24:58,238 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:58,286 INFO L628 ElimStorePlain]: treesize reduction 83, result has 43.5 percent of original size [2021-06-05 14:24:58,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:24:58,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 22 treesize of output 14 [2021-06-05 14:24:58,289 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:24:58,309 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:24:58,311 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:24:58,311 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:181, output treesize:41 [2021-06-05 14:24:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:24:58,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726395335] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:24:58,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:24:58,394 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 14:24:58,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341247783] [2021-06-05 14:24:58,394 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:24:58,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:24:58,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:24:58,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:24:58,394 INFO L87 Difference]: Start difference. First operand 902 states and 3380 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:24:58,745 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2021-06-05 14:24:59,024 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 115 [2021-06-05 14:24:59,343 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 124 [2021-06-05 14:24:59,486 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2021-06-05 14:24:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:24:59,712 INFO L93 Difference]: Finished difference Result 1106 states and 4003 transitions. [2021-06-05 14:24:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:24:59,712 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:24:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:24:59,714 INFO L225 Difference]: With dead ends: 1106 [2021-06-05 14:24:59,714 INFO L226 Difference]: Without dead ends: 1093 [2021-06-05 14:24:59,714 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1457.6ms TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:24:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2021-06-05 14:24:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 904. [2021-06-05 14:24:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 3.7475083056478407) internal successors, (3384), 903 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:24:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 3384 transitions. [2021-06-05 14:24:59,732 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 3384 transitions. Word has length 18 [2021-06-05 14:24:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:24:59,732 INFO L482 AbstractCegarLoop]: Abstraction has 904 states and 3384 transitions. [2021-06-05 14:24:59,732 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:24:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 3384 transitions. [2021-06-05 14:24:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:24:59,733 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:24:59,733 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:24:59,933 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 382 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4651 [2021-06-05 14:24:59,934 INFO L430 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:24:59,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:24:59,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1451444872, now seen corresponding path program 236 times [2021-06-05 14:24:59,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:24:59,934 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099098098] [2021-06-05 14:24:59,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:24:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:00,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:00,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099098098] [2021-06-05 14:25:00,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099098098] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:00,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062236209] [2021-06-05 14:25:00,386 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 383 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 383 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:00,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:25:00,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:00,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:00,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:00,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:00,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:00,582 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:00,585 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:00,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 15 treesize of output 11 [2021-06-05 14:25:00,585 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:00,588 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:00,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:25:00,589 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:00,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:00,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 16 treesize of output 12 [2021-06-05 14:25:00,593 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:00,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:00,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:25:00,596 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:00,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:00,599 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:00,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:00,644 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:25:00,644 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:185, output treesize:139 [2021-06-05 14:25:00,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:25:00,761 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:00,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:00,767 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:25:00,767 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:00,767 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:25:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:00,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062236209] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:00,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:00,798 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:25:00,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908447594] [2021-06-05 14:25:00,798 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:25:00,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:00,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:25:00,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:25:00,798 INFO L87 Difference]: Start difference. First operand 904 states and 3384 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:01,389 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 54 [2021-06-05 14:25:01,637 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2021-06-05 14:25:01,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:01,909 INFO L93 Difference]: Finished difference Result 1073 states and 3938 transitions. [2021-06-05 14:25:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:25:01,910 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:25:01,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:01,911 INFO L225 Difference]: With dead ends: 1073 [2021-06-05 14:25:01,911 INFO L226 Difference]: Without dead ends: 1068 [2021-06-05 14:25:01,911 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1433.1ms TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:25:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-06-05 14:25:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 904. [2021-06-05 14:25:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 3.7475083056478407) internal successors, (3384), 903 states have internal predecessors, (3384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 3384 transitions. [2021-06-05 14:25:01,922 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 3384 transitions. Word has length 18 [2021-06-05 14:25:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:01,922 INFO L482 AbstractCegarLoop]: Abstraction has 904 states and 3384 transitions. [2021-06-05 14:25:01,922 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:01,922 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 3384 transitions. [2021-06-05 14:25:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:01,923 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:01,923 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:02,124 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 383 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4666 [2021-06-05 14:25:02,124 INFO L430 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:02,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:02,124 INFO L82 PathProgramCache]: Analyzing trace with hash 330291594, now seen corresponding path program 237 times [2021-06-05 14:25:02,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:02,124 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770858503] [2021-06-05 14:25:02,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:02,461 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:02,461 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770858503] [2021-06-05 14:25:02,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770858503] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:02,461 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186894488] [2021-06-05 14:25:02,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 384 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 384 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:02,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:25:02,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:02,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 14:25:02,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:02,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:02,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:02,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 16 treesize of output 12 [2021-06-05 14:25:02,664 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:02,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:02,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:02,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 25 treesize of output 19 [2021-06-05 14:25:02,668 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:02,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:02,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:02,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 26 treesize of output 20 [2021-06-05 14:25:02,672 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:02,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:02,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:25:02,676 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:02,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:02,737 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:02,737 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:199, output treesize:167 [2021-06-05 14:25:03,022 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1000], 1=[array_4, v_prenex_1001]} [2021-06-05 14:25:03,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:25:03,025 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:03,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:25:03,028 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:03,061 INFO L628 ElimStorePlain]: treesize reduction 61, result has 42.5 percent of original size [2021-06-05 14:25:03,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:25:03,064 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:03,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:03,076 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:03,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:25:03,077 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:03,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:03,088 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1001 vanished before elimination [2021-06-05 14:25:03,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:03,089 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:128, output treesize:16 [2021-06-05 14:25:03,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:03,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186894488] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:03,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:03,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:25:03,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820211685] [2021-06-05 14:25:03,116 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:25:03,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:03,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:25:03,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:25:03,116 INFO L87 Difference]: Start difference. First operand 904 states and 3384 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:25:03,608 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-06-05 14:25:03,932 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2021-06-05 14:25:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:04,057 INFO L93 Difference]: Finished difference Result 1073 states and 3943 transitions. [2021-06-05 14:25:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:25:04,057 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:25:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:04,059 INFO L225 Difference]: With dead ends: 1073 [2021-06-05 14:25:04,059 INFO L226 Difference]: Without dead ends: 1068 [2021-06-05 14:25:04,059 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1233.9ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:25:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2021-06-05 14:25:04,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 907. [2021-06-05 14:25:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 3.748344370860927) internal successors, (3396), 906 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:04,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 3396 transitions. [2021-06-05 14:25:04,069 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 3396 transitions. Word has length 18 [2021-06-05 14:25:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:04,069 INFO L482 AbstractCegarLoop]: Abstraction has 907 states and 3396 transitions. [2021-06-05 14:25:04,069 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:25:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 3396 transitions. [2021-06-05 14:25:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:04,070 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:04,070 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:04,271 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 384 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4680 [2021-06-05 14:25:04,271 INFO L430 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:04,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:04,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1609697152, now seen corresponding path program 238 times [2021-06-05 14:25:04,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:04,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127896466] [2021-06-05 14:25:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:05,077 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:05,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127896466] [2021-06-05 14:25:05,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127896466] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:05,077 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412199480] [2021-06-05 14:25:05,077 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 385 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 385 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:05,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:25:05,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:05,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 14:25:05,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:05,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:05,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:05,291 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:05,294 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:05,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 26 treesize of output 20 [2021-06-05 14:25:05,295 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:05,298 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:05,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 25 treesize of output 19 [2021-06-05 14:25:05,299 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:05,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:25:05,302 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:05,354 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:05,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:05,356 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:181, output treesize:149 [2021-06-05 14:25:05,526 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:05,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:25:05,528 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:05,531 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:05,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 25 treesize of output 19 [2021-06-05 14:25:05,532 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:05,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:05,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:25:05,536 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:05,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 25 treesize of output 19 [2021-06-05 14:25:05,540 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:05,611 INFO L628 ElimStorePlain]: treesize reduction 83, result has 43.5 percent of original size [2021-06-05 14:25:05,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 14 [2021-06-05 14:25:05,615 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:05,643 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:05,645 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:05,645 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:181, output treesize:50 [2021-06-05 14:25:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:05,768 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412199480] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:05,768 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:05,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 14:25:05,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523221806] [2021-06-05 14:25:05,768 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:25:05,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:05,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:25:05,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:25:05,769 INFO L87 Difference]: Start difference. First operand 907 states and 3396 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:06,254 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2021-06-05 14:25:06,419 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2021-06-05 14:25:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:07,009 INFO L93 Difference]: Finished difference Result 1109 states and 4032 transitions. [2021-06-05 14:25:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:25:07,010 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:25:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:07,011 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 14:25:07,011 INFO L226 Difference]: Without dead ends: 1092 [2021-06-05 14:25:07,011 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1879.6ms TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:25:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2021-06-05 14:25:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 908. [2021-06-05 14:25:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 907 states have (on average 3.7497243660418964) internal successors, (3401), 907 states have internal predecessors, (3401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:07,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 3401 transitions. [2021-06-05 14:25:07,022 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 3401 transitions. Word has length 18 [2021-06-05 14:25:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:07,022 INFO L482 AbstractCegarLoop]: Abstraction has 908 states and 3401 transitions. [2021-06-05 14:25:07,022 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 3401 transitions. [2021-06-05 14:25:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:07,023 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:07,023 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:07,223 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4698,385 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:07,224 INFO L430 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:07,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:07,224 INFO L82 PathProgramCache]: Analyzing trace with hash -317781726, now seen corresponding path program 239 times [2021-06-05 14:25:07,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:07,224 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97927187] [2021-06-05 14:25:07,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:25:07,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:07,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97927187] [2021-06-05 14:25:07,257 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97927187] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:07,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50730461] [2021-06-05 14:25:07,257 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 386 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 386 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:07,294 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:25:07,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:07,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 14:25:07,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:07,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:25:07,325 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25: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 18 treesize of output 14 [2021-06-05 14:25:07,327 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:07,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25: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 10 treesize of output 6 [2021-06-05 14:25:07,350 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:07,361 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:07,362 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:07,362 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 14:25:07,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:25:07,398 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50730461] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:07,398 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:07,398 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-06-05 14:25:07,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775638223] [2021-06-05 14:25:07,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 14:25:07,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:07,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 14:25:07,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 14:25:07,398 INFO L87 Difference]: Start difference. First operand 908 states and 3401 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:25:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:07,552 INFO L93 Difference]: Finished difference Result 1155 states and 4246 transitions. [2021-06-05 14:25:07,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 14:25:07,553 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:25:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:07,554 INFO L225 Difference]: With dead ends: 1155 [2021-06-05 14:25:07,554 INFO L226 Difference]: Without dead ends: 1089 [2021-06-05 14:25:07,554 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 122.6ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:25:07,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-06-05 14:25:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 836. [2021-06-05 14:25:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 835 states have (on average 3.7664670658682633) internal successors, (3145), 835 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 3145 transitions. [2021-06-05 14:25:07,565 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 3145 transitions. Word has length 18 [2021-06-05 14:25:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:07,565 INFO L482 AbstractCegarLoop]: Abstraction has 836 states and 3145 transitions. [2021-06-05 14:25:07,565 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:25:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 3145 transitions. [2021-06-05 14:25:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:07,566 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:07,566 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:07,766 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4711,386 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:07,766 INFO L430 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:07,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1445800362, now seen corresponding path program 240 times [2021-06-05 14:25:07,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:07,767 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549655909] [2021-06-05 14:25:07,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:08,316 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:08,316 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549655909] [2021-06-05 14:25:08,316 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549655909] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:08,316 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664530333] [2021-06-05 14:25:08,316 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 387 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 387 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:08,342 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:25:08,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:08,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:08,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:08,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:08,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 16 treesize of output 12 [2021-06-05 14:25:08,476 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:08,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:08,480 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:08,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 25 treesize of output 19 [2021-06-05 14:25:08,483 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:08,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:25:08,487 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:08,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 26 treesize of output 20 [2021-06-05 14:25:08,491 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:08,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 16 treesize of output 12 [2021-06-05 14:25:08,494 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:08,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:25:08,498 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:08,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 26 treesize of output 20 [2021-06-05 14:25:08,502 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,504 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:08,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 25 treesize of output 19 [2021-06-05 14:25:08,505 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:25:08,508 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,596 INFO L628 ElimStorePlain]: treesize reduction 92, result has 57.2 percent of original size [2021-06-05 14:25:08,597 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:25:08,597 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 1 variables, input treesize:305, output treesize:123 [2021-06-05 14:25:08,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 17 treesize of output 13 [2021-06-05 14:25:08,782 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:25:08,784 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:08,796 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 14:25:08,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 11 treesize of output 7 [2021-06-05 14:25:08,799 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:08,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:08,805 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:08,805 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 14:25:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:08,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664530333] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:08,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:08,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:25:08,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464580990] [2021-06-05 14:25:08,838 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:25:08,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:08,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:25:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:25:08,838 INFO L87 Difference]: Start difference. First operand 836 states and 3145 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:09,539 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 72 [2021-06-05 14:25:10,069 WARN L205 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2021-06-05 14:25:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:10,407 INFO L93 Difference]: Finished difference Result 1024 states and 3736 transitions. [2021-06-05 14:25:10,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:25:10,408 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:25:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:10,409 INFO L225 Difference]: With dead ends: 1024 [2021-06-05 14:25:10,409 INFO L226 Difference]: Without dead ends: 1019 [2021-06-05 14:25:10,410 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1896.5ms TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:25:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-06-05 14:25:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 831. [2021-06-05 14:25:10,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 3.7771084337349397) internal successors, (3135), 830 states have internal predecessors, (3135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 3135 transitions. [2021-06-05 14:25:10,420 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 3135 transitions. Word has length 18 [2021-06-05 14:25:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:10,420 INFO L482 AbstractCegarLoop]: Abstraction has 831 states and 3135 transitions. [2021-06-05 14:25:10,420 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:10,420 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 3135 transitions. [2021-06-05 14:25:10,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:10,421 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:10,421 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:10,621 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4717,387 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:10,621 INFO L430 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:10,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:10,621 INFO L82 PathProgramCache]: Analyzing trace with hash -894215328, now seen corresponding path program 241 times [2021-06-05 14:25:10,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:10,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597424293] [2021-06-05 14:25:10,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:10,693 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:10,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597424293] [2021-06-05 14:25:10,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597424293] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:10,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928947571] [2021-06-05 14:25:10,693 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 388 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 388 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:10,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:25:10,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:10,865 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1002, v_prenex_1004, v_prenex_1003, v_prenex_1005], 1=[array_0]} [2021-06-05 14:25:10,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 18 treesize of output 14 [2021-06-05 14:25:10,869 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:10,901 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:10,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 7 treesize of output 5 [2021-06-05 14:25:10,905 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:10,958 INFO L628 ElimStorePlain]: treesize reduction 17, result has 85.1 percent of original size [2021-06-05 14:25:10,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 18 treesize of output 14 [2021-06-05 14:25:10,962 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:10,996 INFO L628 ElimStorePlain]: treesize reduction 25, result has 72.2 percent of original size [2021-06-05 14:25:10,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:25:11,000 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:11,014 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:11,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:11,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:25:11,017 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:11,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:11,035 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2021-06-05 14:25:11,035 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:128, output treesize:45 [2021-06-05 14:25:11,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:11,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 18 treesize of output 14 [2021-06-05 14:25:11,106 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:11,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 8 treesize of output 6 [2021-06-05 14:25:11,109 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:11,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:25:11,112 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:11,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 7 treesize of output 5 [2021-06-05 14:25:11,115 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:11,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:25:11,118 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:11,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 8 treesize of output 6 [2021-06-05 14:25:11,122 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:11,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 8 treesize of output 6 [2021-06-05 14:25:11,125 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:11,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:25:11,128 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:11,165 INFO L628 ElimStorePlain]: treesize reduction 55, result has 39.6 percent of original size [2021-06-05 14:25:11,165 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:25:11,166 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:11,166 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:161, output treesize:30 [2021-06-05 14:25:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:11,198 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928947571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:11,198 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:11,198 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:25:11,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482707522] [2021-06-05 14:25:11,198 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:25:11,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:11,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:25:11,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:25:11,198 INFO L87 Difference]: Start difference. First operand 831 states and 3135 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:25:11,806 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2021-06-05 14:25:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:13,170 INFO L93 Difference]: Finished difference Result 1097 states and 3888 transitions. [2021-06-05 14:25:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 14:25:13,171 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:25:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:13,172 INFO L225 Difference]: With dead ends: 1097 [2021-06-05 14:25:13,173 INFO L226 Difference]: Without dead ends: 1044 [2021-06-05 14:25:13,173 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1619.7ms TimeCoverageRelationStatistics Valid=451, Invalid=1901, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 14:25:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2021-06-05 14:25:13,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 848. [2021-06-05 14:25:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 3.728453364817001) internal successors, (3158), 847 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 3158 transitions. [2021-06-05 14:25:13,185 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 3158 transitions. Word has length 18 [2021-06-05 14:25:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:13,185 INFO L482 AbstractCegarLoop]: Abstraction has 848 states and 3158 transitions. [2021-06-05 14:25:13,185 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:25:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 3158 transitions. [2021-06-05 14:25:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:13,186 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:13,186 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:13,386 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 388 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4729 [2021-06-05 14:25:13,387 INFO L430 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:13,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:13,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1989681178, now seen corresponding path program 242 times [2021-06-05 14:25:13,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:13,387 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691602102] [2021-06-05 14:25:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:13,616 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:13,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691602102] [2021-06-05 14:25:13,616 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691602102] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:13,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751651793] [2021-06-05 14:25:13,616 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 389 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 389 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:13,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:25:13,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:13,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:13,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:13,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:13,915 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:13,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 15 treesize of output 11 [2021-06-05 14:25:13,916 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:13,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:13,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:13,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:13,921 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:13,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:13,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:13,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 26 treesize of output 20 [2021-06-05 14:25:13,925 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:13,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:13,929 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:13,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:25:13,930 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:13,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:13,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:13,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:13,934 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:13,937 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:13,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 25 treesize of output 19 [2021-06-05 14:25:13,938 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:14,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:14,011 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 14:25:14,011 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:221, output treesize:171 [2021-06-05 14:25:14,209 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1011], 1=[array_4, v_prenex_1012]} [2021-06-05 14:25:14,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 25 treesize of output 19 [2021-06-05 14:25:14,213 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:14,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 15 treesize of output 11 [2021-06-05 14:25:14,216 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:14,250 INFO L628 ElimStorePlain]: treesize reduction 63, result has 42.7 percent of original size [2021-06-05 14:25:14,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 19 treesize of output 15 [2021-06-05 14:25:14,253 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:14,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:14,264 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:25:14,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:14,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:25:14,267 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:14,277 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:14,278 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:14,278 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:124, output treesize:16 [2021-06-05 14:25:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:14,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751651793] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:14,308 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:14,308 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 14:25:14,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586956965] [2021-06-05 14:25:14,308 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:25:14,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:14,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:25:14,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:25:14,308 INFO L87 Difference]: Start difference. First operand 848 states and 3158 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:25:15,078 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 71 [2021-06-05 14:25:15,527 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 111 [2021-06-05 14:25:15,834 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 75 [2021-06-05 14:25:16,059 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 86 [2021-06-05 14:25:16,272 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 71 [2021-06-05 14:25:16,509 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2021-06-05 14:25:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:16,971 INFO L93 Difference]: Finished difference Result 1045 states and 3810 transitions. [2021-06-05 14:25:16,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 14:25:16,971 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:25:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:16,973 INFO L225 Difference]: With dead ends: 1045 [2021-06-05 14:25:16,973 INFO L226 Difference]: Without dead ends: 1026 [2021-06-05 14:25:16,973 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2509.5ms TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 14:25:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2021-06-05 14:25:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 847. [2021-06-05 14:25:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 846 states have (on average 3.730496453900709) internal successors, (3156), 846 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 3156 transitions. [2021-06-05 14:25:16,985 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 3156 transitions. Word has length 18 [2021-06-05 14:25:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:16,985 INFO L482 AbstractCegarLoop]: Abstraction has 847 states and 3156 transitions. [2021-06-05 14:25:16,986 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:25:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 3156 transitions. [2021-06-05 14:25:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:16,987 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:16,987 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:17,187 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4744,389 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:17,187 INFO L430 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:17,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash 879584916, now seen corresponding path program 243 times [2021-06-05 14:25:17,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:17,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466511518] [2021-06-05 14:25:17,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:17,258 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:17,258 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466511518] [2021-06-05 14:25:17,258 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466511518] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:17,258 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676581872] [2021-06-05 14:25:17,258 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 390 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 390 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:17,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:25:17,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:17,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 14:25:17,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:17,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 7 treesize of output 5 [2021-06-05 14:25:17,319 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:17,343 INFO L628 ElimStorePlain]: treesize reduction 1, result has 97.2 percent of original size [2021-06-05 14:25:17,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 8 treesize of output 6 [2021-06-05 14:25:17,345 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:17,356 INFO L628 ElimStorePlain]: treesize reduction 15, result has 44.4 percent of original size [2021-06-05 14:25:17,356 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:25:17,356 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:12 [2021-06-05 14:25:17,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:25:17,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:17,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 18 treesize of output 14 [2021-06-05 14:25:17,380 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:17,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:17,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 10 treesize of output 6 [2021-06-05 14:25:17,394 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:17,405 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:17,406 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:17,406 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 14:25:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:17,460 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676581872] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:17,460 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:17,460 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2021-06-05 14:25:17,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098091729] [2021-06-05 14:25:17,460 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:25:17,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:17,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:25:17,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:25:17,461 INFO L87 Difference]: Start difference. First operand 847 states and 3156 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:25:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:18,844 INFO L93 Difference]: Finished difference Result 1612 states and 5528 transitions. [2021-06-05 14:25:18,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 14:25:18,845 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:25:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:18,847 INFO L225 Difference]: With dead ends: 1612 [2021-06-05 14:25:18,847 INFO L226 Difference]: Without dead ends: 1481 [2021-06-05 14:25:18,847 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1072.9ms TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 14:25:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2021-06-05 14:25:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 922. [2021-06-05 14:25:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 921 states have (on average 3.807817589576547) internal successors, (3507), 921 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 3507 transitions. [2021-06-05 14:25:18,871 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 3507 transitions. Word has length 18 [2021-06-05 14:25:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:18,871 INFO L482 AbstractCegarLoop]: Abstraction has 922 states and 3507 transitions. [2021-06-05 14:25:18,871 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:25:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 3507 transitions. [2021-06-05 14:25:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:18,872 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:18,872 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:19,072 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 390 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4767 [2021-06-05 14:25:19,073 INFO L430 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:19,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:19,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1052832608, now seen corresponding path program 244 times [2021-06-05 14:25:19,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:19,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682807952] [2021-06-05 14:25:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:25:19,115 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:19,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682807952] [2021-06-05 14:25:19,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682807952] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:19,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417516402] [2021-06-05 14:25:19,115 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 391 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 391 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:19,141 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:25:19,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:19,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:25:19,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:19,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:19,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:25:19,220 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:19,222 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:25:19,223 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:19,225 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:19,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:19,226 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:19,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:25:19,229 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:19,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 7 treesize of output 5 [2021-06-05 14:25:19,232 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:19,233 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:25:19,234 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:19,267 INFO L628 ElimStorePlain]: treesize reduction 6, result has 88.5 percent of original size [2021-06-05 14:25:19,267 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:19,267 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:129, output treesize:46 [2021-06-05 14:25:19,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 18 treesize of output 14 [2021-06-05 14:25:19,335 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:19,338 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 14:25:19,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:25:19,340 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:19,342 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:19,342 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:19,342 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 14:25:19,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:19,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417516402] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:19,353 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:19,353 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:25:19,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358476459] [2021-06-05 14:25:19,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:25:19,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:19,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:25:19,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:25:19,354 INFO L87 Difference]: Start difference. First operand 922 states and 3507 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:21,423 INFO L93 Difference]: Finished difference Result 1987 states and 7216 transitions. [2021-06-05 14:25:21,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 14:25:21,423 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:21,426 INFO L225 Difference]: With dead ends: 1987 [2021-06-05 14:25:21,426 INFO L226 Difference]: Without dead ends: 1809 [2021-06-05 14:25:21,426 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1444.0ms TimeCoverageRelationStatistics Valid=676, Invalid=2864, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 14:25:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2021-06-05 14:25:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1021. [2021-06-05 14:25:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.91078431372549) internal successors, (3989), 1020 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 3989 transitions. [2021-06-05 14:25:21,442 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 3989 transitions. Word has length 18 [2021-06-05 14:25:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:21,442 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 3989 transitions. [2021-06-05 14:25:21,443 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 3989 transitions. [2021-06-05 14:25:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:21,444 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:21,444 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:21,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4774,391 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:21,644 INFO L430 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:21,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:21,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1207604144, now seen corresponding path program 245 times [2021-06-05 14:25:21,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:21,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349656713] [2021-06-05 14:25:21,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:21,710 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:21,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349656713] [2021-06-05 14:25:21,710 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349656713] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:21,710 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706159599] [2021-06-05 14:25:21,710 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 392 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 392 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:21,737 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:25:21,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:21,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 14:25:21,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25: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 7 treesize of output 5 [2021-06-05 14:25:21,759 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:21,772 INFO L628 ElimStorePlain]: treesize reduction 1, result has 95.0 percent of original size [2021-06-05 14:25:21,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 8 treesize of output 6 [2021-06-05 14:25:21,774 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:21,777 INFO L628 ElimStorePlain]: treesize reduction 7, result has 30.0 percent of original size [2021-06-05 14:25:21,778 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:25:21,778 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:3 [2021-06-05 14:25: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 7 treesize of output 5 [2021-06-05 14:25:21,809 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25: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 18 treesize of output 14 [2021-06-05 14:25:21,812 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:21,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:21,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:25:21,827 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:21,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:21,839 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:21,839 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:27 [2021-06-05 14:25:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:21,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706159599] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:21,897 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:21,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2021-06-05 14:25:21,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803186202] [2021-06-05 14:25:21,898 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:25:21,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:21,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:25:21,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:25:21,903 INFO L87 Difference]: Start difference. First operand 1021 states and 3989 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:25:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:23,072 INFO L93 Difference]: Finished difference Result 1795 states and 6714 transitions. [2021-06-05 14:25:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-06-05 14:25:23,073 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:25:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:23,075 INFO L225 Difference]: With dead ends: 1795 [2021-06-05 14:25:23,075 INFO L226 Difference]: Without dead ends: 1708 [2021-06-05 14:25:23,076 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 904.3ms TimeCoverageRelationStatistics Valid=473, Invalid=2283, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 14:25:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2021-06-05 14:25:23,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1070. [2021-06-05 14:25:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1069 states have (on average 3.9747427502338635) internal successors, (4249), 1069 states have internal predecessors, (4249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 4249 transitions. [2021-06-05 14:25:23,093 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 4249 transitions. Word has length 18 [2021-06-05 14:25:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:23,093 INFO L482 AbstractCegarLoop]: Abstraction has 1070 states and 4249 transitions. [2021-06-05 14:25:23,093 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:25:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 4249 transitions. [2021-06-05 14:25:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:23,094 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:23,094 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:23,294 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4784,392 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:23,295 INFO L430 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash 960983972, now seen corresponding path program 246 times [2021-06-05 14:25:23,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:23,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678368460] [2021-06-05 14:25:23,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:23,371 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:23,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678368460] [2021-06-05 14:25:23,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678368460] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:23,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054628791] [2021-06-05 14:25:23,371 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 393 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 393 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:23,397 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:25:23,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:23,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:25:23,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:23,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:25:23,486 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:23,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 8 treesize of output 6 [2021-06-05 14:25:23,488 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:23,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:23,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:23,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 17 treesize of output 13 [2021-06-05 14:25:23,492 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:23,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 8 treesize of output 6 [2021-06-05 14:25:23,495 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:23,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 7 treesize of output 5 [2021-06-05 14:25:23,498 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:23,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:23,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 16 treesize of output 12 [2021-06-05 14:25:23,500 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:23,538 INFO L628 ElimStorePlain]: treesize reduction 22, result has 66.7 percent of original size [2021-06-05 14:25:23,539 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2021-06-05 14:25:23,540 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:119, output treesize:38 [2021-06-05 14:25:23,627 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1015, v_prenex_1016], 1=[array_0, array_2]} [2021-06-05 14:25:23,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 18 treesize of output 14 [2021-06-05 14:25:23,631 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:23,667 INFO L628 ElimStorePlain]: treesize reduction 52, result has 40.9 percent of original size [2021-06-05 14:25:23,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:25:23,671 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:23,682 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:23,682 INFO L518 ElimStorePlain]: Eliminatee array_0 vanished before elimination [2021-06-05 14:25:23,682 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:25:23,683 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:23,683 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:95, output treesize:30 [2021-06-05 14:25:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:23,719 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054628791] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:23,719 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:23,719 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:25:23,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873008189] [2021-06-05 14:25:23,719 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:25:23,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:23,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:25:23,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:25:23,719 INFO L87 Difference]: Start difference. First operand 1070 states and 4249 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 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:25:25,001 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2021-06-05 14:25:25,474 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2021-06-05 14:25:25,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:25,920 INFO L93 Difference]: Finished difference Result 1513 states and 5765 transitions. [2021-06-05 14:25:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 14:25:25,920 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 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:25:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:25,923 INFO L225 Difference]: With dead ends: 1513 [2021-06-05 14:25:25,923 INFO L226 Difference]: Without dead ends: 1482 [2021-06-05 14:25:25,923 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1718.5ms TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 14:25:25,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2021-06-05 14:25:25,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1071. [2021-06-05 14:25:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 3.9598130841121497) internal successors, (4237), 1070 states have internal predecessors, (4237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 4237 transitions. [2021-06-05 14:25:25,936 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 4237 transitions. Word has length 18 [2021-06-05 14:25:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:25,937 INFO L482 AbstractCegarLoop]: Abstraction has 1071 states and 4237 transitions. [2021-06-05 14:25:25,937 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 16 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:25:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 4237 transitions. [2021-06-05 14:25:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:25,938 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:25,938 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:26,138 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4790,393 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:26,139 INFO L430 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:26,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1134231664, now seen corresponding path program 247 times [2021-06-05 14:25:26,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:26,139 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160622227] [2021-06-05 14:25:26,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:25:26,178 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:26,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160622227] [2021-06-05 14:25:26,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160622227] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:26,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576670056] [2021-06-05 14:25:26,178 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 394 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 394 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:26,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:25:26,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:26,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:25:26,269 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:26,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 14:25:26,272 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:26,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:26,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 17 treesize of output 13 [2021-06-05 14:25:26,275 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:26,277 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:25:26,277 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:26,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 7 treesize of output 5 [2021-06-05 14:25:26,280 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:26,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:26,282 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:26,308 INFO L628 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2021-06-05 14:25:26,309 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:26,309 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:107, output treesize:32 [2021-06-05 14:25:26,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 18 treesize of output 14 [2021-06-05 14:25:26,384 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:26,386 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 14:25:26,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:25:26,388 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:26,389 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:26,390 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:26,390 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 14:25:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:26,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576670056] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:26,397 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:26,397 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:25:26,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995014340] [2021-06-05 14:25:26,397 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:25:26,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:25:26,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:25:26,398 INFO L87 Difference]: Start difference. First operand 1071 states and 4237 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:27,519 INFO L93 Difference]: Finished difference Result 1440 states and 5539 transitions. [2021-06-05 14:25:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 14:25:27,519 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:27,522 INFO L225 Difference]: With dead ends: 1440 [2021-06-05 14:25:27,522 INFO L226 Difference]: Without dead ends: 1401 [2021-06-05 14:25:27,522 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 716.7ms TimeCoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 14:25:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2021-06-05 14:25:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1057. [2021-06-05 14:25:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1056 states have (on average 3.949810606060606) internal successors, (4171), 1056 states have internal predecessors, (4171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 4171 transitions. [2021-06-05 14:25:27,536 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 4171 transitions. Word has length 18 [2021-06-05 14:25:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:27,536 INFO L482 AbstractCegarLoop]: Abstraction has 1057 states and 4171 transitions. [2021-06-05 14:25:27,536 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 4171 transitions. [2021-06-05 14:25:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:27,538 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:27,538 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:27,738 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 394 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4805 [2021-06-05 14:25:27,738 INFO L430 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:27,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1136857440, now seen corresponding path program 248 times [2021-06-05 14:25:27,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:27,739 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55187209] [2021-06-05 14:25:27,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:25:27,775 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:27,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55187209] [2021-06-05 14:25:27,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55187209] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:27,775 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497774904] [2021-06-05 14:25:27,775 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 395 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 395 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:27,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:25:27,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:27,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:25:27,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:27,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 7 treesize of output 5 [2021-06-05 14:25:27,862 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:27,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 8 treesize of output 6 [2021-06-05 14:25:27,865 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:27,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:27,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:25:27,868 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:27,870 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:25:27,870 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:27,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 7 treesize of output 5 [2021-06-05 14:25:27,873 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:27,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:27,875 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:27,901 INFO L628 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2021-06-05 14:25:27,902 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:27,902 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:107, output treesize:32 [2021-06-05 14:25:27,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 18 treesize of output 14 [2021-06-05 14:25:27,964 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:27,967 INFO L628 ElimStorePlain]: treesize reduction 4, result has 71.4 percent of original size [2021-06-05 14:25:27,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 10 treesize of output 6 [2021-06-05 14:25:27,969 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:27,970 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:27,971 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:27,971 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:6 [2021-06-05 14:25:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:27,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497774904] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:27,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:27,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:25:27,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254970137] [2021-06-05 14:25:27,978 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:25:27,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:27,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:25:27,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:25:27,978 INFO L87 Difference]: Start difference. First operand 1057 states and 4171 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:29,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:29,115 INFO L93 Difference]: Finished difference Result 1648 states and 6288 transitions. [2021-06-05 14:25:29,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 14:25:29,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:29,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:29,117 INFO L225 Difference]: With dead ends: 1648 [2021-06-05 14:25:29,117 INFO L226 Difference]: Without dead ends: 1599 [2021-06-05 14:25:29,118 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 758.7ms TimeCoverageRelationStatistics Valid=371, Invalid=1435, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 14:25:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2021-06-05 14:25:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1037. [2021-06-05 14:25:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 1036 states have (on average 3.948841698841699) internal successors, (4091), 1036 states have internal predecessors, (4091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 4091 transitions. [2021-06-05 14:25:29,131 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 4091 transitions. Word has length 18 [2021-06-05 14:25:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:29,131 INFO L482 AbstractCegarLoop]: Abstraction has 1037 states and 4091 transitions. [2021-06-05 14:25:29,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 4091 transitions. [2021-06-05 14:25:29,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:29,133 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:29,133 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:29,333 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4815,395 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:29,333 INFO L430 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:29,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:29,334 INFO L82 PathProgramCache]: Analyzing trace with hash -905881326, now seen corresponding path program 249 times [2021-06-05 14:25:29,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:29,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356887282] [2021-06-05 14:25:29,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:29,382 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:29,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356887282] [2021-06-05 14:25:29,382 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356887282] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:29,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934794811] [2021-06-05 14:25:29,382 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 396 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 396 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:29,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:25:29,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:29,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:25:29,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:29,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:29,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:25:29,486 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:29,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:29,490 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:29,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 25 treesize of output 19 [2021-06-05 14:25:29,493 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,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 26 treesize of output 20 [2021-06-05 14:25:29,496 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,525 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:29,526 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:29,526 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:91 [2021-06-05 14:25:29,621 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:29,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:25:29,622 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,624 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:25:29,625 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,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:25:29,627 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,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 7 treesize of output 5 [2021-06-05 14:25:29,630 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,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:25:29,633 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,636 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:25:29,636 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,638 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:25:29,639 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:29,641 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:29,667 INFO L628 ElimStorePlain]: treesize reduction 20, result has 60.0 percent of original size [2021-06-05 14:25:29,667 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:25:29,667 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:29,667 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:145, output treesize:30 [2021-06-05 14:25:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:29,703 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934794811] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:29,703 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:29,703 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:25:29,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258150436] [2021-06-05 14:25:29,704 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:25:29,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:29,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:25:29,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:25:29,704 INFO L87 Difference]: Start difference. First operand 1037 states and 4091 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:25:30,275 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2021-06-05 14:25:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:30,672 INFO L93 Difference]: Finished difference Result 1732 states and 6384 transitions. [2021-06-05 14:25:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 14:25:30,673 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:25:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:30,676 INFO L225 Difference]: With dead ends: 1732 [2021-06-05 14:25:30,676 INFO L226 Difference]: Without dead ends: 1643 [2021-06-05 14:25:30,676 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 824.7ms TimeCoverageRelationStatistics Valid=275, Invalid=1057, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 14:25:30,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2021-06-05 14:25:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1066. [2021-06-05 14:25:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1065 states have (on average 4.016901408450704) internal successors, (4278), 1065 states have internal predecessors, (4278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 4278 transitions. [2021-06-05 14:25:30,694 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 4278 transitions. Word has length 18 [2021-06-05 14:25:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:30,694 INFO L482 AbstractCegarLoop]: Abstraction has 1066 states and 4278 transitions. [2021-06-05 14:25:30,694 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 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:25:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 4278 transitions. [2021-06-05 14:25:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:30,695 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:30,695 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:30,895 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4824,396 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:30,896 INFO L430 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:30,896 INFO L82 PathProgramCache]: Analyzing trace with hash -614645920, now seen corresponding path program 250 times [2021-06-05 14:25:30,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:30,896 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235635654] [2021-06-05 14:25:30,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:30,941 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:30,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235635654] [2021-06-05 14:25:30,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235635654] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:30,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697908574] [2021-06-05 14:25:30,942 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 397 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 397 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:30,967 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:25:30,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:30,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:25:30,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:31,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:31,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:25:31,046 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:31,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:31,049 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:31,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:31,053 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,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 26 treesize of output 20 [2021-06-05 14:25:31,055 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,084 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:31,084 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:31,085 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:87 [2021-06-05 14:25:31,156 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:31,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 16 treesize of output 12 [2021-06-05 14:25:31,157 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:31,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:25:31,161 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:31,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 18 treesize of output 14 [2021-06-05 14:25:31,173 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:31,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 19 treesize of output 15 [2021-06-05 14:25:31,177 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:31,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 15 treesize of output 11 [2021-06-05 14:25:31,182 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:31,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:25:31,186 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,189 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:31,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:31,190 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,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 18 treesize of output 14 [2021-06-05 14:25:31,193 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:31,262 INFO L628 ElimStorePlain]: treesize reduction 104, result has 39.9 percent of original size [2021-06-05 14:25:31,265 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:31,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:25:31,266 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:31,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 10 treesize of output 6 [2021-06-05 14:25:31,270 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:31,293 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:31,294 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:31,294 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:245, output treesize:55 [2021-06-05 14:25:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:31,379 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697908574] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:31,379 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:31,379 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:25:31,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518044838] [2021-06-05 14:25:31,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:25:31,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:31,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:25:31,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:25:31,380 INFO L87 Difference]: Start difference. First operand 1066 states and 4278 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:32,680 INFO L93 Difference]: Finished difference Result 1823 states and 6671 transitions. [2021-06-05 14:25:32,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 14:25:32,680 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:32,683 INFO L225 Difference]: With dead ends: 1823 [2021-06-05 14:25:32,683 INFO L226 Difference]: Without dead ends: 1753 [2021-06-05 14:25:32,683 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1079.0ms TimeCoverageRelationStatistics Valid=339, Invalid=1467, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 14:25:32,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2021-06-05 14:25:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 965. [2021-06-05 14:25:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 3.9325726141078836) internal successors, (3791), 964 states have internal predecessors, (3791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 3791 transitions. [2021-06-05 14:25:32,698 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 3791 transitions. Word has length 18 [2021-06-05 14:25:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:32,698 INFO L482 AbstractCegarLoop]: Abstraction has 965 states and 3791 transitions. [2021-06-05 14:25:32,698 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 3791 transitions. [2021-06-05 14:25:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:32,699 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:32,699 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:32,900 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 397 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4836 [2021-06-05 14:25:32,900 INFO L430 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:32,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1844903270, now seen corresponding path program 251 times [2021-06-05 14:25:32,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:32,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51194572] [2021-06-05 14:25:32,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:33,271 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:33,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51194572] [2021-06-05 14:25:33,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51194572] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:33,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755377759] [2021-06-05 14:25:33,271 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 398 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 398 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:33,298 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:25:33,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:33,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:33,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:33,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,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 25 treesize of output 19 [2021-06-05 14:25:33,457 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,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 25 treesize of output 19 [2021-06-05 14:25:33,462 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,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 35 treesize of output 27 [2021-06-05 14:25:33,466 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,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 15 treesize of output 11 [2021-06-05 14:25:33,470 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,520 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:33,523 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:25:33,523 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:181, output treesize:151 [2021-06-05 14:25:33,655 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 10=[array_0]} [2021-06-05 14:25:33,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,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 30 treesize of output 24 [2021-06-05 14:25:33,660 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,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 25 treesize of output 19 [2021-06-05 14:25:33,665 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:33,670 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,674 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 23 [2021-06-05 14:25:33,675 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,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 26 treesize of output 20 [2021-06-05 14:25:33,680 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:33,684 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,688 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:25:33,689 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:25:33,693 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,838 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2021-06-05 14:25:33,839 INFO L628 ElimStorePlain]: treesize reduction 142, result has 53.1 percent of original size [2021-06-05 14:25:33,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,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 10 treesize of output 6 [2021-06-05 14:25:33,844 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:33,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,848 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:25:33,849 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:33,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:33,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:25:33,853 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:33,910 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:33,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:25:33,912 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:373, output treesize:97 [2021-06-05 14:25:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:34,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755377759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:34,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:34,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 14:25:34,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033150681] [2021-06-05 14:25:34,049 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:25:34,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:34,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:25:34,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:25:34,050 INFO L87 Difference]: Start difference. First operand 965 states and 3791 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:25:34,802 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 103 [2021-06-05 14:25:34,942 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 14:25:35,181 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2021-06-05 14:25:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:35,637 INFO L93 Difference]: Finished difference Result 1236 states and 4759 transitions. [2021-06-05 14:25:35,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:25:35,637 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:25:35,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:35,639 INFO L225 Difference]: With dead ends: 1236 [2021-06-05 14:25:35,639 INFO L226 Difference]: Without dead ends: 1231 [2021-06-05 14:25:35,639 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1563.9ms TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:25:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2021-06-05 14:25:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 969. [2021-06-05 14:25:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 3.9328512396694215) internal successors, (3807), 968 states have internal predecessors, (3807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 3807 transitions. [2021-06-05 14:25:35,651 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 3807 transitions. Word has length 18 [2021-06-05 14:25:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:35,651 INFO L482 AbstractCegarLoop]: Abstraction has 969 states and 3807 transitions. [2021-06-05 14:25:35,651 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:25:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 3807 transitions. [2021-06-05 14:25:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:35,652 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:35,652 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:35,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4851,398 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:35,853 INFO L430 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:35,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1839906778, now seen corresponding path program 252 times [2021-06-05 14:25:35,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:35,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763699060] [2021-06-05 14:25:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:36,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:36,218 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763699060] [2021-06-05 14:25:36,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763699060] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:36,218 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585658535] [2021-06-05 14:25:36,218 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 399 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 399 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:36,248 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:25:36,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:36,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:36,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:36,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:25:36,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,527 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,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 25 treesize of output 19 [2021-06-05 14:25:36,530 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,589 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:36,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:36,595 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:25:36,599 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:36,657 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,658 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:25:36,659 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:25:36,663 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,714 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:36,718 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2021-06-05 14:25:36,718 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:200, output treesize:146 [2021-06-05 14:25:36,901 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 21=[array_0]} [2021-06-05 14:25:36,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:25:36,908 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:25:36,914 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:25:36,920 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:25:36,927 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,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 18 treesize of output 14 [2021-06-05 14:25:36,933 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,937 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:25:36,938 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,943 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,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 17 treesize of output 13 [2021-06-05 14:25:36,944 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,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 20 treesize of output 16 [2021-06-05 14:25:36,950 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:36,956 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,961 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,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 18 treesize of output 14 [2021-06-05 14:25:36,962 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:36,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 14:25:36,970 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:36,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:36,977 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:37,185 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2021-06-05 14:25:37,186 INFO L628 ElimStorePlain]: treesize reduction 134, result has 57.9 percent of original size [2021-06-05 14:25:37,190 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:37,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:37,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 12 treesize of output 8 [2021-06-05 14:25:37,193 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:37,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:37,198 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:37,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 13 treesize of output 9 [2021-06-05 14:25:37,200 INFO L550 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:37,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:37,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:37,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 10 treesize of output 6 [2021-06-05 14:25:37,208 INFO L550 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:37,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:37,212 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:37,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:25:37,214 INFO L550 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:37,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:37,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 9 treesize of output 5 [2021-06-05 14:25:37,219 INFO L550 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:37,283 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:37,286 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2021-06-05 14:25:37,286 INFO L247 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:399, output treesize:99 [2021-06-05 14:25:37,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:37,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585658535] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:37,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:37,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 14:25:37,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532745410] [2021-06-05 14:25:37,402 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:25:37,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:37,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:25:37,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:25:37,402 INFO L87 Difference]: Start difference. First operand 969 states and 3807 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:25:37,814 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2021-06-05 14:25:38,088 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 121 [2021-06-05 14:25:38,288 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2021-06-05 14:25:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:38,467 INFO L93 Difference]: Finished difference Result 1200 states and 4678 transitions. [2021-06-05 14:25:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:25:38,467 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:25:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:38,469 INFO L225 Difference]: With dead ends: 1200 [2021-06-05 14:25:38,469 INFO L226 Difference]: Without dead ends: 1193 [2021-06-05 14:25:38,469 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1398.4ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:25:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2021-06-05 14:25:38,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 970. [2021-06-05 14:25:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9308565531475748) internal successors, (3809), 969 states have internal predecessors, (3809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:38,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3809 transitions. [2021-06-05 14:25:38,481 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3809 transitions. Word has length 18 [2021-06-05 14:25:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:38,481 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3809 transitions. [2021-06-05 14:25:38,481 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:25:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3809 transitions. [2021-06-05 14:25:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:38,482 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:38,482 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:38,682 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4873,399 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:38,683 INFO L430 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:38,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:38,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1410858674, now seen corresponding path program 253 times [2021-06-05 14:25:38,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:38,683 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76158376] [2021-06-05 14:25:38,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:39,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:39,289 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:39,289 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76158376] [2021-06-05 14:25:39,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76158376] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:39,289 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194493387] [2021-06-05 14:25:39,289 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 400 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 400 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:39,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 14:25:39,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:39,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,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 35 treesize of output 27 [2021-06-05 14:25:39,462 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,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:25:39,466 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,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 25 treesize of output 19 [2021-06-05 14:25:39,470 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:39,473 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,514 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:39,515 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:39,515 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:163, output treesize:129 [2021-06-05 14:25:39,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,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 18 treesize of output 14 [2021-06-05 14:25:39,601 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,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:25:39,605 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,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 26 treesize of output 20 [2021-06-05 14:25:39,609 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,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 25 treesize of output 19 [2021-06-05 14:25:39,613 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,616 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:25:39,617 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,620 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,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 29 treesize of output 23 [2021-06-05 14:25:39,621 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,624 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,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 24 [2021-06-05 14:25:39,625 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:39,628 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:39,742 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2021-06-05 14:25:39,743 INFO L628 ElimStorePlain]: treesize reduction 119, result has 53.3 percent of original size [2021-06-05 14:25:39,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,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 12 treesize of output 8 [2021-06-05 14:25:39,747 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:39,750 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:39,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 12 treesize of output 8 [2021-06-05 14:25:39,751 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:39,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:25:39,755 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:39,803 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:39,804 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:25:39,804 INFO L247 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:329, output treesize:112 [2021-06-05 14:25:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:40,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194493387] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:40,013 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:40,014 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:25:40,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135604069] [2021-06-05 14:25:40,014 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:25:40,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:40,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:25:40,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:25:40,014 INFO L87 Difference]: Start difference. First operand 970 states and 3809 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:40,730 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2021-06-05 14:25:40,962 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2021-06-05 14:25:41,311 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2021-06-05 14:25:41,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:41,592 INFO L93 Difference]: Finished difference Result 1213 states and 4699 transitions. [2021-06-05 14:25:41,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:25:41,592 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:25:41,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:41,594 INFO L225 Difference]: With dead ends: 1213 [2021-06-05 14:25:41,594 INFO L226 Difference]: Without dead ends: 1202 [2021-06-05 14:25:41,594 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2065.7ms TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:25:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2021-06-05 14:25:41,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 972. [2021-06-05 14:25:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 3.927909371781668) internal successors, (3814), 971 states have internal predecessors, (3814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3814 transitions. [2021-06-05 14:25:41,606 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3814 transitions. Word has length 18 [2021-06-05 14:25:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:41,606 INFO L482 AbstractCegarLoop]: Abstraction has 972 states and 3814 transitions. [2021-06-05 14:25:41,606 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3814 transitions. [2021-06-05 14:25:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:41,607 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:41,607 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:41,807 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 400 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable4907 [2021-06-05 14:25:41,807 INFO L430 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:41,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1470869184, now seen corresponding path program 254 times [2021-06-05 14:25:41,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:41,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216465034] [2021-06-05 14:25:41,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:42,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:42,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216465034] [2021-06-05 14:25:42,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216465034] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:42,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870776533] [2021-06-05 14:25:42,483 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 401 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 401 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:42,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:25:42,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:42,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 14:25:42,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:42,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:42,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:42,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:42,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:42,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 15 treesize of output 11 [2021-06-05 14:25:42,674 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:42,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:42,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:25:42,677 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:42,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:42,681 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:42,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:42,736 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:42,736 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:181, output treesize:147 [2021-06-05 14:25:42,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:42,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 25 treesize of output 19 [2021-06-05 14:25:42,836 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:42,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:42,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 26 treesize of output 20 [2021-06-05 14:25:42,840 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:42,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:42,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 16 treesize of output 12 [2021-06-05 14:25:42,844 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:42,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:42,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 29 treesize of output 23 [2021-06-05 14:25:42,848 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:42,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:42,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:25:42,853 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:42,856 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:42,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:25:42,857 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:42,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:42,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 17 treesize of output 13 [2021-06-05 14:25:42,861 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:42,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 24 [2021-06-05 14:25:42,864 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:43,006 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2021-06-05 14:25:43,006 INFO L628 ElimStorePlain]: treesize reduction 131, result has 56.2 percent of original size [2021-06-05 14:25:43,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:43,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:25:43,011 INFO L550 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:43,014 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:43,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2021-06-05 14:25:43,015 INFO L550 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:43,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:43,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:25:43,019 INFO L550 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:43,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 22 treesize of output 14 [2021-06-05 14:25:43,023 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:43,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:43,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:25:43,083 INFO L247 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:365, output treesize:134 [2021-06-05 14:25:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:43,331 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870776533] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:43,331 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:43,331 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 14:25:43,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860818089] [2021-06-05 14:25:43,331 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 14:25:43,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:43,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 14:25:43,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:25:43,332 INFO L87 Difference]: Start difference. First operand 972 states and 3814 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:43,885 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2021-06-05 14:25:44,164 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 73 [2021-06-05 14:25:44,752 WARN L205 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 78 [2021-06-05 14:25:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:45,065 INFO L93 Difference]: Finished difference Result 1232 states and 4740 transitions. [2021-06-05 14:25:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:25:45,066 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:25:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:45,068 INFO L225 Difference]: With dead ends: 1232 [2021-06-05 14:25:45,068 INFO L226 Difference]: Without dead ends: 1218 [2021-06-05 14:25:45,068 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2259.1ms TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:25:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2021-06-05 14:25:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 971. [2021-06-05 14:25:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 3.9278350515463916) internal successors, (3810), 970 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 3810 transitions. [2021-06-05 14:25:45,080 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 3810 transitions. Word has length 18 [2021-06-05 14:25:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:45,080 INFO L482 AbstractCegarLoop]: Abstraction has 971 states and 3810 transitions. [2021-06-05 14:25:45,080 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 3810 transitions. [2021-06-05 14:25:45,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:45,081 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:45,081 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:45,281 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4924,401 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:45,281 INFO L430 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:45,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1377259446, now seen corresponding path program 255 times [2021-06-05 14:25:45,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:45,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455289858] [2021-06-05 14:25:45,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:45,697 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2021-06-05 14:25:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:46,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:46,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455289858] [2021-06-05 14:25:46,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455289858] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:46,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504051676] [2021-06-05 14:25:46,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 402 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 402 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:46,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:25:46,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:46,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:46,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:46,228 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:25:46,229 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,231 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,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 35 treesize of output 27 [2021-06-05 14:25:46,242 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:46,246 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,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 25 treesize of output 19 [2021-06-05 14:25:46,249 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,285 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:46,285 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:46,286 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:151, output treesize:121 [2021-06-05 14:25:46,443 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,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 26 treesize of output 20 [2021-06-05 14:25:46,444 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:46,448 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,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 16 treesize of output 12 [2021-06-05 14:25:46,451 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 14:25:46,455 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,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 26 treesize of output 20 [2021-06-05 14:25:46,459 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,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 15 treesize of output 11 [2021-06-05 14:25:46,463 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:25:46,466 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,469 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,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 26 treesize of output 20 [2021-06-05 14:25:46,470 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,473 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:46,474 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,477 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:25:46,478 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,481 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:46,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 19 treesize of output 15 [2021-06-05 14:25:46,482 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:46,485 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:46,548 INFO L628 ElimStorePlain]: treesize reduction 169, result has 27.8 percent of original size [2021-06-05 14:25:46,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:25:46,552 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:46,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:46,574 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:25:46,575 INFO L247 ElimStorePlain]: Needed 14 recursive calls to eliminate 2 variables, input treesize:359, output treesize:57 [2021-06-05 14:25:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:46,656 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504051676] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:46,656 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:46,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:25:46,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334079171] [2021-06-05 14:25:46,656 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:25:46,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:46,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:25:46,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:25:46,657 INFO L87 Difference]: Start difference. First operand 971 states and 3810 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:47,128 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2021-06-05 14:25:47,578 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 101 [2021-06-05 14:25:47,750 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2021-06-05 14:25:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:47,898 INFO L93 Difference]: Finished difference Result 1203 states and 4681 transitions. [2021-06-05 14:25:47,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:25:47,898 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:25:47,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:47,900 INFO L225 Difference]: With dead ends: 1203 [2021-06-05 14:25:47,900 INFO L226 Difference]: Without dead ends: 1196 [2021-06-05 14:25:47,900 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1861.6ms TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:25:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2021-06-05 14:25:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 970. [2021-06-05 14:25:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.928792569659443) internal successors, (3807), 969 states have internal predecessors, (3807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3807 transitions. [2021-06-05 14:25:47,914 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3807 transitions. Word has length 18 [2021-06-05 14:25:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:47,914 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3807 transitions. [2021-06-05 14:25:47,914 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3807 transitions. [2021-06-05 14:25:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:47,916 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:47,916 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:48,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4940,402 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:48,116 INFO L430 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:48,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:48,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1371125786, now seen corresponding path program 256 times [2021-06-05 14:25:48,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:48,117 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655622862] [2021-06-05 14:25:48,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:48,652 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:48,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655622862] [2021-06-05 14:25:48,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655622862] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:48,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951704844] [2021-06-05 14:25:48,652 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 403 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 403 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:48,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:25:48,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:48,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:48,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:48,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 25 treesize of output 19 [2021-06-05 14:25:48,866 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:48,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 15 treesize of output 11 [2021-06-05 14:25:48,870 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:48,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 17 treesize of output 13 [2021-06-05 14:25:48,873 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:48,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 15 treesize of output 11 [2021-06-05 14:25:48,876 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:48,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:48,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 27 treesize of output 21 [2021-06-05 14:25:48,926 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:48,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 25 treesize of output 19 [2021-06-05 14:25:48,929 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:48,960 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:48,961 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 14:25:48,961 INFO L247 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:164, output treesize:114 [2021-06-05 14:25:49,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:49,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:25:49,042 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,045 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:49,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:49,046 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:49,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:49,050 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:49,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 20 treesize of output 16 [2021-06-05 14:25:49,054 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:49,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:25:49,057 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,060 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:49,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:25:49,061 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,064 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:49,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 15 treesize of output 11 [2021-06-05 14:25:49,065 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:49,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:25:49,068 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,071 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:49,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 26 treesize of output 20 [2021-06-05 14:25:49,072 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,075 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:25:49,075 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,078 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:49,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 19 treesize of output 15 [2021-06-05 14:25:49,079 INFO L550 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:49,083 INFO L550 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:49,147 INFO L628 ElimStorePlain]: treesize reduction 161, result has 31.5 percent of original size [2021-06-05 14:25:49,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:49,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:25:49,151 INFO L550 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:49,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-06-05 14:25:49,154 INFO L550 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:49,177 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:49,178 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2021-06-05 14:25:49,178 INFO L247 ElimStorePlain]: Needed 15 recursive calls to eliminate 2 variables, input treesize:335, output treesize:57 [2021-06-05 14:25:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:49,287 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951704844] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:49,287 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:49,287 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:25:49,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485677046] [2021-06-05 14:25:49,287 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:25:49,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:49,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:25:49,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:25:49,288 INFO L87 Difference]: Start difference. First operand 970 states and 3807 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:49,882 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 71 [2021-06-05 14:25:50,138 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 79 [2021-06-05 14:25:50,300 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2021-06-05 14:25:50,456 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-06-05 14:25:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:50,589 INFO L93 Difference]: Finished difference Result 1215 states and 4699 transitions. [2021-06-05 14:25:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:25:50,589 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:25:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:50,591 INFO L225 Difference]: With dead ends: 1215 [2021-06-05 14:25:50,591 INFO L226 Difference]: Without dead ends: 1203 [2021-06-05 14:25:50,591 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1725.6ms TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:25:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2021-06-05 14:25:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 968. [2021-06-05 14:25:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 3.9317476732161323) internal successors, (3802), 967 states have internal predecessors, (3802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 3802 transitions. [2021-06-05 14:25:50,603 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 3802 transitions. Word has length 18 [2021-06-05 14:25:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:50,603 INFO L482 AbstractCegarLoop]: Abstraction has 968 states and 3802 transitions. [2021-06-05 14:25:50,603 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 3802 transitions. [2021-06-05 14:25:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:50,604 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:50,604 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:50,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4956,403 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:50,805 INFO L430 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:50,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:50,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1768721062, now seen corresponding path program 257 times [2021-06-05 14:25:50,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:50,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780212405] [2021-06-05 14:25:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:50,984 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:50,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780212405] [2021-06-05 14:25:50,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780212405] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:50,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479374449] [2021-06-05 14:25:50,984 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 404 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 404 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:51,010 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:25:51,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:51,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:51,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:51,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:51,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:51,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 25 treesize of output 19 [2021-06-05 14:25:51,106 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:51,109 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:51,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:25:51,109 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:51,138 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:51,138 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:51,139 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:78 [2021-06-05 14:25:51,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:51,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:51,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 27 treesize of output 21 [2021-06-05 14:25:51,329 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:51,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:51,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 25 treesize of output 19 [2021-06-05 14:25:51,333 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:51,361 INFO L628 ElimStorePlain]: treesize reduction 66, result has 38.9 percent of original size [2021-06-05 14:25:51,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:51,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 22 treesize of output 14 [2021-06-05 14:25:51,364 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:51,374 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:51,374 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:25:51,374 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:25:51,375 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:51,375 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:124, output treesize:16 [2021-06-05 14:25:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:51,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479374449] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:51,391 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:51,391 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:25:51,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391808730] [2021-06-05 14:25:51,391 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:25:51,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:51,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:25:51,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:25:51,391 INFO L87 Difference]: Start difference. First operand 968 states and 3802 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:51,744 INFO L93 Difference]: Finished difference Result 1004 states and 3893 transitions. [2021-06-05 14:25:51,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:25:51,744 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:51,745 INFO L225 Difference]: With dead ends: 1004 [2021-06-05 14:25:51,746 INFO L226 Difference]: Without dead ends: 999 [2021-06-05 14:25:51,746 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 434.9ms TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:25:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2021-06-05 14:25:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 976. [2021-06-05 14:25:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 3.927179487179487) internal successors, (3829), 975 states have internal predecessors, (3829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:51,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 3829 transitions. [2021-06-05 14:25:51,756 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 3829 transitions. Word has length 18 [2021-06-05 14:25:51,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:51,756 INFO L482 AbstractCegarLoop]: Abstraction has 976 states and 3829 transitions. [2021-06-05 14:25:51,756 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:25:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 3829 transitions. [2021-06-05 14:25:51,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:51,757 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:51,757 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:51,957 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4979,404 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:51,958 INFO L430 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:51,958 INFO L82 PathProgramCache]: Analyzing trace with hash -171267684, now seen corresponding path program 258 times [2021-06-05 14:25:51,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:51,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234184929] [2021-06-05 14:25:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:52,155 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:52,155 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234184929] [2021-06-05 14:25:52,155 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234184929] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:52,155 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760410671] [2021-06-05 14:25:52,155 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 405 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 405 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:52,181 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:25:52,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:52,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:52,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:52,288 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:52,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:52,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 25 treesize of output 19 [2021-06-05 14:25:52,290 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:52,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:52,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 15 treesize of output 11 [2021-06-05 14:25:52,294 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:52,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:52,325 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:52,325 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:74 [2021-06-05 14:25:52,403 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:52,404 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:52,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:25:52,405 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:52,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:52,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 25 treesize of output 19 [2021-06-05 14:25:52,409 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:52,469 INFO L628 ElimStorePlain]: treesize reduction 96, result has 42.5 percent of original size [2021-06-05 14:25:52,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:25:52,473 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:52,496 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:52,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:52,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 11 treesize of output 7 [2021-06-05 14:25:52,499 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:52,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:52,521 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1034 vanished before elimination [2021-06-05 14:25:52,523 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:52,523 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:185, output treesize:44 [2021-06-05 14:25:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:52,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760410671] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:52,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:52,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:25:52,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526383902] [2021-06-05 14:25:52,580 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:25:52,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:52,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:25:52,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:25:52,581 INFO L87 Difference]: Start difference. First operand 976 states and 3829 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:25:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:52,855 INFO L93 Difference]: Finished difference Result 1014 states and 3925 transitions. [2021-06-05 14:25:52,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:25:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:25:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:52,857 INFO L225 Difference]: With dead ends: 1014 [2021-06-05 14:25:52,857 INFO L226 Difference]: Without dead ends: 1009 [2021-06-05 14:25:52,857 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 395.6ms TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:25:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-06-05 14:25:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 973. [2021-06-05 14:25:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 3.9269547325102883) internal successors, (3817), 972 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 3817 transitions. [2021-06-05 14:25:52,868 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 3817 transitions. Word has length 18 [2021-06-05 14:25:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:52,868 INFO L482 AbstractCegarLoop]: Abstraction has 973 states and 3817 transitions. [2021-06-05 14:25:52,868 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:25:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 3817 transitions. [2021-06-05 14:25:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:52,869 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:52,869 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:53,069 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 405 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5003 [2021-06-05 14:25:53,070 INFO L430 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:53,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:53,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1045008364, now seen corresponding path program 259 times [2021-06-05 14:25:53,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:53,070 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897815045] [2021-06-05 14:25:53,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:53,282 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:53,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897815045] [2021-06-05 14:25:53,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897815045] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:53,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651789607] [2021-06-05 14:25:53,282 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 406 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 406 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:53,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:53,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:53,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:25:53,415 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:53,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:25:53,418 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:53,433 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:53,434 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:53,434 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:68, output treesize:54 [2021-06-05 14:25:53,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:53,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 25 treesize of output 19 [2021-06-05 14:25:53,483 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:53,485 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:53,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:25:53,486 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:53,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:53,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:25:53,490 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:53,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:53,493 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:53,529 INFO L628 ElimStorePlain]: treesize reduction 70, result has 38.1 percent of original size [2021-06-05 14:25:53,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 11 treesize of output 7 [2021-06-05 14:25:53,532 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:53,546 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:53,547 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:53,547 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:25:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:53,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651789607] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:53,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:53,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:25:53,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842770872] [2021-06-05 14:25:53,606 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:25:53,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:53,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:25:53,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:25:53,606 INFO L87 Difference]: Start difference. First operand 973 states and 3817 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:54,251 INFO L93 Difference]: Finished difference Result 1009 states and 3915 transitions. [2021-06-05 14:25:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:25:54,251 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:25:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:54,253 INFO L225 Difference]: With dead ends: 1009 [2021-06-05 14:25:54,253 INFO L226 Difference]: Without dead ends: 1004 [2021-06-05 14:25:54,253 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 685.5ms TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:25:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2021-06-05 14:25:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 970. [2021-06-05 14:25:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9298245614035086) internal successors, (3808), 969 states have internal predecessors, (3808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3808 transitions. [2021-06-05 14:25:54,263 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3808 transitions. Word has length 18 [2021-06-05 14:25:54,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:54,263 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3808 transitions. [2021-06-05 14:25:54,263 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3808 transitions. [2021-06-05 14:25:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:54,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:54,264 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:54,464 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 406 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5014 [2021-06-05 14:25:54,465 INFO L430 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:54,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:54,465 INFO L82 PathProgramCache]: Analyzing trace with hash -496091954, now seen corresponding path program 260 times [2021-06-05 14:25:54,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:54,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831195495] [2021-06-05 14:25:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:54,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:54,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831195495] [2021-06-05 14:25:54,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831195495] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:54,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064022406] [2021-06-05 14:25:54,740 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 407 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 407 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:54,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:25:54,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:54,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:54,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:54,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:54,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:54,856 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:54,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:54,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 26 treesize of output 20 [2021-06-05 14:25:54,860 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:54,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:54,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 25 treesize of output 19 [2021-06-05 14:25:54,863 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:54,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:25:54,866 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:54,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:54,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:54,913 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 14:25:55,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 17 treesize of output 13 [2021-06-05 14:25:55,065 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:55,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 19 treesize of output 15 [2021-06-05 14:25:55,067 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:55,079 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 14:25:55,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 11 treesize of output 7 [2021-06-05 14:25:55,082 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:25:55,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:55,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:55,088 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 14:25:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:55,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064022406] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:55,115 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:55,115 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:25:55,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385787268] [2021-06-05 14:25:55,115 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:25:55,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:55,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:25:55,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:25:55,115 INFO L87 Difference]: Start difference. First operand 970 states and 3808 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:55,504 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2021-06-05 14:25:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:55,821 INFO L93 Difference]: Finished difference Result 1010 states and 3910 transitions. [2021-06-05 14:25:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:25:55,822 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:25:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:55,823 INFO L225 Difference]: With dead ends: 1010 [2021-06-05 14:25:55,823 INFO L226 Difference]: Without dead ends: 1005 [2021-06-05 14:25:55,823 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 902.4ms TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:25:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2021-06-05 14:25:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 977. [2021-06-05 14:25:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.930327868852459) internal successors, (3836), 976 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3836 transitions. [2021-06-05 14:25:55,834 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3836 transitions. Word has length 18 [2021-06-05 14:25:55,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:55,834 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3836 transitions. [2021-06-05 14:25:55,834 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3836 transitions. [2021-06-05 14:25:55,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:55,835 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:55,835 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:56,036 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 407 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5024 [2021-06-05 14:25:56,036 INFO L430 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:56,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1858886596, now seen corresponding path program 261 times [2021-06-05 14:25:56,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:56,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254247805] [2021-06-05 14:25:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:56,321 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:56,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254247805] [2021-06-05 14:25:56,322 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254247805] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:56,322 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679447062] [2021-06-05 14:25:56,322 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 408 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 408 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:56,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:25:56,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:56,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:25:56,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:56,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:25:56,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:56,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,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 15 treesize of output 11 [2021-06-05 14:25:56,479 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:56,482 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,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 26 treesize of output 20 [2021-06-05 14:25:56,484 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:56,488 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,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 25 treesize of output 19 [2021-06-05 14:25:56,489 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:56,557 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:56,562 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:25:56,562 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:191, output treesize:159 [2021-06-05 14:25:56,749 INFO L446 ElimStorePlain]: Different costs {1=[array_2], 3=[array_4]} [2021-06-05 14:25:56,752 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,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:25:56,753 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:56,756 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,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 25 treesize of output 19 [2021-06-05 14:25:56,758 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:56,760 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,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 35 treesize of output 27 [2021-06-05 14:25:56,762 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:56,764 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:56,765 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:56,823 INFO L628 ElimStorePlain]: treesize reduction 85, result has 45.2 percent of original size [2021-06-05 14:25:56,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:56,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:25:56,826 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:56,848 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:56,849 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:56,849 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:193, output treesize:44 [2021-06-05 14:25:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:56,921 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679447062] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:56,921 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:56,921 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:25:56,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983028398] [2021-06-05 14:25:56,921 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:25:56,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:56,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:25:56,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:25:56,921 INFO L87 Difference]: Start difference. First operand 977 states and 3836 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:25:57,281 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2021-06-05 14:25:57,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:57,549 INFO L93 Difference]: Finished difference Result 1026 states and 3966 transitions. [2021-06-05 14:25:57,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:25:57,549 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:25:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:57,551 INFO L225 Difference]: With dead ends: 1026 [2021-06-05 14:25:57,551 INFO L226 Difference]: Without dead ends: 1021 [2021-06-05 14:25:57,551 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 827.2ms TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:25:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-06-05 14:25:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 970. [2021-06-05 14:25:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9298245614035086) internal successors, (3808), 969 states have internal predecessors, (3808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3808 transitions. [2021-06-05 14:25:57,562 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3808 transitions. Word has length 18 [2021-06-05 14:25:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:57,562 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3808 transitions. [2021-06-05 14:25:57,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:25:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3808 transitions. [2021-06-05 14:25:57,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:57,563 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:57,563 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:57,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5038,408 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:57,763 INFO L430 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash -288998972, now seen corresponding path program 262 times [2021-06-05 14:25:57,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:57,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782583583] [2021-06-05 14:25:57,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:58,018 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:58,018 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782583583] [2021-06-05 14:25:58,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782583583] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:58,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669514651] [2021-06-05 14:25:58,019 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 409 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 409 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:58,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:25:58,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:58,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:25:58,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:58,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,118 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:25:58,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:58,122 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,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 16 treesize of output 12 [2021-06-05 14:25:58,124 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:58,126 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:25:58,128 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:58,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,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 25 treesize of output 19 [2021-06-05 14:25:58,131 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:58,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:58,191 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:25:58,191 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:165 [2021-06-05 14:25:58,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:58,348 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:58,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:25:58,352 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:58,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:25:58,356 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:58,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25: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 15 treesize of output 11 [2021-06-05 14:25:58,360 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:58,431 INFO L628 ElimStorePlain]: treesize reduction 97, result has 45.8 percent of original size [2021-06-05 14:25:58,435 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:58,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 22 treesize of output 14 [2021-06-05 14:25:58,436 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:58,466 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:58,467 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:25:58,467 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:217, output treesize:68 [2021-06-05 14:25:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:58,609 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669514651] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:58,609 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:25:58,609 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 14:25:58,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803613071] [2021-06-05 14:25:58,609 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:25:58,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:25:58,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:25:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:25:58,610 INFO L87 Difference]: Start difference. First operand 970 states and 3808 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:25:58,851 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2021-06-05 14:25:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:25:59,042 INFO L93 Difference]: Finished difference Result 1014 states and 3928 transitions. [2021-06-05 14:25:59,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:25:59,042 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:25:59,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:25:59,043 INFO L225 Difference]: With dead ends: 1014 [2021-06-05 14:25:59,043 INFO L226 Difference]: Without dead ends: 1001 [2021-06-05 14:25:59,044 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 735.1ms TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:25:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-06-05 14:25:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 969. [2021-06-05 14:25:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 3.9307851239669422) internal successors, (3805), 968 states have internal predecessors, (3805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:25:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 3805 transitions. [2021-06-05 14:25:59,054 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 3805 transitions. Word has length 18 [2021-06-05 14:25:59,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:25:59,054 INFO L482 AbstractCegarLoop]: Abstraction has 969 states and 3805 transitions. [2021-06-05 14:25:59,054 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:25:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 3805 transitions. [2021-06-05 14:25:59,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:25:59,055 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:25:59,055 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:25:59,255 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 409 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5065 [2021-06-05 14:25:59,255 INFO L430 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:25:59,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:25:59,256 INFO L82 PathProgramCache]: Analyzing trace with hash -938991094, now seen corresponding path program 263 times [2021-06-05 14:25:59,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:25:59,256 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003329148] [2021-06-05 14:25:59,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:25:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:25:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:25:59,632 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:25:59,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003329148] [2021-06-05 14:25:59,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003329148] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:25:59,632 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480320718] [2021-06-05 14:25:59,632 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 410 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 410 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:25:59,660 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:25:59,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:25:59,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 14:25:59,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:25:59,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:59,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:59,937 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 14:25:59,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 28 [2021-06-05 14:25:59,938 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:59,941 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:59,943 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:25:59,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 16 [2021-06-05 14:25:59,944 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:59,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:25:59,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:59,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:59,990 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:25:59,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 14:25:59,991 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:25:59,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:25:59,995 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 14:25:59,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 32 [2021-06-05 14:25:59,996 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:00,044 INFO L628 ElimStorePlain]: treesize reduction 31, result has 71.0 percent of original size [2021-06-05 14:26:00,046 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2021-06-05 14:26:00,047 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:175, output treesize:72 [2021-06-05 14:26:00,178 INFO L446 ElimStorePlain]: Different costs {0=[array_2, v_prenex_1045], 1=[array_4, v_prenex_1046]} [2021-06-05 14:26:00,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 15 treesize of output 11 [2021-06-05 14:26:00,182 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:00,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 25 treesize of output 19 [2021-06-05 14:26:00,185 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:00,218 INFO L628 ElimStorePlain]: treesize reduction 58, result has 46.8 percent of original size [2021-06-05 14:26:00,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 19 treesize of output 15 [2021-06-05 14:26:00,221 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:00,231 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:00,231 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:26:00,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:00,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 11 treesize of output 7 [2021-06-05 14:26:00,235 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:00,245 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:00,246 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 14:26:00,246 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:123, output treesize:24 [2021-06-05 14:26:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:00,280 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480320718] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:00,280 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:00,280 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 14:26:00,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96462085] [2021-06-05 14:26:00,280 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:26:00,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:26:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:26:00,281 INFO L87 Difference]: Start difference. First operand 969 states and 3805 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 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:26:00,817 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2021-06-05 14:26:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:01,240 INFO L93 Difference]: Finished difference Result 1046 states and 4019 transitions. [2021-06-05 14:26:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:26:01,240 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 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:26:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:01,242 INFO L225 Difference]: With dead ends: 1046 [2021-06-05 14:26:01,242 INFO L226 Difference]: Without dead ends: 1036 [2021-06-05 14:26:01,242 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1135.4ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:26:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-06-05 14:26:01,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 970. [2021-06-05 14:26:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.9308565531475748) internal successors, (3809), 969 states have internal predecessors, (3809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3809 transitions. [2021-06-05 14:26:01,252 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3809 transitions. Word has length 18 [2021-06-05 14:26:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:01,252 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3809 transitions. [2021-06-05 14:26:01,252 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 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:26:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3809 transitions. [2021-06-05 14:26:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:01,253 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:01,253 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:01,454 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 410 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5082 [2021-06-05 14:26:01,454 INFO L430 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:01,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:01,454 INFO L82 PathProgramCache]: Analyzing trace with hash -270512050, now seen corresponding path program 264 times [2021-06-05 14:26:01,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:01,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634488853] [2021-06-05 14:26:01,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 14:26:01,501 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:01,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634488853] [2021-06-05 14:26:01,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634488853] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:01,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700981304] [2021-06-05 14:26:01,501 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 411 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 411 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:01,527 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:26:01,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:01,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 14:26:01,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:01,590 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:01,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 15 treesize of output 11 [2021-06-05 14:26:01,592 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:01,594 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:01,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:01,595 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:01,597 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:01,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 26 treesize of output 20 [2021-06-05 14:26:01,598 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:01,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 16 treesize of output 12 [2021-06-05 14:26:01,601 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:01,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:01,639 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:01,639 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:123, output treesize:87 [2021-06-05 14:26:01,719 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:01,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:26:01,720 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:01,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:01,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:26:01,723 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:01,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:01,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:26:01,726 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:01,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:26:01,729 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:01,758 INFO L628 ElimStorePlain]: treesize reduction 60, result has 31.0 percent of original size [2021-06-05 14:26:01,758 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:26:01,758 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:01,758 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:27 [2021-06-05 14:26:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:01,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700981304] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:01,785 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:01,785 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2021-06-05 14:26:01,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348899139] [2021-06-05 14:26:01,786 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:26:01,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:01,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:26:01,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:26:01,786 INFO L87 Difference]: Start difference. First operand 970 states and 3809 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:26:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:02,636 INFO L93 Difference]: Finished difference Result 1214 states and 4427 transitions. [2021-06-05 14:26:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 14:26:02,637 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:26:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:02,638 INFO L225 Difference]: With dead ends: 1214 [2021-06-05 14:26:02,638 INFO L226 Difference]: Without dead ends: 1133 [2021-06-05 14:26:02,639 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 727.4ms TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 14:26:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-06-05 14:26:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 970. [2021-06-05 14:26:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.937048503611971) internal successors, (3815), 969 states have internal predecessors, (3815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3815 transitions. [2021-06-05 14:26:02,650 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3815 transitions. Word has length 18 [2021-06-05 14:26:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:02,650 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3815 transitions. [2021-06-05 14:26:02,650 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 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:26:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3815 transitions. [2021-06-05 14:26:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:02,651 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:02,651 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:02,851 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5117,411 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:02,852 INFO L430 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1617696392, now seen corresponding path program 265 times [2021-06-05 14:26:02,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:02,852 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447797938] [2021-06-05 14:26:02,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:03,579 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:03,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447797938] [2021-06-05 14:26:03,579 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447797938] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:03,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052960049] [2021-06-05 14:26:03,580 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 412 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 412 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:03,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:03,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:03,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:03,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:03,702 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:03,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:03,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:26:03,705 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:03,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:03,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:26:03,709 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:03,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 15 treesize of output 11 [2021-06-05 14:26:03,712 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:03,752 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:03,753 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:03,753 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:123 [2021-06-05 14:26:03,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:03,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:03,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 25 treesize of output 19 [2021-06-05 14:26:03,886 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:03,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:03,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:03,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 35 treesize of output 27 [2021-06-05 14:26:03,890 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:03,892 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:03,893 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:03,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:03,894 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:03,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:03,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:03,897 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:03,958 INFO L628 ElimStorePlain]: treesize reduction 74, result has 42.6 percent of original size [2021-06-05 14:26:03,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:03,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 22 treesize of output 14 [2021-06-05 14:26:03,961 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:03,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:03,978 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:03,978 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:163, output treesize:41 [2021-06-05 14:26:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:04,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052960049] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:04,059 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:04,059 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2021-06-05 14:26:04,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619172324] [2021-06-05 14:26:04,059 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:26:04,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:04,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:26:04,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:26:04,059 INFO L87 Difference]: Start difference. First operand 970 states and 3815 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:26:04,539 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 14:26:04,762 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2021-06-05 14:26:05,058 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-06-05 14:26:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:05,111 INFO L93 Difference]: Finished difference Result 1006 states and 3914 transitions. [2021-06-05 14:26:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:05,111 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:26:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:05,113 INFO L225 Difference]: With dead ends: 1006 [2021-06-05 14:26:05,113 INFO L226 Difference]: Without dead ends: 1001 [2021-06-05 14:26:05,113 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1553.2ms TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:26:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2021-06-05 14:26:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 970. [2021-06-05 14:26:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.937048503611971) internal successors, (3815), 969 states have internal predecessors, (3815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3815 transitions. [2021-06-05 14:26:05,122 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3815 transitions. Word has length 18 [2021-06-05 14:26:05,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:05,122 INFO L482 AbstractCegarLoop]: Abstraction has 970 states and 3815 transitions. [2021-06-05 14:26:05,123 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:26:05,123 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3815 transitions. [2021-06-05 14:26:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:05,124 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:05,124 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:05,324 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 412 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5128 [2021-06-05 14:26:05,324 INFO L430 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:05,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:05,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1666033298, now seen corresponding path program 266 times [2021-06-05 14:26:05,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:05,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883719939] [2021-06-05 14:26:05,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:05,712 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2021-06-05 14:26:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:05,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:05,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883719939] [2021-06-05 14:26:05,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883719939] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:05,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948593557] [2021-06-05 14:26:05,991 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 413 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 413 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:06,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:26:06,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:06,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:06,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:06,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:06,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 16 treesize of output 12 [2021-06-05 14:26:06,144 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:06,146 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:06,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:26:06,147 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:06,150 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:06,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:06,151 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:06,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:06,154 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:06,199 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:06,200 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:06,200 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:125 [2021-06-05 14:26:06,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 17 treesize of output 13 [2021-06-05 14:26:06,367 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:06,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 19 treesize of output 15 [2021-06-05 14:26:06,369 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:06,381 INFO L628 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2021-06-05 14:26:06,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 11 treesize of output 7 [2021-06-05 14:26:06,384 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:06,389 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:06,390 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:06,390 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:16 [2021-06-05 14:26:06,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:06,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948593557] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:06,421 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:06,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:26:06,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149076078] [2021-06-05 14:26:06,421 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:26:06,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:06,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:26:06,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:26:06,421 INFO L87 Difference]: Start difference. First operand 970 states and 3815 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:07,013 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 55 [2021-06-05 14:26:07,221 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 55 [2021-06-05 14:26:07,477 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 61 [2021-06-05 14:26:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:07,621 INFO L93 Difference]: Finished difference Result 1055 states and 4054 transitions. [2021-06-05 14:26:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:26:07,621 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:26:07,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:07,623 INFO L225 Difference]: With dead ends: 1055 [2021-06-05 14:26:07,623 INFO L226 Difference]: Without dead ends: 1045 [2021-06-05 14:26:07,623 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1658.1ms TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:26:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2021-06-05 14:26:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 973. [2021-06-05 14:26:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 3.9372427983539096) internal successors, (3827), 972 states have internal predecessors, (3827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 3827 transitions. [2021-06-05 14:26:07,633 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 3827 transitions. Word has length 18 [2021-06-05 14:26:07,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:07,633 INFO L482 AbstractCegarLoop]: Abstraction has 973 states and 3827 transitions. [2021-06-05 14:26:07,633 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 3827 transitions. [2021-06-05 14:26:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:07,635 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:07,635 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:07,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 413 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5143 [2021-06-05 14:26:07,835 INFO L430 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:07,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:07,835 INFO L82 PathProgramCache]: Analyzing trace with hash -702614904, now seen corresponding path program 267 times [2021-06-05 14:26:07,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:07,835 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493212046] [2021-06-05 14:26:07,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:08,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:08,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:08,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493212046] [2021-06-05 14:26:08,121 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493212046] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:08,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216563422] [2021-06-05 14:26:08,121 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 414 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 414 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:08,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:26:08,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:08,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:08,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:08,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:08,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:26:08,256 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:08,258 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:08,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:08,259 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:08,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:08,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 26 treesize of output 20 [2021-06-05 14:26:08,263 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:08,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:26:08,266 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:08,318 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:08,320 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:08,320 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 14:26:08,471 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:08,472 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:08,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:08,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:08,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:08,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 27 treesize of output 21 [2021-06-05 14:26:08,477 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:08,530 INFO L628 ElimStorePlain]: treesize reduction 83, result has 42.8 percent of original size [2021-06-05 14:26:08,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:08,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:26:08,534 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:08,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:08,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 7 treesize of output 5 [2021-06-05 14:26:08,557 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:08,576 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:08,576 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1047 vanished before elimination [2021-06-05 14:26:08,578 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:08,578 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:167, output treesize:35 [2021-06-05 14:26:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:08,638 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216563422] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:08,638 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:08,638 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:26:08,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386743737] [2021-06-05 14:26:08,639 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:08,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:08,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:08,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:08,639 INFO L87 Difference]: Start difference. First operand 973 states and 3827 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:09,093 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2021-06-05 14:26:09,260 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-06-05 14:26:09,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:09,608 INFO L93 Difference]: Finished difference Result 1040 states and 4021 transitions. [2021-06-05 14:26:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:26:09,608 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:09,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:09,610 INFO L225 Difference]: With dead ends: 1040 [2021-06-05 14:26:09,610 INFO L226 Difference]: Without dead ends: 1030 [2021-06-05 14:26:09,610 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1097.8ms TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:26:09,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2021-06-05 14:26:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 977. [2021-06-05 14:26:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.935450819672131) internal successors, (3841), 976 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3841 transitions. [2021-06-05 14:26:09,620 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3841 transitions. Word has length 18 [2021-06-05 14:26:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:09,620 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3841 transitions. [2021-06-05 14:26:09,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3841 transitions. [2021-06-05 14:26:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:09,622 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:09,622 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:09,822 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 414 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5157 [2021-06-05 14:26:09,822 INFO L430 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:09,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:09,822 INFO L82 PathProgramCache]: Analyzing trace with hash -591633002, now seen corresponding path program 268 times [2021-06-05 14:26:09,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:09,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158036470] [2021-06-05 14:26:09,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:10,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:10,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158036470] [2021-06-05 14:26:10,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158036470] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:10,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526508627] [2021-06-05 14:26:10,019 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 415 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 415 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:10,052 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:26:10,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:10,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:26:10,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:10,153 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:10,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:26:10,154 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:10,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 25 treesize of output 19 [2021-06-05 14:26:10,157 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:10,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:10,186 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:10,186 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:75 [2021-06-05 14:26:10,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:10,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:10,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 25 treesize of output 19 [2021-06-05 14:26:10,294 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:10,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:10,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:10,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:26:10,297 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:10,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:10,300 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:10,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 25 treesize of output 19 [2021-06-05 14:26:10,301 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:10,304 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:10,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 35 treesize of output 27 [2021-06-05 14:26:10,305 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:10,351 INFO L628 ElimStorePlain]: treesize reduction 77, result has 43.0 percent of original size [2021-06-05 14:26:10,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:10,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 22 treesize of output 14 [2021-06-05 14:26:10,354 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:10,372 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:10,373 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:10,373 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:169, output treesize:44 [2021-06-05 14:26:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:10,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526508627] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:10,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:10,449 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 14:26:10,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380823845] [2021-06-05 14:26:10,449 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:26:10,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:10,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:26:10,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:26:10,450 INFO L87 Difference]: Start difference. First operand 977 states and 3841 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:26:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:10,958 INFO L93 Difference]: Finished difference Result 1050 states and 4071 transitions. [2021-06-05 14:26:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:10,959 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:26:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:10,960 INFO L225 Difference]: With dead ends: 1050 [2021-06-05 14:26:10,960 INFO L226 Difference]: Without dead ends: 1037 [2021-06-05 14:26:10,960 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 595.4ms TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:26:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2021-06-05 14:26:10,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 983. [2021-06-05 14:26:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 3.9297352342158858) internal successors, (3859), 982 states have internal predecessors, (3859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 3859 transitions. [2021-06-05 14:26:10,971 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 3859 transitions. Word has length 18 [2021-06-05 14:26:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:10,971 INFO L482 AbstractCegarLoop]: Abstraction has 983 states and 3859 transitions. [2021-06-05 14:26:10,971 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:26:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 3859 transitions. [2021-06-05 14:26:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:10,972 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:10,972 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:11,172 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 415 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5172 [2021-06-05 14:26:11,172 INFO L430 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:11,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1763345548, now seen corresponding path program 269 times [2021-06-05 14:26:11,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:11,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494913380] [2021-06-05 14:26:11,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:11,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:11,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494913380] [2021-06-05 14:26:11,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494913380] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:11,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597057332] [2021-06-05 14:26:11,386 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 416 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 416 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:11,413 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:26:11,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:11,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:11,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:11,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:11,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:11,508 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:11,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:11,511 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:11,535 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:11,536 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:11,536 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:69 [2021-06-05 14:26:11,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:11,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:11,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 25 treesize of output 19 [2021-06-05 14:26:11,661 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:11,664 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:11,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:11,665 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:11,719 INFO L628 ElimStorePlain]: treesize reduction 91, result has 42.0 percent of original size [2021-06-05 14:26:11,719 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1050 vanished before elimination [2021-06-05 14:26:11,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:11,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 27 treesize of output 21 [2021-06-05 14:26:11,722 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:11,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:11,744 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:11,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 22 treesize of output 14 [2021-06-05 14:26:11,745 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:11,763 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:11,764 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:11,764 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 14:26:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:11,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597057332] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:11,824 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:11,824 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:26:11,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371988161] [2021-06-05 14:26:11,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:11,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:11,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:11,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:11,825 INFO L87 Difference]: Start difference. First operand 983 states and 3859 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:12,306 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2021-06-05 14:26:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:12,549 INFO L93 Difference]: Finished difference Result 1052 states and 4088 transitions. [2021-06-05 14:26:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:12,550 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:12,551 INFO L225 Difference]: With dead ends: 1052 [2021-06-05 14:26:12,551 INFO L226 Difference]: Without dead ends: 1047 [2021-06-05 14:26:12,551 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 788.1ms TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:26:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2021-06-05 14:26:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 980. [2021-06-05 14:26:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 14:26:12,562 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 14:26:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:12,562 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 14:26:12,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 14:26:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:12,563 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:12,563 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:12,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5185,416 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:12,763 INFO L430 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash 889604868, now seen corresponding path program 270 times [2021-06-05 14:26:12,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:12,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629963962] [2021-06-05 14:26:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:13,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:13,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629963962] [2021-06-05 14:26:13,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629963962] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:13,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727990287] [2021-06-05 14:26:13,007 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 417 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 417 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:13,041 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:26:13,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:13,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:13,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:13,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:13,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 25 treesize of output 19 [2021-06-05 14:26:13,145 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:13,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:13,148 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:13,168 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:13,168 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:13,168 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:77, output treesize:59 [2021-06-05 14:26:13,216 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1053], 1=[v_prenex_1054, array_4]} [2021-06-05 14:26:13,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 25 treesize of output 19 [2021-06-05 14:26:13,219 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:13,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:13,222 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:13,263 INFO L628 ElimStorePlain]: treesize reduction 75, result has 41.9 percent of original size [2021-06-05 14:26:13,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:26:13,266 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:13,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:13,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:26:13,283 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:13,296 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:13,297 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:26:13,297 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:13,297 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 14:26:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:13,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727990287] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:13,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:13,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:26:13,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801244052] [2021-06-05 14:26:13,358 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:26:13,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:13,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:26:13,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:26:13,358 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:14,092 INFO L93 Difference]: Finished difference Result 1068 states and 4122 transitions. [2021-06-05 14:26:14,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:14,093 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:26:14,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:14,094 INFO L225 Difference]: With dead ends: 1068 [2021-06-05 14:26:14,094 INFO L226 Difference]: Without dead ends: 1063 [2021-06-05 14:26:14,094 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 755.8ms TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:26:14,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-06-05 14:26:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 983. [2021-06-05 14:26:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 3.9327902240325865) internal successors, (3862), 982 states have internal predecessors, (3862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 3862 transitions. [2021-06-05 14:26:14,105 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 3862 transitions. Word has length 18 [2021-06-05 14:26:14,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:14,105 INFO L482 AbstractCegarLoop]: Abstraction has 983 states and 3862 transitions. [2021-06-05 14:26:14,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 3862 transitions. [2021-06-05 14:26:14,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:14,106 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:14,106 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:14,306 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 417 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5210 [2021-06-05 14:26:14,307 INFO L430 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:14,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash -781371148, now seen corresponding path program 271 times [2021-06-05 14:26:14,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:14,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192214554] [2021-06-05 14:26:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:14,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:14,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192214554] [2021-06-05 14:26:14,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192214554] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:14,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562011398] [2021-06-05 14:26:14,539 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 418 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 418 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:14,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:26:14,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:14,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:14,667 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:14,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 15 treesize of output 11 [2021-06-05 14:26:14,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:14,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:14,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 25 treesize of output 19 [2021-06-05 14:26:14,671 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:14,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:14,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:14,700 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:75 [2021-06-05 14:26:14,854 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 14:26:14,857 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:14,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 35 treesize of output 27 [2021-06-05 14:26:14,858 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:14,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:14,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:26:14,862 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:14,865 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:14,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:14,866 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26: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 25 treesize of output 19 [2021-06-05 14:26:14,870 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:14,918 INFO L628 ElimStorePlain]: treesize reduction 87, result has 42.4 percent of original size [2021-06-05 14:26:14,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:14,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:26:14,921 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:14,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:14,942 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:14,942 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:181, output treesize:38 [2021-06-05 14:26:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:15,002 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562011398] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:15,002 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:15,002 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2021-06-05 14:26:15,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745641029] [2021-06-05 14:26:15,002 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:26:15,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:15,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:26:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:26:15,002 INFO L87 Difference]: Start difference. First operand 983 states and 3862 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:26:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:15,483 INFO L93 Difference]: Finished difference Result 1051 states and 4076 transitions. [2021-06-05 14:26:15,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:15,484 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:26:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:15,485 INFO L225 Difference]: With dead ends: 1051 [2021-06-05 14:26:15,485 INFO L226 Difference]: Without dead ends: 1040 [2021-06-05 14:26:15,485 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 588.6ms TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:26:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2021-06-05 14:26:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 977. [2021-06-05 14:26:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.935450819672131) internal successors, (3841), 976 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3841 transitions. [2021-06-05 14:26:15,495 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3841 transitions. Word has length 18 [2021-06-05 14:26:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:15,495 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3841 transitions. [2021-06-05 14:26:15,495 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 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:26:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3841 transitions. [2021-06-05 14:26:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:15,497 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:15,497 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:15,697 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5221,418 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:15,697 INFO L430 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 318150062, now seen corresponding path program 272 times [2021-06-05 14:26:15,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:15,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744483832] [2021-06-05 14:26:15,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:15,889 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:15,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744483832] [2021-06-05 14:26:15,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744483832] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:15,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934671704] [2021-06-05 14:26:15,889 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 419 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 419 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:15,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:26:15,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:15,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:15,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:15,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:15,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:15,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:15,993 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:15,995 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:15,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:15,996 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:16,016 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:16,017 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:16,017 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:55 [2021-06-05 14:26:16,107 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1058], 1=[array_4, v_prenex_1059]} [2021-06-05 14:26:16,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 15 treesize of output 11 [2021-06-05 14:26:16,111 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:16,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 17 treesize of output 13 [2021-06-05 14:26:16,114 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:16,161 INFO L628 ElimStorePlain]: treesize reduction 81, result has 42.6 percent of original size [2021-06-05 14:26:16,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 27 treesize of output 21 [2021-06-05 14:26:16,164 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:16,181 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:16,181 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:26:16,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:16,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 11 treesize of output 7 [2021-06-05 14:26:16,184 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:16,201 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:16,201 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:16,201 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 14:26:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:16,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934671704] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:16,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:16,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:26:16,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248288080] [2021-06-05 14:26:16,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:16,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:16,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:16,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:16,270 INFO L87 Difference]: Start difference. First operand 977 states and 3841 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:16,830 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-06-05 14:26:16,991 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2021-06-05 14:26:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:17,167 INFO L93 Difference]: Finished difference Result 1151 states and 4413 transitions. [2021-06-05 14:26:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:26:17,167 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:17,169 INFO L225 Difference]: With dead ends: 1151 [2021-06-05 14:26:17,169 INFO L226 Difference]: Without dead ends: 1141 [2021-06-05 14:26:17,169 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 839.3ms TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:26:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2021-06-05 14:26:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 977. [2021-06-05 14:26:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 3.935450819672131) internal successors, (3841), 976 states have internal predecessors, (3841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 3841 transitions. [2021-06-05 14:26:17,180 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 3841 transitions. Word has length 18 [2021-06-05 14:26:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:17,180 INFO L482 AbstractCegarLoop]: Abstraction has 977 states and 3841 transitions. [2021-06-05 14:26:17,180 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 3841 transitions. [2021-06-05 14:26:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:17,181 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:17,181 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:17,382 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 419 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5233 [2021-06-05 14:26:17,382 INFO L430 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash 277070352, now seen corresponding path program 273 times [2021-06-05 14:26:17,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:17,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786516954] [2021-06-05 14:26:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:17,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:17,559 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:17,559 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786516954] [2021-06-05 14:26:17,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786516954] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:17,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684362974] [2021-06-05 14:26:17,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 420 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 420 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:17,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:26:17,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:17,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:17,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:17,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:17,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:17,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:17,708 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:17,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:17,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 25 treesize of output 19 [2021-06-05 14:26:17,711 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:17,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:17,747 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:26:17,747 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:89 [2021-06-05 14:26:17,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:17,922 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:17,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 25 treesize of output 19 [2021-06-05 14:26:17,923 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:17,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:17,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 27 treesize of output 21 [2021-06-05 14:26:17,927 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:17,976 INFO L628 ElimStorePlain]: treesize reduction 83, result has 42.4 percent of original size [2021-06-05 14:26:17,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:17,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 11 treesize of output 7 [2021-06-05 14:26:17,980 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:17,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:17,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:26:18,000 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:18,015 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:18,015 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:26:18,017 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:18,017 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:162, output treesize:16 [2021-06-05 14:26:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:18,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684362974] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:18,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:18,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:26:18,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660109856] [2021-06-05 14:26:18,033 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:26:18,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:18,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:26:18,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:26:18,033 INFO L87 Difference]: Start difference. First operand 977 states and 3841 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:26:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:18,391 INFO L93 Difference]: Finished difference Result 1013 states and 3942 transitions. [2021-06-05 14:26:18,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:18,392 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:26:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:18,393 INFO L225 Difference]: With dead ends: 1013 [2021-06-05 14:26:18,393 INFO L226 Difference]: Without dead ends: 1008 [2021-06-05 14:26:18,393 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 451.0ms TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:26:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2021-06-05 14:26:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 983. [2021-06-05 14:26:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 982 states have (on average 3.9327902240325865) internal successors, (3862), 982 states have internal predecessors, (3862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 3862 transitions. [2021-06-05 14:26:18,404 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 3862 transitions. Word has length 18 [2021-06-05 14:26:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:18,404 INFO L482 AbstractCegarLoop]: Abstraction has 983 states and 3862 transitions. [2021-06-05 14:26:18,404 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:26:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 3862 transitions. [2021-06-05 14:26:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:18,405 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:18,405 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:18,605 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 420 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5245 [2021-06-05 14:26:18,606 INFO L430 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:18,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1662918394, now seen corresponding path program 274 times [2021-06-05 14:26:18,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:18,606 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593677218] [2021-06-05 14:26:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:18,763 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:18,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593677218] [2021-06-05 14:26:18,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593677218] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:18,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545663295] [2021-06-05 14:26:18,763 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 421 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 421 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:18,789 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:26:18,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:18,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:26:18,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:18,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:18,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:18,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:18,917 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:18,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:18,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:18,921 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:18,958 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:18,961 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:26:18,961 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:101 [2021-06-05 14:26:19,079 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 14:26:19,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:19,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:19,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 35 treesize of output 27 [2021-06-05 14:26:19,084 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:19,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:19,088 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:19,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:19,089 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:19,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:19,092 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:19,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 25 treesize of output 19 [2021-06-05 14:26:19,093 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:19,096 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:19,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:26:19,097 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:19,180 INFO L628 ElimStorePlain]: treesize reduction 118, result has 41.3 percent of original size [2021-06-05 14:26:19,183 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:19,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 11 treesize of output 7 [2021-06-05 14:26:19,184 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:19,214 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:19,216 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:19,216 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:231, output treesize:87 [2021-06-05 14:26:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:19,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545663295] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:19,377 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:19,377 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 14:26:19,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810206516] [2021-06-05 14:26:19,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:26:19,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:19,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:26:19,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:26:19,378 INFO L87 Difference]: Start difference. First operand 983 states and 3862 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:26:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:19,741 INFO L93 Difference]: Finished difference Result 1023 states and 3967 transitions. [2021-06-05 14:26:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:19,742 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:26:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:19,743 INFO L225 Difference]: With dead ends: 1023 [2021-06-05 14:26:19,743 INFO L226 Difference]: Without dead ends: 1011 [2021-06-05 14:26:19,743 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 474.4ms TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-06-05 14:26:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 980. [2021-06-05 14:26:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 14:26:19,753 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 14:26:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:19,753 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 14:26:19,753 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:26:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 14:26:19,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:19,755 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:19,755 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:19,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 421 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5272 [2021-06-05 14:26:19,955 INFO L430 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:19,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1758308222, now seen corresponding path program 275 times [2021-06-05 14:26:19,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:19,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744991562] [2021-06-05 14:26:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:20,150 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:20,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744991562] [2021-06-05 14:26:20,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744991562] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:20,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952107057] [2021-06-05 14:26:20,150 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 422 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 422 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:20,177 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:26:20,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:20,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:26:20,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:20,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:20,320 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:20,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 25 treesize of output 19 [2021-06-05 14:26:20,321 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:20,324 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:20,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:26:20,325 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:20,361 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:20,363 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:26:20,363 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:108, output treesize:90 [2021-06-05 14:26:20,443 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_0]} [2021-06-05 14:26:20,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:20,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:20,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:26:20,448 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:20,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:20,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:20,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 25 treesize of output 19 [2021-06-05 14:26:20,452 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:20,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:20,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:20,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 27 treesize of output 21 [2021-06-05 14:26:20,457 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:20,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:20,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 15 treesize of output 11 [2021-06-05 14:26:20,461 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:20,545 INFO L628 ElimStorePlain]: treesize reduction 106, result has 45.6 percent of original size [2021-06-05 14:26:20,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:20,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:26:20,549 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:20,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:20,582 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:20,583 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:223, output treesize:90 [2021-06-05 14:26:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:20,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952107057] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:20,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:20,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-06-05 14:26:20,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241401813] [2021-06-05 14:26:20,756 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:20,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:20,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:20,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:20,757 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 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:26:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:21,120 INFO L93 Difference]: Finished difference Result 1021 states and 3966 transitions. [2021-06-05 14:26:21,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:21,120 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 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:26:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:21,122 INFO L225 Difference]: With dead ends: 1021 [2021-06-05 14:26:21,122 INFO L226 Difference]: Without dead ends: 1009 [2021-06-05 14:26:21,122 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 525.5ms TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:26:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2021-06-05 14:26:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 980. [2021-06-05 14:26:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 14:26:21,133 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 14:26:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:21,133 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 14:26:21,133 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 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:26:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 14:26:21,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:21,134 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:21,134 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:21,334 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 422 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5297 [2021-06-05 14:26:21,334 INFO L430 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1987742664, now seen corresponding path program 276 times [2021-06-05 14:26:21,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:21,335 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556025102] [2021-06-05 14:26:21,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:21,676 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:21,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556025102] [2021-06-05 14:26:21,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556025102] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:21,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621259504] [2021-06-05 14:26:21,677 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 423 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 423 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:21,702 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:26:21,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:21,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:21,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:21,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:21,798 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:21,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 15 treesize of output 11 [2021-06-05 14:26:21,799 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:21,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:21,802 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:21,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 16 treesize of output 12 [2021-06-05 14:26:21,803 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:21,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:21,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:21,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:26:21,808 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:21,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:21,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:21,813 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:21,883 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:21,884 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:21,885 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:213, output treesize:181 [2021-06-05 14:26:22,192 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_1072, array_4], 3=[v_prenex_1070, array_2]} [2021-06-05 14:26:22,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:22,196 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:22,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:26:22,197 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:22,200 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:22,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:22,201 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:22,242 INFO L628 ElimStorePlain]: treesize reduction 89, result has 40.7 percent of original size [2021-06-05 14:26:22,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 7 treesize of output 5 [2021-06-05 14:26:22,245 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:22,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:22,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:22,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 11 treesize of output 7 [2021-06-05 14:26:22,264 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:22,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:22,280 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:26:22,281 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:22,281 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:170, output treesize:16 [2021-06-05 14:26:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:22,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621259504] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:22,309 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:22,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2021-06-05 14:26:22,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350365774] [2021-06-05 14:26:22,309 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:22,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:22,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:22,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:22,309 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:26:22,672 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2021-06-05 14:26:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:23,031 INFO L93 Difference]: Finished difference Result 1019 states and 3957 transitions. [2021-06-05 14:26:23,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:23,031 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:26:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:23,033 INFO L225 Difference]: With dead ends: 1019 [2021-06-05 14:26:23,033 INFO L226 Difference]: Without dead ends: 1014 [2021-06-05 14:26:23,033 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 981.1ms TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:26:23,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-06-05 14:26:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 984. [2021-06-05 14:26:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 3.9338758901322484) internal successors, (3867), 983 states have internal predecessors, (3867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 3867 transitions. [2021-06-05 14:26:23,043 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 3867 transitions. Word has length 18 [2021-06-05 14:26:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:23,043 INFO L482 AbstractCegarLoop]: Abstraction has 984 states and 3867 transitions. [2021-06-05 14:26:23,043 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:26:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 3867 transitions. [2021-06-05 14:26:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:23,044 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:23,044 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:23,245 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5313,423 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:23,245 INFO L430 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:23,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:23,245 INFO L82 PathProgramCache]: Analyzing trace with hash 367235886, now seen corresponding path program 277 times [2021-06-05 14:26:23,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:23,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294111227] [2021-06-05 14:26:23,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:23,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:23,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294111227] [2021-06-05 14:26:23,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294111227] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:23,515 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446916847] [2021-06-05 14:26:23,515 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 424 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 424 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:23,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 14:26:23,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:23,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:23,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:23,636 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:23,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:23,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 15 treesize of output 11 [2021-06-05 14:26:23,640 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:23,643 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:23,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:26:23,643 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:23,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 26 treesize of output 20 [2021-06-05 14:26:23,647 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:23,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:23,705 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:23,705 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:185, output treesize:153 [2021-06-05 14:26:23,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:23,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:23,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 15 treesize of output 11 [2021-06-05 14:26:23,860 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:23,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:23,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:23,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:23,864 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:23,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:23,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:23,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:26:23,868 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:23,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:23,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 25 treesize of output 19 [2021-06-05 14:26:23,872 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:23,936 INFO L628 ElimStorePlain]: treesize reduction 89, result has 44.0 percent of original size [2021-06-05 14:26:23,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:23,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 14 [2021-06-05 14:26:23,945 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:23,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:23,982 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:23,982 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:193, output treesize:56 [2021-06-05 14:26:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:24,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446916847] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:24,106 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:24,106 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-06-05 14:26:24,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512927409] [2021-06-05 14:26:24,107 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:26:24,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:24,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:26:24,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:26:24,107 INFO L87 Difference]: Start difference. First operand 984 states and 3867 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:26:24,546 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2021-06-05 14:26:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:24,757 INFO L93 Difference]: Finished difference Result 1035 states and 4003 transitions. [2021-06-05 14:26:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:24,757 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:26:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:24,759 INFO L225 Difference]: With dead ends: 1035 [2021-06-05 14:26:24,759 INFO L226 Difference]: Without dead ends: 1022 [2021-06-05 14:26:24,759 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 909.1ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:26:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-06-05 14:26:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 980. [2021-06-05 14:26:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 14:26:24,769 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 14:26:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:24,770 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 14:26:24,770 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:26:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 14:26:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:24,771 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:24,771 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:24,971 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5329,424 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:24,971 INFO L430 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1780649682, now seen corresponding path program 278 times [2021-06-05 14:26:24,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:24,972 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522710074] [2021-06-05 14:26:24,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:25,270 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:25,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522710074] [2021-06-05 14:26:25,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522710074] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:25,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501134219] [2021-06-05 14:26:25,270 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 425 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 425 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:25,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:26:25,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:25,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:25,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:25,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:25,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:25,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:25,438 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:25,441 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:25,441 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:25,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:26:25,442 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:25,445 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:25,446 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:25,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:26:25,446 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:25,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:25,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:26:25,450 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:25,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:25,504 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:26:25,504 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:173, output treesize:141 [2021-06-05 14:26:25,666 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 14:26:25,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:25,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:26:25,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:25,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:25,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 25 treesize of output 19 [2021-06-05 14:26:25,673 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:25,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:25,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 35 treesize of output 27 [2021-06-05 14:26:25,677 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:25,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:25,680 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:25,730 INFO L628 ElimStorePlain]: treesize reduction 80, result has 43.3 percent of original size [2021-06-05 14:26:25,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:25,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 22 treesize of output 14 [2021-06-05 14:26:25,734 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:25,752 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:25,753 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:25,753 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 14:26:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:25,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501134219] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:25,819 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:25,819 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:26:25,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259423794] [2021-06-05 14:26:25,819 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:25,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:25,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:25,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:25,819 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:26,273 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2021-06-05 14:26:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:26,723 INFO L93 Difference]: Finished difference Result 1026 states and 3994 transitions. [2021-06-05 14:26:26,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:26:26,723 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:26,725 INFO L225 Difference]: With dead ends: 1026 [2021-06-05 14:26:26,725 INFO L226 Difference]: Without dead ends: 1021 [2021-06-05 14:26:26,725 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1047.7ms TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:26:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2021-06-05 14:26:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 980. [2021-06-05 14:26:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 14:26:26,735 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 14:26:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:26,735 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 14:26:26,735 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 14:26:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:26,736 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:26,736 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:26,937 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5345,425 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:26,937 INFO L430 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:26,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:26,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2015362562, now seen corresponding path program 279 times [2021-06-05 14:26:26,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:26,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617152580] [2021-06-05 14:26:26,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:27,210 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:27,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617152580] [2021-06-05 14:26:27,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617152580] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:27,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536636638] [2021-06-05 14:26:27,211 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 426 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 426 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:27,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:26:27,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:27,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:27,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:27,344 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:27,345 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:27,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:26:27,346 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:27,349 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:27,349 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:27,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:27,351 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:27,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:27,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:27,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:26:27,355 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:27,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:27,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:26:27,359 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:27,404 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:27,408 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:26:27,408 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:141, output treesize:109 [2021-06-05 14:26:27,600 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 14:26:27,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:27,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:27,604 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:27,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:27,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:26:27,607 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:27,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:27,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:26:27,611 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:27,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 25 treesize of output 19 [2021-06-05 14:26:27,614 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:27,675 INFO L628 ElimStorePlain]: treesize reduction 84, result has 42.1 percent of original size [2021-06-05 14:26:27,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:27,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:26:27,678 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:27,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:27,698 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:27,698 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:175, output treesize:35 [2021-06-05 14:26:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:27,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536636638] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:27,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:27,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:26:27,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264733105] [2021-06-05 14:26:27,763 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:27,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:27,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:27,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:27,764 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:28,638 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2021-06-05 14:26:28,781 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 68 [2021-06-05 14:26:28,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:28,849 INFO L93 Difference]: Finished difference Result 1155 states and 4452 transitions. [2021-06-05 14:26:28,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:26:28,850 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:28,852 INFO L225 Difference]: With dead ends: 1155 [2021-06-05 14:26:28,852 INFO L226 Difference]: Without dead ends: 1150 [2021-06-05 14:26:28,852 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1131.2ms TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:26:28,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2021-06-05 14:26:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 981. [2021-06-05 14:26:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9306122448979592) internal successors, (3852), 980 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3852 transitions. [2021-06-05 14:26:28,863 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3852 transitions. Word has length 18 [2021-06-05 14:26:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:28,863 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3852 transitions. [2021-06-05 14:26:28,863 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3852 transitions. [2021-06-05 14:26:28,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:28,864 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:28,864 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:29,064 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5370,426 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:29,065 INFO L430 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:29,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:29,065 INFO L82 PathProgramCache]: Analyzing trace with hash -740413884, now seen corresponding path program 280 times [2021-06-05 14:26:29,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:29,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193125135] [2021-06-05 14:26:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:29,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:29,348 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193125135] [2021-06-05 14:26:29,348 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193125135] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:29,348 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225720823] [2021-06-05 14:26:29,348 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 427 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 427 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:29,373 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:26:29,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:29,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:29,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:29,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:29,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:29,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 26 treesize of output 20 [2021-06-05 14:26:29,460 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:29,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:29,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:29,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 25 treesize of output 19 [2021-06-05 14:26:29,464 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:29,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:29,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:29,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:26:29,468 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:29,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:29,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 15 treesize of output 11 [2021-06-05 14:26:29,471 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:29,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:29,509 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:26:29,509 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:135, output treesize:99 [2021-06-05 14:26:29,730 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 14:26:29,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:29,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 27 treesize of output 21 [2021-06-05 14:26:29,734 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:29,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:29,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:29,738 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:29,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:29,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 17 treesize of output 13 [2021-06-05 14:26:29,741 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:29,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 25 treesize of output 19 [2021-06-05 14:26:29,745 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:29,794 INFO L628 ElimStorePlain]: treesize reduction 76, result has 42.0 percent of original size [2021-06-05 14:26:29,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:29,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 11 treesize of output 7 [2021-06-05 14:26:29,798 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:29,817 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:29,818 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:29,818 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:167, output treesize:35 [2021-06-05 14:26:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:29,882 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225720823] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:29,882 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:29,882 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:26:29,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301981666] [2021-06-05 14:26:29,883 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:29,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:29,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:29,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:29,883 INFO L87 Difference]: Start difference. First operand 981 states and 3852 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:30,336 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2021-06-05 14:26:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:30,601 INFO L93 Difference]: Finished difference Result 1055 states and 4095 transitions. [2021-06-05 14:26:30,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:30,601 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:30,603 INFO L225 Difference]: With dead ends: 1055 [2021-06-05 14:26:30,603 INFO L226 Difference]: Without dead ends: 1050 [2021-06-05 14:26:30,603 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 890.6ms TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:26:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2021-06-05 14:26:30,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 978. [2021-06-05 14:26:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 14:26:30,613 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 14:26:30,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:30,613 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 14:26:30,614 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 14:26:30,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:30,615 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:30,615 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:30,815 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 427 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5395 [2021-06-05 14:26:30,815 INFO L430 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash -145415374, now seen corresponding path program 281 times [2021-06-05 14:26:30,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:30,815 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138335829] [2021-06-05 14:26:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:31,000 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:31,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138335829] [2021-06-05 14:26:31,000 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138335829] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:31,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754364492] [2021-06-05 14:26:31,000 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 428 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 428 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:31,027 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:26:31,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:31,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:31,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:31,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:31,141 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:31,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 15 treesize of output 11 [2021-06-05 14:26:31,142 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:31,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:31,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 25 treesize of output 19 [2021-06-05 14:26:31,146 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:31,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:31,181 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:26:31,181 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:89 [2021-06-05 14:26:31,317 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_1086, array_4], 3=[v_prenex_1085, array_2]} [2021-06-05 14:26:31,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:31,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:31,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:26:31,322 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:31,326 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:31,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:31,327 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:31,366 INFO L628 ElimStorePlain]: treesize reduction 93, result has 39.6 percent of original size [2021-06-05 14:26:31,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:26:31,369 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:31,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:31,387 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:31,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 11 treesize of output 7 [2021-06-05 14:26:31,388 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:31,403 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:31,403 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:26:31,405 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:31,405 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:170, output treesize:16 [2021-06-05 14:26:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:31,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754364492] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:31,421 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:31,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:26:31,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251840990] [2021-06-05 14:26:31,421 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:26:31,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:31,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:26:31,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:26:31,421 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:26:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:31,833 INFO L93 Difference]: Finished difference Result 1002 states and 3899 transitions. [2021-06-05 14:26:31,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:31,833 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:26:31,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:31,835 INFO L225 Difference]: With dead ends: 1002 [2021-06-05 14:26:31,835 INFO L226 Difference]: Without dead ends: 997 [2021-06-05 14:26:31,835 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 453.6ms TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:26:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2021-06-05 14:26:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 985. [2021-06-05 14:26:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 3.928861788617886) internal successors, (3866), 984 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 3866 transitions. [2021-06-05 14:26:31,845 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 3866 transitions. Word has length 18 [2021-06-05 14:26:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:31,845 INFO L482 AbstractCegarLoop]: Abstraction has 985 states and 3866 transitions. [2021-06-05 14:26:31,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:26:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 3866 transitions. [2021-06-05 14:26:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:31,846 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:31,846 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:32,047 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 428 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5420 [2021-06-05 14:26:32,047 INFO L430 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:32,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2085404120, now seen corresponding path program 282 times [2021-06-05 14:26:32,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:32,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147223385] [2021-06-05 14:26:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:32,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:32,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147223385] [2021-06-05 14:26:32,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147223385] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:32,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598936915] [2021-06-05 14:26:32,231 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 429 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 429 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:32,257 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:26:32,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:32,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:32,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:32,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:32,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:32,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:26:32,373 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:32,376 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:32,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:32,377 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:32,409 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:32,411 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:26:32,412 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:89 [2021-06-05 14:26:32,498 INFO L446 ElimStorePlain]: Different costs {1=[array_4, v_prenex_1091], 3=[array_2, v_prenex_1090]} [2021-06-05 14:26:32,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:32,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:32,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 25 treesize of output 19 [2021-06-05 14:26:32,504 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:32,507 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:32,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 35 treesize of output 27 [2021-06-05 14:26:32,509 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:32,569 INFO L628 ElimStorePlain]: treesize reduction 109, result has 41.7 percent of original size [2021-06-05 14:26:32,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:32,572 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:32,597 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:32,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:32,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 11 treesize of output 7 [2021-06-05 14:26:32,601 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:32,624 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:32,624 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1090 vanished before elimination [2021-06-05 14:26:32,626 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:32,626 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:207, output treesize:35 [2021-06-05 14:26:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:32,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598936915] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:32,684 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:32,684 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:26:32,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672724203] [2021-06-05 14:26:32,684 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:26:32,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:32,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:26:32,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:26:32,684 INFO L87 Difference]: Start difference. First operand 985 states and 3866 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:26:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:33,071 INFO L93 Difference]: Finished difference Result 1012 states and 3931 transitions. [2021-06-05 14:26:33,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:33,071 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:26:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:33,073 INFO L225 Difference]: With dead ends: 1012 [2021-06-05 14:26:33,073 INFO L226 Difference]: Without dead ends: 1007 [2021-06-05 14:26:33,073 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 420.0ms TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:26:33,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-06-05 14:26:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 982. [2021-06-05 14:26:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.928644240570846) internal successors, (3854), 981 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3854 transitions. [2021-06-05 14:26:33,083 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3854 transitions. Word has length 18 [2021-06-05 14:26:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:33,083 INFO L482 AbstractCegarLoop]: Abstraction has 982 states and 3854 transitions. [2021-06-05 14:26:33,083 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:26:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3854 transitions. [2021-06-05 14:26:33,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:33,084 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:33,084 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:33,284 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5434,429 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:33,284 INFO L430 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:33,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1335822496, now seen corresponding path program 283 times [2021-06-05 14:26:33,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:33,285 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116931138] [2021-06-05 14:26:33,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:33,503 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:33,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116931138] [2021-06-05 14:26:33,503 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116931138] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:33,503 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704543759] [2021-06-05 14:26:33,503 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 430 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 430 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:33,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:33,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:33,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:33,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:33,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 15 treesize of output 11 [2021-06-05 14:26:33,652 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:33,654 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:33,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:33,655 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:33,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:33,678 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 14:26:33,678 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:62 [2021-06-05 14:26:33,745 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 14:26:33,749 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:33,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 25 treesize of output 19 [2021-06-05 14:26:33,750 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:33,753 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:33,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 17 treesize of output 13 [2021-06-05 14:26:33,754 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:33,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26: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 27 treesize of output 21 [2021-06-05 14:26:33,758 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:33,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:33,761 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:33,807 INFO L628 ElimStorePlain]: treesize reduction 80, result has 43.3 percent of original size [2021-06-05 14:26:33,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:33,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 22 treesize of output 14 [2021-06-05 14:26:33,810 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:33,829 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:33,830 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:33,830 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:167, output treesize:35 [2021-06-05 14:26:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:33,892 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704543759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:33,892 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:33,892 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:26:33,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329097146] [2021-06-05 14:26:33,892 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:33,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:33,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:33,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:33,893 INFO L87 Difference]: Start difference. First operand 982 states and 3854 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:34,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:34,530 INFO L93 Difference]: Finished difference Result 1007 states and 3921 transitions. [2021-06-05 14:26:34,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:34,530 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:34,531 INFO L225 Difference]: With dead ends: 1007 [2021-06-05 14:26:34,532 INFO L226 Difference]: Without dead ends: 1002 [2021-06-05 14:26:34,532 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 700.0ms TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:26:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2021-06-05 14:26:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 979. [2021-06-05 14:26:34,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 978 states have (on average 3.9314928425357873) internal successors, (3845), 978 states have internal predecessors, (3845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 3845 transitions. [2021-06-05 14:26:34,542 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 3845 transitions. Word has length 18 [2021-06-05 14:26:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:34,542 INFO L482 AbstractCegarLoop]: Abstraction has 979 states and 3845 transitions. [2021-06-05 14:26:34,542 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 3845 transitions. [2021-06-05 14:26:34,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:34,543 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:34,543 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:34,743 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5447,430 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:34,744 INFO L430 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:34,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1884738906, now seen corresponding path program 284 times [2021-06-05 14:26:34,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:34,744 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307095903] [2021-06-05 14:26:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:35,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:35,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307095903] [2021-06-05 14:26:35,072 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307095903] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:35,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964518825] [2021-06-05 14:26:35,072 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 431 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 431 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:35,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:26:35,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:35,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:35,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:35,181 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:35,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 15 treesize of output 11 [2021-06-05 14:26:35,182 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:35,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:35,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:35,185 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:35,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:35,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 26 treesize of output 20 [2021-06-05 14:26:35,189 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:35,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 16 treesize of output 12 [2021-06-05 14:26:35,193 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:35,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:35,245 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:35,245 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:137 [2021-06-05 14:26:35,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:35,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:26:35,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:35,466 INFO L628 ElimStorePlain]: treesize reduction 58, result has 41.4 percent of original size [2021-06-05 14:26:35,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:35,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:26:35,469 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:35,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:35,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:35,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:26:35,480 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:35,488 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:35,488 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:26:35,489 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:35,489 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:106, output treesize:16 [2021-06-05 14:26:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:35,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964518825] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:35,516 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:35,516 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:26:35,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139326102] [2021-06-05 14:26:35,516 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:35,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:35,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:35,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:35,516 INFO L87 Difference]: Start difference. First operand 979 states and 3845 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:35,926 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-06-05 14:26:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:36,282 INFO L93 Difference]: Finished difference Result 1008 states and 3916 transitions. [2021-06-05 14:26:36,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:36,282 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:36,284 INFO L225 Difference]: With dead ends: 1008 [2021-06-05 14:26:36,284 INFO L226 Difference]: Without dead ends: 1003 [2021-06-05 14:26:36,284 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 987.3ms TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:26:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2021-06-05 14:26:36,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 986. [2021-06-05 14:26:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 985 states have (on average 3.931979695431472) internal successors, (3873), 985 states have internal predecessors, (3873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 3873 transitions. [2021-06-05 14:26:36,294 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 3873 transitions. Word has length 18 [2021-06-05 14:26:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:36,294 INFO L482 AbstractCegarLoop]: Abstraction has 986 states and 3873 transitions. [2021-06-05 14:26:36,294 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 3873 transitions. [2021-06-05 14:26:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:36,295 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:36,295 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:36,495 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 431 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5461 [2021-06-05 14:26:36,496 INFO L430 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:36,496 INFO L82 PathProgramCache]: Analyzing trace with hash -55249840, now seen corresponding path program 285 times [2021-06-05 14:26:36,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:36,496 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445890193] [2021-06-05 14:26:36,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:36,811 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:36,811 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445890193] [2021-06-05 14:26:36,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445890193] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:36,811 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843566155] [2021-06-05 14:26:36,811 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 432 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 432 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:36,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:26:36,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:36,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:36,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:36,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:36,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:36,920 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:36,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:36,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 25 treesize of output 19 [2021-06-05 14:26:36,924 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:36,926 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:36,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:26:36,927 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:36,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 16 treesize of output 12 [2021-06-05 14:26:36,930 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:36,969 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:36,970 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:36,970 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:163, output treesize:131 [2021-06-05 14:26:37,090 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:37,091 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:37,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:37,092 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:37,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:37,095 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:37,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:37,096 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:37,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:37,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:37,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:26:37,100 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:37,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:37,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 15 treesize of output 11 [2021-06-05 14:26:37,103 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:37,146 INFO L628 ElimStorePlain]: treesize reduction 79, result has 39.7 percent of original size [2021-06-05 14:26:37,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:37,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 11 treesize of output 7 [2021-06-05 14:26:37,150 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:37,167 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:37,168 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:37,168 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:169, output treesize:44 [2021-06-05 14:26:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:37,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843566155] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:37,237 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:37,237 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:26:37,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999813776] [2021-06-05 14:26:37,237 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:37,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:37,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:37,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:37,237 INFO L87 Difference]: Start difference. First operand 986 states and 3873 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:37,648 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2021-06-05 14:26:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:37,919 INFO L93 Difference]: Finished difference Result 1024 states and 3972 transitions. [2021-06-05 14:26:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:37,919 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:37,921 INFO L225 Difference]: With dead ends: 1024 [2021-06-05 14:26:37,921 INFO L226 Difference]: Without dead ends: 1019 [2021-06-05 14:26:37,921 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 849.0ms TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:26:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-06-05 14:26:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 979. [2021-06-05 14:26:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 978 states have (on average 3.9314928425357873) internal successors, (3845), 978 states have internal predecessors, (3845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 3845 transitions. [2021-06-05 14:26:37,932 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 3845 transitions. Word has length 18 [2021-06-05 14:26:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:37,932 INFO L482 AbstractCegarLoop]: Abstraction has 979 states and 3845 transitions. [2021-06-05 14:26:37,932 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:26:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 3845 transitions. [2021-06-05 14:26:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:37,933 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:37,933 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:38,134 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 432 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5476 [2021-06-05 14:26:38,134 INFO L430 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:38,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:38,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2091831888, now seen corresponding path program 286 times [2021-06-05 14:26:38,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:38,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104160077] [2021-06-05 14:26:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:38,389 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:38,389 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104160077] [2021-06-05 14:26:38,389 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104160077] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:38,389 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885113763] [2021-06-05 14:26:38,389 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 433 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 433 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:38,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:26:38,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:38,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:26:38,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:38,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,490 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,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 26 treesize of output 20 [2021-06-05 14:26:38,491 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:38,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:38,495 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:38,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,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 16 treesize of output 12 [2021-06-05 14:26:38,500 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:38,502 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:38,503 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:38,561 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:38,563 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:38,563 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:199, output treesize:167 [2021-06-05 14:26:38,792 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 10=[array_0]} [2021-06-05 14:26:38,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,797 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,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 15 treesize of output 11 [2021-06-05 14:26:38,806 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:38,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,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 35 treesize of output 27 [2021-06-05 14:26:38,812 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:38,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,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 25 treesize of output 19 [2021-06-05 14:26:38,817 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:38,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,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 25 treesize of output 19 [2021-06-05 14:26:38,822 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:38,893 INFO L628 ElimStorePlain]: treesize reduction 114, result has 42.1 percent of original size [2021-06-05 14:26:38,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:38,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:26:38,897 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:38,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:38,930 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:38,930 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:231, output treesize:87 [2021-06-05 14:26:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:39,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885113763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:39,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:39,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 14:26:39,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303291162] [2021-06-05 14:26:39,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:39,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:39,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:39,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:39,144 INFO L87 Difference]: Start difference. First operand 979 states and 3845 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:26:39,492 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2021-06-05 14:26:39,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:39,739 INFO L93 Difference]: Finished difference Result 1012 states and 3934 transitions. [2021-06-05 14:26:39,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:39,739 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:26:39,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:39,741 INFO L225 Difference]: With dead ends: 1012 [2021-06-05 14:26:39,741 INFO L226 Difference]: Without dead ends: 999 [2021-06-05 14:26:39,741 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 837.3ms TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:26:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2021-06-05 14:26:39,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 978. [2021-06-05 14:26:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 14:26:39,754 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 14:26:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:39,754 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 14:26:39,754 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:26:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 14:26:39,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:39,755 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:39,755 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:39,956 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 433 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5491 [2021-06-05 14:26:39,956 INFO L430 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:39,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:39,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1441839766, now seen corresponding path program 287 times [2021-06-05 14:26:39,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:39,956 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90877206] [2021-06-05 14:26:39,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:40,326 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:40,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90877206] [2021-06-05 14:26:40,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90877206] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:40,326 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000026343] [2021-06-05 14:26:40,326 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 434 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 434 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:40,353 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:26:40,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:40,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:40,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:40,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:40,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 16 treesize of output 12 [2021-06-05 14:26:40,463 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:40,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:40,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:26:40,467 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:40,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:40,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 25 treesize of output 19 [2021-06-05 14:26:40,471 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:40,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:40,474 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:40,518 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:40,519 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:40,519 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 14:26:40,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 27 treesize of output 21 [2021-06-05 14:26:40,673 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:40,679 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:40,679 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:26:40,680 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:40,680 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:16 [2021-06-05 14:26:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:40,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000026343] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:40,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:40,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:26:40,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412347124] [2021-06-05 14:26:40,707 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:26:40,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:40,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:26:40,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:26:40,707 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:41,176 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2021-06-05 14:26:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:41,534 INFO L93 Difference]: Finished difference Result 1007 states and 3912 transitions. [2021-06-05 14:26:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:41,534 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:26:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:41,536 INFO L225 Difference]: With dead ends: 1007 [2021-06-05 14:26:41,536 INFO L226 Difference]: Without dead ends: 1002 [2021-06-05 14:26:41,536 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1109.0ms TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:26:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2021-06-05 14:26:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 984. [2021-06-05 14:26:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 3.9338758901322484) internal successors, (3867), 983 states have internal predecessors, (3867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 3867 transitions. [2021-06-05 14:26:41,546 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 3867 transitions. Word has length 18 [2021-06-05 14:26:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:41,546 INFO L482 AbstractCegarLoop]: Abstraction has 984 states and 3867 transitions. [2021-06-05 14:26:41,547 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 3867 transitions. [2021-06-05 14:26:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:41,548 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:41,548 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:41,748 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5505,434 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:41,748 INFO L430 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:41,748 INFO L82 PathProgramCache]: Analyzing trace with hash -498148980, now seen corresponding path program 288 times [2021-06-05 14:26:41,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:41,749 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343264811] [2021-06-05 14:26:41,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:42,184 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:42,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343264811] [2021-06-05 14:26:42,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343264811] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:42,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290876933] [2021-06-05 14:26:42,184 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 435 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 435 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:42,210 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:26:42,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:42,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:42,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:42,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:42,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 26 treesize of output 20 [2021-06-05 14:26:42,305 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:42,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:42,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:42,308 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:42,311 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:42,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 16 treesize of output 12 [2021-06-05 14:26:42,312 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:42,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 25 treesize of output 19 [2021-06-05 14:26:42,315 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:42,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:42,349 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:42,349 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:111 [2021-06-05 14:26:42,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:42,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 25 treesize of output 19 [2021-06-05 14:26:42,462 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:42,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:42,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:26:42,465 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:42,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:42,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:26:42,469 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:42,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:42,471 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:42,508 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 14:26:42,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 14:26:42,510 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:42,524 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:42,524 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:42,524 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:26:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:42,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290876933] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:42,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:42,589 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:26:42,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125303488] [2021-06-05 14:26:42,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:26:42,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:42,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:26:42,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:26:42,590 INFO L87 Difference]: Start difference. First operand 984 states and 3867 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:43,073 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2021-06-05 14:26:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:43,536 INFO L93 Difference]: Finished difference Result 1023 states and 3966 transitions. [2021-06-05 14:26:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:26:43,537 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:26:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:43,538 INFO L225 Difference]: With dead ends: 1023 [2021-06-05 14:26:43,538 INFO L226 Difference]: Without dead ends: 1018 [2021-06-05 14:26:43,539 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1122.7ms TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:26:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-06-05 14:26:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 978. [2021-06-05 14:26:43,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 14:26:43,549 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 14:26:43,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:43,549 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 14:26:43,549 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 14:26:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:43,550 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:43,550 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:43,750 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 435 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5519 [2021-06-05 14:26:43,751 INFO L430 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:43,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:43,751 INFO L82 PathProgramCache]: Analyzing trace with hash 763134468, now seen corresponding path program 289 times [2021-06-05 14:26:43,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:43,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387450031] [2021-06-05 14:26:43,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:44,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:44,478 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:44,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387450031] [2021-06-05 14:26:44,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387450031] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:44,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294110046] [2021-06-05 14:26:44,478 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 436 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 436 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:44,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 14:26:44,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:44,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:44,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 26 treesize of output 20 [2021-06-05 14:26:44,611 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:44,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:44,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 16 treesize of output 12 [2021-06-05 14:26:44,615 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:44,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:44,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:44,619 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:44,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:44,622 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:44,662 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:44,663 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:44,663 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:123 [2021-06-05 14:26:44,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:44,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:44,791 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:44,793 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:44,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 35 treesize of output 27 [2021-06-05 14:26:44,794 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:44,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:44,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 15 treesize of output 11 [2021-06-05 14:26:44,797 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:44,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:44,800 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:44,835 INFO L628 ElimStorePlain]: treesize reduction 78, result has 35.5 percent of original size [2021-06-05 14:26:44,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 11 treesize of output 7 [2021-06-05 14:26:44,838 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:44,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:44,852 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:44,852 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:26:44,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:44,925 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294110046] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:44,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:44,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:26:44,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192893692] [2021-06-05 14:26:44,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:26:44,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:44,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:26:44,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:26:44,926 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:45,217 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 49 [2021-06-05 14:26:45,685 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 14:26:45,893 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2021-06-05 14:26:46,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:46,262 INFO L93 Difference]: Finished difference Result 1011 states and 3933 transitions. [2021-06-05 14:26:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:26:46,262 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:26:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:46,264 INFO L225 Difference]: With dead ends: 1011 [2021-06-05 14:26:46,264 INFO L226 Difference]: Without dead ends: 1006 [2021-06-05 14:26:46,264 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1776.4ms TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:26:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-06-05 14:26:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 980. [2021-06-05 14:26:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 14:26:46,274 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 14:26:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:46,274 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 14:26:46,274 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:46,274 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 14:26:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:46,276 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:46,276 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:46,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5533,436 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:46,476 INFO L430 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:46,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:46,476 INFO L82 PathProgramCache]: Analyzing trace with hash -255309622, now seen corresponding path program 290 times [2021-06-05 14:26:46,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:46,476 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778894359] [2021-06-05 14:26:46,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:46,848 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:46,848 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778894359] [2021-06-05 14:26:46,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778894359] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:46,848 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372591463] [2021-06-05 14:26:46,848 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 437 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 437 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:46,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:26:46,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:46,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:46,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:46,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:46,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:26:46,949 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:46,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:46,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 16 treesize of output 12 [2021-06-05 14:26:46,952 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:46,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:46,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:46,955 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:46,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:26:46,958 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:46,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:46,993 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:46,993 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 14:26:47,141 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1106], 1=[array_4, v_prenex_1107]} [2021-06-05 14:26:47,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 25 treesize of output 19 [2021-06-05 14:26:47,144 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:47,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 15 treesize of output 11 [2021-06-05 14:26:47,147 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:47,188 INFO L628 ElimStorePlain]: treesize reduction 83, result has 39.4 percent of original size [2021-06-05 14:26:47,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 27 treesize of output 21 [2021-06-05 14:26:47,191 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:47,205 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:47,206 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:26:47,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 22 treesize of output 14 [2021-06-05 14:26:47,208 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:47,222 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:47,222 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:47,222 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 14:26:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:47,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372591463] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:47,289 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:47,289 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:26:47,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728894811] [2021-06-05 14:26:47,289 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:26:47,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:47,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:26:47,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:26:47,289 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:47,679 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2021-06-05 14:26:48,016 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2021-06-05 14:26:48,216 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2021-06-05 14:26:48,418 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-06-05 14:26:48,587 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2021-06-05 14:26:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:48,662 INFO L93 Difference]: Finished difference Result 1121 states and 4276 transitions. [2021-06-05 14:26:48,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:26:48,662 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:26:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:48,664 INFO L225 Difference]: With dead ends: 1121 [2021-06-05 14:26:48,664 INFO L226 Difference]: Without dead ends: 1111 [2021-06-05 14:26:48,664 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1508.3ms TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:26:48,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-06-05 14:26:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 982. [2021-06-05 14:26:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.928644240570846) internal successors, (3854), 981 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3854 transitions. [2021-06-05 14:26:48,676 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3854 transitions. Word has length 18 [2021-06-05 14:26:48,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:48,676 INFO L482 AbstractCegarLoop]: Abstraction has 982 states and 3854 transitions. [2021-06-05 14:26:48,676 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3854 transitions. [2021-06-05 14:26:48,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:48,677 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:48,677 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:48,877 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5547,437 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:48,877 INFO L430 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1019639056, now seen corresponding path program 291 times [2021-06-05 14:26:48,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:48,878 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951886683] [2021-06-05 14:26:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:49,260 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 58 [2021-06-05 14:26:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:49,496 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:49,496 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951886683] [2021-06-05 14:26:49,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951886683] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:49,497 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065800928] [2021-06-05 14:26:49,497 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 438 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 438 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:49,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:26:49,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:49,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:49,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:49,604 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:49,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 15 treesize of output 11 [2021-06-05 14:26:49,605 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:49,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:49,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 16 treesize of output 12 [2021-06-05 14:26:49,609 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:49,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:49,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 25 treesize of output 19 [2021-06-05 14:26:49,612 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:49,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 26 treesize of output 20 [2021-06-05 14:26:49,615 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:49,649 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:49,650 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:49,650 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:93 [2021-06-05 14:26:49,827 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1108, array_0], 1=[v_prenex_1109, array_4]} [2021-06-05 14:26:49,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 27 treesize of output 21 [2021-06-05 14:26:49,830 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:49,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 25 treesize of output 19 [2021-06-05 14:26:49,833 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:49,871 INFO L628 ElimStorePlain]: treesize reduction 77, result has 39.4 percent of original size [2021-06-05 14:26:49,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:26:49,874 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:49,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:49,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 11 treesize of output 7 [2021-06-05 14:26:49,891 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:49,904 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:49,904 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:26:49,905 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:49,905 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:143, output treesize:35 [2021-06-05 14:26:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:49,974 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065800928] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:49,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:49,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:26:49,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491388965] [2021-06-05 14:26:49,975 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:26:49,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:49,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:26:49,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:26:49,975 INFO L87 Difference]: Start difference. First operand 982 states and 3854 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:50,421 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2021-06-05 14:26:50,685 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 71 [2021-06-05 14:26:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:51,363 INFO L93 Difference]: Finished difference Result 1066 states and 4047 transitions. [2021-06-05 14:26:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:26:51,363 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:26:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:51,365 INFO L225 Difference]: With dead ends: 1066 [2021-06-05 14:26:51,365 INFO L226 Difference]: Without dead ends: 1057 [2021-06-05 14:26:51,365 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1661.5ms TimeCoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:26:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-06-05 14:26:51,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 985. [2021-06-05 14:26:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 3.928861788617886) internal successors, (3866), 984 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 3866 transitions. [2021-06-05 14:26:51,376 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 3866 transitions. Word has length 18 [2021-06-05 14:26:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:51,376 INFO L482 AbstractCegarLoop]: Abstraction has 985 states and 3866 transitions. [2021-06-05 14:26:51,376 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 3866 transitions. [2021-06-05 14:26:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:51,377 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:51,377 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:51,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 438 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5564 [2021-06-05 14:26:51,578 INFO L430 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:51,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash -651336960, now seen corresponding path program 292 times [2021-06-05 14:26:51,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:51,578 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301221408] [2021-06-05 14:26:51,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:51,766 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2021-06-05 14:26:52,015 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2021-06-05 14:26:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:52,309 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:52,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301221408] [2021-06-05 14:26:52,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301221408] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:52,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770412920] [2021-06-05 14:26:52,309 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 439 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 439 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:52,334 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:26:52,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:52,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:26:52,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:52,420 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:52,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:26:52,421 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:52,423 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:52,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:26:52,424 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:52,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:52,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 25 treesize of output 19 [2021-06-05 14:26:52,427 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:52,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 26 treesize of output 20 [2021-06-05 14:26:52,430 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:52,464 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:52,465 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:52,465 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:93 [2021-06-05 14:26:52,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:52,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:52,694 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:52,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:52,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-06-05 14:26:52,697 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:52,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:52,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:26:52,700 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:52,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:26:52,703 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:52,744 INFO L628 ElimStorePlain]: treesize reduction 71, result has 42.3 percent of original size [2021-06-05 14:26:52,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 22 treesize of output 14 [2021-06-05 14:26:52,747 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:52,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:52,763 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:52,763 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:149, output treesize:38 [2021-06-05 14:26:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:52,846 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770412920] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:52,846 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:52,846 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 14:26:52,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771700095] [2021-06-05 14:26:52,846 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 14:26:52,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:52,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 14:26:52,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:26:52,846 INFO L87 Difference]: Start difference. First operand 985 states and 3866 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:53,252 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2021-06-05 14:26:53,475 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 63 [2021-06-05 14:26:54,055 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2021-06-05 14:26:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:54,365 INFO L93 Difference]: Finished difference Result 1054 states and 4021 transitions. [2021-06-05 14:26:54,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 14:26:54,365 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:26:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:54,366 INFO L225 Difference]: With dead ends: 1054 [2021-06-05 14:26:54,367 INFO L226 Difference]: Without dead ends: 1035 [2021-06-05 14:26:54,367 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1921.1ms TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2021-06-05 14:26:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2021-06-05 14:26:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 981. [2021-06-05 14:26:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9306122448979592) internal successors, (3852), 980 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3852 transitions. [2021-06-05 14:26:54,377 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3852 transitions. Word has length 18 [2021-06-05 14:26:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:54,377 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3852 transitions. [2021-06-05 14:26:54,377 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3852 transitions. [2021-06-05 14:26:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:54,378 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:54,378 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:54,578 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5578,439 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:54,579 INFO L430 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:54,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1349294162, now seen corresponding path program 293 times [2021-06-05 14:26:54,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:54,579 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135105410] [2021-06-05 14:26:54,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:54,869 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:54,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135105410] [2021-06-05 14:26:54,869 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135105410] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:54,869 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879093531] [2021-06-05 14:26:54,869 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 440 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 440 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:54,895 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:26:54,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:54,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:54,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:54,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:54,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:54,988 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:54,991 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:54,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:26:54,991 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:54,994 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:54,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 16 treesize of output 12 [2021-06-05 14:26:54,995 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:54,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 26 treesize of output 20 [2021-06-05 14:26:54,998 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:55,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:55,034 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:26:55,034 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:107 [2021-06-05 14:26:55,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:55,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 25 treesize of output 19 [2021-06-05 14:26:55,146 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:55,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:55,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 27 treesize of output 21 [2021-06-05 14:26:55,149 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:55,152 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:55,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:26:55,153 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:55,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:26:55,155 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:55,191 INFO L628 ElimStorePlain]: treesize reduction 64, result has 40.2 percent of original size [2021-06-05 14:26:55,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 11 treesize of output 7 [2021-06-05 14:26:55,195 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:55,208 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:55,209 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:55,209 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 14:26:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:55,274 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879093531] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:55,274 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:55,274 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:26:55,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104711814] [2021-06-05 14:26:55,274 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:26:55,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:55,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:26:55,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:26:55,275 INFO L87 Difference]: Start difference. First operand 981 states and 3852 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:55,851 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2021-06-05 14:26:56,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:56,253 INFO L93 Difference]: Finished difference Result 1020 states and 3953 transitions. [2021-06-05 14:26:56,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:26:56,254 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:26:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:56,255 INFO L225 Difference]: With dead ends: 1020 [2021-06-05 14:26:56,255 INFO L226 Difference]: Without dead ends: 1015 [2021-06-05 14:26:56,256 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 993.7ms TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:26:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-06-05 14:26:56,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 978. [2021-06-05 14:26:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 14:26:56,266 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 14:26:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:56,266 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 14:26:56,266 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 14:26:56,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:56,267 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:56,267 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:56,467 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5591,440 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:56,467 INFO L430 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:56,468 INFO L82 PathProgramCache]: Analyzing trace with hash -781882228, now seen corresponding path program 294 times [2021-06-05 14:26:56,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:56,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995142563] [2021-06-05 14:26:56,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:56,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:56,646 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:56,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995142563] [2021-06-05 14:26:56,646 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995142563] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:56,646 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378343261] [2021-06-05 14:26:56,647 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 441 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 441 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:56,673 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:26:56,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:56,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:56,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:56,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:56,769 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:56,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 25 treesize of output 19 [2021-06-05 14:26:56,770 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:56,773 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:56,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:56,773 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:56,802 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:56,803 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:56,803 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:92, output treesize:78 [2021-06-05 14:26:57,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:57,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 25 treesize of output 19 [2021-06-05 14:26:57,003 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:57,037 INFO L628 ElimStorePlain]: treesize reduction 66, result has 41.6 percent of original size [2021-06-05 14:26:57,037 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:26:57,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:57,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 27 treesize of output 21 [2021-06-05 14:26:57,040 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:57,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:57,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:57,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 22 treesize of output 14 [2021-06-05 14:26:57,054 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:57,064 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:57,065 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:57,065 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:124, output treesize:16 [2021-06-05 14:26:57,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:57,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378343261] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:57,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:57,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:26:57,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746179604] [2021-06-05 14:26:57,081 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:26:57,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:57,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:26:57,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:26:57,082 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:26:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:57,455 INFO L93 Difference]: Finished difference Result 1012 states and 3929 transitions. [2021-06-05 14:26:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:57,456 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:26:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:57,457 INFO L225 Difference]: With dead ends: 1012 [2021-06-05 14:26:57,457 INFO L226 Difference]: Without dead ends: 1007 [2021-06-05 14:26:57,457 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 512.6ms TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:26:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-06-05 14:26:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 981. [2021-06-05 14:26:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9326530612244897) internal successors, (3854), 980 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3854 transitions. [2021-06-05 14:26:57,467 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3854 transitions. Word has length 18 [2021-06-05 14:26:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:57,467 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3854 transitions. [2021-06-05 14:26:57,468 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:26:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3854 transitions. [2021-06-05 14:26:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:57,469 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:57,469 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:57,669 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 441 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5605 [2021-06-05 14:26:57,669 INFO L430 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:57,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1573096322, now seen corresponding path program 295 times [2021-06-05 14:26:57,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:57,670 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868405011] [2021-06-05 14:26:57,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:57,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:57,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868405011] [2021-06-05 14:26:57,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868405011] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:57,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629876675] [2021-06-05 14:26:57,866 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 442 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 442 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:57,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:26:57,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:57,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:57,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:57,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 25 treesize of output 19 [2021-06-05 14:26:57,989 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:57,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:57,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:26:57,993 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:58,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:58,025 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:58,025 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:86 [2021-06-05 14:26:58,102 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:58,103 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:58,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:26:58,104 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:58,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:58,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:58,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:26:58,108 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:58,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:58,111 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:58,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 25 treesize of output 19 [2021-06-05 14:26:58,112 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:58,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:58,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:26:58,116 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:58,189 INFO L628 ElimStorePlain]: treesize reduction 107, result has 41.5 percent of original size [2021-06-05 14:26:58,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:58,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 11 treesize of output 7 [2021-06-05 14:26:58,193 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:58,224 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:58,225 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:58,225 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:209, output treesize:68 [2021-06-05 14:26:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:58,374 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629876675] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:58,374 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:58,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 14:26:58,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055512701] [2021-06-05 14:26:58,375 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:26:58,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:58,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:26:58,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:26:58,375 INFO L87 Difference]: Start difference. First operand 981 states and 3854 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:26:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:26:58,725 INFO L93 Difference]: Finished difference Result 1022 states and 3954 transitions. [2021-06-05 14:26:58,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:26:58,726 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:26:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:26:58,727 INFO L225 Difference]: With dead ends: 1022 [2021-06-05 14:26:58,727 INFO L226 Difference]: Without dead ends: 1010 [2021-06-05 14:26:58,728 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 495.1ms TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-06-05 14:26:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 978. [2021-06-05 14:26:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:26:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 14:26:58,738 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 14:26:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:26:58,738 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 14:26:58,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:26:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 14:26:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:26:58,739 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:26:58,739 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:26:58,940 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5629,442 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:58,940 INFO L430 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:26:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:26:58,940 INFO L82 PathProgramCache]: Analyzing trace with hash 699355642, now seen corresponding path program 296 times [2021-06-05 14:26:58,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:26:58,940 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668045137] [2021-06-05 14:26:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:26:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:26:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:59,150 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:26:59,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668045137] [2021-06-05 14:26:59,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668045137] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:59,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076505147] [2021-06-05 14:26:59,150 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 443 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 443 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:26:59,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:26:59,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:26:59,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:26:59,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:26:59,280 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:59,281 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:59,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:26:59,282 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:59,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:59,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:26:59,285 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:59,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:59,310 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:59,311 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:65 [2021-06-05 14:26:59,361 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1115], 1=[array_4, v_prenex_1116]} [2021-06-05 14:26:59,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 15 treesize of output 11 [2021-06-05 14:26:59,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:59,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 25 treesize of output 19 [2021-06-05 14:26:59,368 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:59,427 INFO L628 ElimStorePlain]: treesize reduction 85, result has 39.7 percent of original size [2021-06-05 14:26:59,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 19 treesize of output 15 [2021-06-05 14:26:59,430 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:26:59,447 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:59,447 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:26:59,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:26:59,450 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 14:26:59,451 INFO L550 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:26:59,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:26:59,469 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:26:59,469 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:155, output treesize:41 [2021-06-05 14:26:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:26:59,536 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076505147] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:26:59,536 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:26:59,536 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:26:59,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682392592] [2021-06-05 14:26:59,537 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:26:59,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:26:59,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:26:59,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:26:59,537 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:00,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:00,238 INFO L93 Difference]: Finished difference Result 1025 states and 3965 transitions. [2021-06-05 14:27:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:00,238 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:00,240 INFO L225 Difference]: With dead ends: 1025 [2021-06-05 14:27:00,240 INFO L226 Difference]: Without dead ends: 1015 [2021-06-05 14:27:00,240 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 755.7ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:27:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-06-05 14:27:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 975. [2021-06-05 14:27:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 3.935318275154004) internal successors, (3833), 974 states have internal predecessors, (3833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 3833 transitions. [2021-06-05 14:27:00,250 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 3833 transitions. Word has length 18 [2021-06-05 14:27:00,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:00,250 INFO L482 AbstractCegarLoop]: Abstraction has 975 states and 3833 transitions. [2021-06-05 14:27:00,250 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 3833 transitions. [2021-06-05 14:27:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:27:00,251 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:00,251 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:00,452 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5643,443 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:00,452 INFO L430 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:00,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1248272052, now seen corresponding path program 297 times [2021-06-05 14:27:00,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:00,452 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870776590] [2021-06-05 14:27:00,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:00,722 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:00,722 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870776590] [2021-06-05 14:27:00,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870776590] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:00,722 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747864302] [2021-06-05 14:27:00,722 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 444 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 444 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:00,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:27:00,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:00,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:27:00,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:00,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:00,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:00,841 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:00,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:00,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:27:00,844 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:00,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:00,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 26 treesize of output 20 [2021-06-05 14:27:00,848 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:00,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:00,851 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:00,902 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:00,903 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:27:00,903 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:141 [2021-06-05 14:27:01,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:01,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:01,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:27:01,087 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:01,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:01,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 35 treesize of output 27 [2021-06-05 14:27:01,090 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:01,112 INFO L628 ElimStorePlain]: treesize reduction 64, result has 31.9 percent of original size [2021-06-05 14:27:01,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:01,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 11 treesize of output 7 [2021-06-05 14:27:01,115 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:27:01,123 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:01,123 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1118 vanished before elimination [2021-06-05 14:27:01,123 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1117 vanished before elimination [2021-06-05 14:27:01,124 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:01,124 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:114, output treesize:16 [2021-06-05 14:27:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:01,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747864302] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:01,149 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:01,149 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:27:01,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904036501] [2021-06-05 14:27:01,149 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:27:01,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:01,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:27:01,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:27:01,149 INFO L87 Difference]: Start difference. First operand 975 states and 3833 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:01,533 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-06-05 14:27:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:01,885 INFO L93 Difference]: Finished difference Result 1017 states and 3942 transitions. [2021-06-05 14:27:01,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:01,886 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:01,887 INFO L225 Difference]: With dead ends: 1017 [2021-06-05 14:27:01,887 INFO L226 Difference]: Without dead ends: 1012 [2021-06-05 14:27:01,887 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 892.8ms TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:27:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2021-06-05 14:27:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 981. [2021-06-05 14:27:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9357142857142855) internal successors, (3857), 980 states have internal predecessors, (3857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:01,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3857 transitions. [2021-06-05 14:27:01,904 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3857 transitions. Word has length 18 [2021-06-05 14:27:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:01,904 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3857 transitions. [2021-06-05 14:27:01,904 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3857 transitions. [2021-06-05 14:27:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:27:01,906 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:01,906 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:02,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5654,444 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:02,106 INFO L430 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:02,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:02,106 INFO L82 PathProgramCache]: Analyzing trace with hash -691716694, now seen corresponding path program 298 times [2021-06-05 14:27:02,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:02,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165272696] [2021-06-05 14:27:02,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:02,388 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:02,389 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165272696] [2021-06-05 14:27:02,389 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165272696] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:02,389 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318683175] [2021-06-05 14:27:02,389 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 445 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 445 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:02,414 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:27:02,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:02,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:27:02,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:02,488 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:27:02,490 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:02,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,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 15 treesize of output 11 [2021-06-05 14:27:02,494 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:02,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,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 16 treesize of output 12 [2021-06-05 14:27:02,498 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:02,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,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 25 treesize of output 19 [2021-06-05 14:27:02,502 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:02,559 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:02,561 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:27:02,561 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:197, output treesize:161 [2021-06-05 14:27:02,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 21 [2021-06-05 14:27:02,718 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:02,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,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 17 treesize of output 13 [2021-06-05 14:27:02,722 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:02,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,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 25 treesize of output 19 [2021-06-05 14:27:02,726 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:02,729 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,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:27:02,730 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:02,801 INFO L628 ElimStorePlain]: treesize reduction 101, result has 42.9 percent of original size [2021-06-05 14:27:02,804 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:02,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 11 treesize of output 7 [2021-06-05 14:27:02,805 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:27:02,836 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:02,837 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:02,837 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:209, output treesize:68 [2021-06-05 14:27:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:02,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318683175] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:02,961 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:02,961 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2021-06-05 14:27:02,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913573518] [2021-06-05 14:27:02,961 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:27:02,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:02,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:27:02,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:27:02,962 INFO L87 Difference]: Start difference. First operand 981 states and 3857 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:27:03,353 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2021-06-05 14:27:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:03,582 INFO L93 Difference]: Finished difference Result 1037 states and 4000 transitions. [2021-06-05 14:27:03,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:03,583 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:27:03,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:03,584 INFO L225 Difference]: With dead ends: 1037 [2021-06-05 14:27:03,584 INFO L226 Difference]: Without dead ends: 1022 [2021-06-05 14:27:03,584 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 855.1ms TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:27:03,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2021-06-05 14:27:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 981. [2021-06-05 14:27:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9326530612244897) internal successors, (3854), 980 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3854 transitions. [2021-06-05 14:27:03,595 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3854 transitions. Word has length 18 [2021-06-05 14:27:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:03,595 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3854 transitions. [2021-06-05 14:27:03,595 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:27:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3854 transitions. [2021-06-05 14:27:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:27:03,596 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:03,596 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:03,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 445 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5669 [2021-06-05 14:27:03,796 INFO L430 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:03,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1455365034, now seen corresponding path program 299 times [2021-06-05 14:27:03,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:03,797 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731486622] [2021-06-05 14:27:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:04,040 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:04,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731486622] [2021-06-05 14:27:04,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731486622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:04,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341421755] [2021-06-05 14:27:04,040 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 446 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 446 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:04,067 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:27:04,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:04,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:27:04,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:04,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,172 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,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 26 treesize of output 20 [2021-06-05 14:27:04,173 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:04,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,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 25 treesize of output 19 [2021-06-05 14:27:04,177 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:04,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,180 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:04,181 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:04,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,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 16 treesize of output 12 [2021-06-05 14:27:04,184 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:04,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:04,240 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:27:04,240 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:191, output treesize:159 [2021-06-05 14:27:04,419 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 3=[array_4]} [2021-06-05 14:27:04,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:27:04,423 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:04,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,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:27:04,427 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:04,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,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 25 treesize of output 19 [2021-06-05 14:27:04,432 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:04,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:27:04,435 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:04,492 INFO L628 ElimStorePlain]: treesize reduction 95, result has 40.3 percent of original size [2021-06-05 14:27:04,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:04,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 11 treesize of output 7 [2021-06-05 14:27:04,496 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:27:04,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:04,519 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:04,519 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:193, output treesize:44 [2021-06-05 14:27:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:04,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341421755] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:04,590 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:04,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:27:04,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981137396] [2021-06-05 14:27:04,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:27:04,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:04,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:27:04,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:27:04,590 INFO L87 Difference]: Start difference. First operand 981 states and 3854 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:27:04,870 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-06-05 14:27:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:05,139 INFO L93 Difference]: Finished difference Result 1024 states and 3980 transitions. [2021-06-05 14:27:05,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:05,139 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:27:05,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:05,141 INFO L225 Difference]: With dead ends: 1024 [2021-06-05 14:27:05,141 INFO L226 Difference]: Without dead ends: 1019 [2021-06-05 14:27:05,141 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 674.7ms TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2021-06-05 14:27:05,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 980. [2021-06-05 14:27:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 979 states have (on average 3.932584269662921) internal successors, (3850), 979 states have internal predecessors, (3850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 3850 transitions. [2021-06-05 14:27:05,151 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 3850 transitions. Word has length 18 [2021-06-05 14:27:05,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:05,151 INFO L482 AbstractCegarLoop]: Abstraction has 980 states and 3850 transitions. [2021-06-05 14:27:05,151 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 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:27:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 3850 transitions. [2021-06-05 14:27:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:27:05,152 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:05,152 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:05,352 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 446 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5685 [2021-06-05 14:27:05,352 INFO L430 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:05,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:05,353 INFO L82 PathProgramCache]: Analyzing trace with hash 805372912, now seen corresponding path program 300 times [2021-06-05 14:27:05,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:05,353 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337004828] [2021-06-05 14:27:05,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:05,753 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:05,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337004828] [2021-06-05 14:27:05,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337004828] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:05,753 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124254791] [2021-06-05 14:27:05,753 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 447 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 447 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:05,780 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:27:05,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:05,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:27:05,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:05,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:05,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-06-05 14:27:05,869 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:05,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:05,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 15 treesize of output 11 [2021-06-05 14:27:05,873 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:05,875 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:05,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:05,876 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:05,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 25 treesize of output 19 [2021-06-05 14:27:05,879 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:05,913 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:05,914 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:27:05,914 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:143, output treesize:107 [2021-06-05 14:27:06,027 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:06,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 27 treesize of output 21 [2021-06-05 14:27:06,028 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:06,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:06,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 17 treesize of output 13 [2021-06-05 14:27:06,031 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:06,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27: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 25 treesize of output 19 [2021-06-05 14:27:06,035 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:06,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:06,037 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:06,073 INFO L628 ElimStorePlain]: treesize reduction 68, result has 38.7 percent of original size [2021-06-05 14:27:06,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 11 treesize of output 7 [2021-06-05 14:27:06,076 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:27:06,090 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:06,091 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:06,091 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:143, output treesize:35 [2021-06-05 14:27:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:06,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124254791] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:06,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:06,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:27:06,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817837831] [2021-06-05 14:27:06,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:27:06,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:06,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:27:06,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:27:06,149 INFO L87 Difference]: Start difference. First operand 980 states and 3850 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:06,606 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2021-06-05 14:27:06,914 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2021-06-05 14:27:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:07,249 INFO L93 Difference]: Finished difference Result 1038 states and 4005 transitions. [2021-06-05 14:27:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:27:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:27:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:07,251 INFO L225 Difference]: With dead ends: 1038 [2021-06-05 14:27:07,251 INFO L226 Difference]: Without dead ends: 1028 [2021-06-05 14:27:07,251 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1203.5ms TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:27:07,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-06-05 14:27:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 978. [2021-06-05 14:27:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:07,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 14:27:07,261 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 14:27:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:07,261 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 14:27:07,261 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 14:27:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:27:07,262 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:07,263 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:07,463 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 447 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5712 [2021-06-05 14:27:07,463 INFO L430 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:07,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:07,463 INFO L82 PathProgramCache]: Analyzing trace with hash 126667614, now seen corresponding path program 301 times [2021-06-05 14:27:07,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:07,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750537792] [2021-06-05 14:27:07,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:08,177 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:08,177 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750537792] [2021-06-05 14:27:08,177 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750537792] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:08,177 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661366528] [2021-06-05 14:27:08,177 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 448 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 448 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:08,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjunts are in the unsatisfiable core [2021-06-05 14:27:08,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:08,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:08,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 26 treesize of output 20 [2021-06-05 14:27:08,306 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:08,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:08,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 16 treesize of output 12 [2021-06-05 14:27:08,310 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:08,312 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:08,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:08,313 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:08,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 25 treesize of output 19 [2021-06-05 14:27:08,316 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:08,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:08,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:27:08,358 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:155, output treesize:123 [2021-06-05 14:27:08,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:08,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 25 treesize of output 19 [2021-06-05 14:27:08,481 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:08,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:08,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:27:08,484 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:08,487 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:08,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 15 treesize of output 11 [2021-06-05 14:27:08,488 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:08,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 25 treesize of output 19 [2021-06-05 14:27:08,491 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:08,526 INFO L628 ElimStorePlain]: treesize reduction 68, result has 41.9 percent of original size [2021-06-05 14:27:08,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 22 treesize of output 14 [2021-06-05 14:27:08,529 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:08,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:08,543 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:08,543 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:27:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:08,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661366528] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:08,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:08,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2021-06-05 14:27:08,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075455287] [2021-06-05 14:27:08,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 14:27:08,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:08,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 14:27:08,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:27:08,614 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:09,115 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2021-06-05 14:27:09,325 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2021-06-05 14:27:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:09,702 INFO L93 Difference]: Finished difference Result 1019 states and 3955 transitions. [2021-06-05 14:27:09,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:09,702 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:27:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:09,704 INFO L225 Difference]: With dead ends: 1019 [2021-06-05 14:27:09,704 INFO L226 Difference]: Without dead ends: 1014 [2021-06-05 14:27:09,704 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1515.1ms TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:27:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2021-06-05 14:27:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 978. [2021-06-05 14:27:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 977 states have (on average 3.932446264073695) internal successors, (3842), 977 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 3842 transitions. [2021-06-05 14:27:09,716 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 3842 transitions. Word has length 18 [2021-06-05 14:27:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:09,716 INFO L482 AbstractCegarLoop]: Abstraction has 978 states and 3842 transitions. [2021-06-05 14:27:09,716 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 3842 transitions. [2021-06-05 14:27:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:27:09,717 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:09,717 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:09,918 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 448 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5726 [2021-06-05 14:27:09,918 INFO L430 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:09,918 INFO L82 PathProgramCache]: Analyzing trace with hash -884569992, now seen corresponding path program 302 times [2021-06-05 14:27:09,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:09,918 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133003244] [2021-06-05 14:27:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:10,285 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2021-06-05 14:27:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:10,557 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:10,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133003244] [2021-06-05 14:27:10,558 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133003244] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:10,558 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830477273] [2021-06-05 14:27:10,558 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 449 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 449 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:10,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:27:10,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:10,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:27:10,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:10,713 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:10,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:10,714 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:10,717 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:10,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:27:10,718 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:10,720 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:10,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:27:10,721 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:10,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:10,724 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:10,775 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:10,776 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:27:10,776 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:141 [2021-06-05 14:27:10,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:10,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:10,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 25 treesize of output 19 [2021-06-05 14:27:10,973 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:10,975 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:10,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 35 treesize of output 27 [2021-06-05 14:27:10,976 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:10,999 INFO L628 ElimStorePlain]: treesize reduction 62, result has 36.7 percent of original size [2021-06-05 14:27:11,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:11,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 22 treesize of output 14 [2021-06-05 14:27:11,002 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:11,009 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:11,010 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1123 vanished before elimination [2021-06-05 14:27:11,010 INFO L518 ElimStorePlain]: Eliminatee v_prenex_1124 vanished before elimination [2021-06-05 14:27:11,010 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:11,010 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:114, output treesize:16 [2021-06-05 14:27:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:11,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830477273] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:11,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:11,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2021-06-05 14:27:11,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912400706] [2021-06-05 14:27:11,040 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:11,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:11,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:11,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:11,041 INFO L87 Difference]: Start difference. First operand 978 states and 3842 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:27:11,648 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 56 [2021-06-05 14:27:11,923 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 55 [2021-06-05 14:27:12,256 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 60 [2021-06-05 14:27:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:12,394 INFO L93 Difference]: Finished difference Result 1068 states and 4102 transitions. [2021-06-05 14:27:12,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:27:12,394 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:27:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:12,396 INFO L225 Difference]: With dead ends: 1068 [2021-06-05 14:27:12,396 INFO L226 Difference]: Without dead ends: 1058 [2021-06-05 14:27:12,396 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1787.7ms TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:27:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2021-06-05 14:27:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 972. [2021-06-05 14:27:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 3.938208032955716) internal successors, (3824), 971 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3824 transitions. [2021-06-05 14:27:12,406 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3824 transitions. Word has length 18 [2021-06-05 14:27:12,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:12,406 INFO L482 AbstractCegarLoop]: Abstraction has 972 states and 3824 transitions. [2021-06-05 14:27:12,406 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 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:27:12,406 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3824 transitions. [2021-06-05 14:27:12,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:27:12,407 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:12,407 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:12,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 449 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5740 [2021-06-05 14:27:12,608 INFO L430 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:12,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:12,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1041749102, now seen corresponding path program 303 times [2021-06-05 14:27:12,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:12,608 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066474904] [2021-06-05 14:27:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:12,894 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:12,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066474904] [2021-06-05 14:27:12,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066474904] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:12,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655676533] [2021-06-05 14:27:12,894 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 450 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 450 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:12,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:27:12,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:12,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:27:12,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:13,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:13,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:27:13,049 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:13,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:13,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:13,053 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:13,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:13,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:27:13,057 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:13,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:13,060 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:13,105 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:13,107 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:27:13,107 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:161, output treesize:129 [2021-06-05 14:27:13,231 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1126], 1=[array_4, v_prenex_1127]} [2021-06-05 14:27:13,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 25 treesize of output 19 [2021-06-05 14:27:13,234 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:13,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 15 treesize of output 11 [2021-06-05 14:27:13,237 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:13,287 INFO L628 ElimStorePlain]: treesize reduction 83, result has 39.4 percent of original size [2021-06-05 14:27:13,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 27 treesize of output 21 [2021-06-05 14:27:13,290 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:13,305 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:13,305 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:13,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 22 treesize of output 14 [2021-06-05 14:27:13,307 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:13,321 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:13,321 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:13,321 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:35 [2021-06-05 14:27:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:13,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655676533] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:13,386 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:13,386 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-06-05 14:27:13,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029588985] [2021-06-05 14:27:13,386 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 14:27:13,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:13,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 14:27:13,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:27:13,386 INFO L87 Difference]: Start difference. First operand 972 states and 3824 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:13,921 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2021-06-05 14:27:14,080 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2021-06-05 14:27:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:14,468 INFO L93 Difference]: Finished difference Result 1048 states and 4045 transitions. [2021-06-05 14:27:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:14,468 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:27:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:14,470 INFO L225 Difference]: With dead ends: 1048 [2021-06-05 14:27:14,470 INFO L226 Difference]: Without dead ends: 1038 [2021-06-05 14:27:14,470 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1131.5ms TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:27:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-06-05 14:27:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 972. [2021-06-05 14:27:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 3.938208032955716) internal successors, (3824), 971 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3824 transitions. [2021-06-05 14:27:14,480 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3824 transitions. Word has length 18 [2021-06-05 14:27:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:14,480 INFO L482 AbstractCegarLoop]: Abstraction has 972 states and 3824 transitions. [2021-06-05 14:27:14,480 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:14,480 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3824 transitions. [2021-06-05 14:27:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:27:14,481 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:14,481 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:14,681 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5755,450 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:14,682 INFO L430 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:14,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:14,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1952554566, now seen corresponding path program 304 times [2021-06-05 14:27:14,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:14,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597029592] [2021-06-05 14:27:14,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:15,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:15,130 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:15,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597029592] [2021-06-05 14:27:15,130 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597029592] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:15,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772347029] [2021-06-05 14:27:15,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 451 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 451 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:15,156 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:27:15,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:15,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 14:27:15,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:15,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:15,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:15,256 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:15,259 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:15,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:15,260 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:15,262 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:15,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 25 treesize of output 19 [2021-06-05 14:27:15,263 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:15,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:27:15,266 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:15,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:15,300 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:27:15,300 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:129, output treesize:97 [2021-06-05 14:27:15,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:15,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 25 treesize of output 19 [2021-06-05 14:27:15,461 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:15,464 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:15,464 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:27:15,465 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:15,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:15,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:15,468 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:15,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:27:15,472 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:15,526 INFO L628 ElimStorePlain]: treesize reduction 87, result has 42.4 percent of original size [2021-06-05 14:27:15,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 22 treesize of output 14 [2021-06-05 14:27:15,529 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:15,551 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:15,552 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:15,552 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:181, output treesize:50 [2021-06-05 14:27:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:15,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772347029] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:15,673 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:15,673 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 14:27:15,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096441277] [2021-06-05 14:27:15,673 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 14:27:15,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:15,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 14:27:15,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:27:15,673 INFO L87 Difference]: Start difference. First operand 972 states and 3824 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:16,137 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2021-06-05 14:27:16,650 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2021-06-05 14:27:16,825 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2021-06-05 14:27:16,990 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2021-06-05 14:27:17,144 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2021-06-05 14:27:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:17,380 INFO L93 Difference]: Finished difference Result 1278 states and 4854 transitions. [2021-06-05 14:27:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:27:17,380 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:27:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:17,382 INFO L225 Difference]: With dead ends: 1278 [2021-06-05 14:27:17,382 INFO L226 Difference]: Without dead ends: 1256 [2021-06-05 14:27:17,382 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1955.3ms TimeCoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 14:27:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2021-06-05 14:27:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 984. [2021-06-05 14:27:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 983 states have (on average 3.9389623601220753) internal successors, (3872), 983 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 3872 transitions. [2021-06-05 14:27:17,394 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 3872 transitions. Word has length 18 [2021-06-05 14:27:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:17,394 INFO L482 AbstractCegarLoop]: Abstraction has 984 states and 3872 transitions. [2021-06-05 14:27:17,394 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 3872 transitions. [2021-06-05 14:27:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:27:17,395 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:17,395 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:17,595 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 451 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5770 [2021-06-05 14:27:17,596 INFO L430 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:17,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:17,596 INFO L82 PathProgramCache]: Analyzing trace with hash -677605888, now seen corresponding path program 305 times [2021-06-05 14:27:17,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:17,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504045219] [2021-06-05 14:27:17,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:17,901 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:17,901 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504045219] [2021-06-05 14:27:17,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504045219] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:17,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814915146] [2021-06-05 14:27:17,902 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 452 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 452 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:17,928 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:27:17,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:17,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:27:17,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:18,001 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:18,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 26 treesize of output 20 [2021-06-05 14:27:18,002 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:18,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:18,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:18,005 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:18,007 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:18,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 25 treesize of output 19 [2021-06-05 14:27:18,008 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:18,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:18,011 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:18,035 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:18,036 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:27:18,036 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:111, output treesize:79 [2021-06-05 14:27:18,175 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:18,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 25 treesize of output 19 [2021-06-05 14:27:18,177 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:18,179 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:18,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2021-06-05 14:27:18,180 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:18,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:18,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:27:18,183 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:18,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:27:18,186 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:18,222 INFO L628 ElimStorePlain]: treesize reduction 74, result has 36.8 percent of original size [2021-06-05 14:27:18,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 11 treesize of output 7 [2021-06-05 14:27:18,226 INFO L550 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 14:27:18,240 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:18,240 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:18,240 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:151, output treesize:35 [2021-06-05 14:27:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:18,305 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814915146] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:18,305 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:18,305 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:18,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700369221] [2021-06-05 14:27:18,305 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:18,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:18,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:18,305 INFO L87 Difference]: Start difference. First operand 984 states and 3872 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:18,823 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-06-05 14:27:19,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:19,342 INFO L93 Difference]: Finished difference Result 1164 states and 4532 transitions. [2021-06-05 14:27:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:19,342 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have 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:27:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:19,344 INFO L225 Difference]: With dead ends: 1164 [2021-06-05 14:27:19,344 INFO L226 Difference]: Without dead ends: 1159 [2021-06-05 14:27:19,344 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1103.2ms TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:27:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2021-06-05 14:27:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 982. [2021-06-05 14:27:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 3.9429153924566767) internal successors, (3868), 981 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 3868 transitions. [2021-06-05 14:27:19,355 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 3868 transitions. Word has length 18 [2021-06-05 14:27:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:19,355 INFO L482 AbstractCegarLoop]: Abstraction has 982 states and 3868 transitions. [2021-06-05 14:27:19,355 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 3868 transitions. [2021-06-05 14:27:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:27:19,356 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:19,356 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:19,557 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 452 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5783 [2021-06-05 14:27:19,557 INFO L430 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1248428190, now seen corresponding path program 306 times [2021-06-05 14:27:19,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:19,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997284882] [2021-06-05 14:27:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:19,755 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:19,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997284882] [2021-06-05 14:27:19,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997284882] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:19,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197465852] [2021-06-05 14:27:19,755 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 453 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 453 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:19,781 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:27:19,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:19,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:27:19,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:19,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:19,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:19,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 16 treesize of output 12 [2021-06-05 14:27:19,902 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:19,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:19,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:19,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:27:19,906 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:19,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:19,909 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:19,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 25 treesize of output 19 [2021-06-05 14:27:19,910 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:19,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:19,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select 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 20 [2021-06-05 14:27:19,914 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:19,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:19,977 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:27:19,977 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:173, output treesize:141 [2021-06-05 14:27:20,110 INFO L446 ElimStorePlain]: Different costs {0=[array_0, v_prenex_1128], 1=[array_4, v_prenex_1129]} [2021-06-05 14:27:20,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 15 treesize of output 11 [2021-06-05 14:27:20,114 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:20,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 25 treesize of output 19 [2021-06-05 14:27:20,117 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:20,165 INFO L628 ElimStorePlain]: treesize reduction 89, result has 40.3 percent of original size [2021-06-05 14:27:20,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 27 treesize of output 21 [2021-06-05 14:27:20,168 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:20,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:20,186 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:20,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:20,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 22 treesize of output 14 [2021-06-05 14:27:20,188 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:20,205 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:20,206 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:20,206 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:163, output treesize:41 [2021-06-05 14:27:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:20,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197465852] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:20,278 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:20,278 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:27:20,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929895856] [2021-06-05 14:27:20,278 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:27:20,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:20,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:27:20,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:27:20,279 INFO L87 Difference]: Start difference. First operand 982 states and 3868 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:20,740 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2021-06-05 14:27:20,925 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2021-06-05 14:27:21,340 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2021-06-05 14:27:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:21,414 INFO L93 Difference]: Finished difference Result 1157 states and 4510 transitions. [2021-06-05 14:27:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:21,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:21,416 INFO L225 Difference]: With dead ends: 1157 [2021-06-05 14:27:21,416 INFO L226 Difference]: Without dead ends: 1147 [2021-06-05 14:27:21,416 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1184.2ms TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:27:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2021-06-05 14:27:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 981. [2021-06-05 14:27:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 980 states have (on average 3.9448979591836735) internal successors, (3866), 980 states have internal predecessors, (3866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:21,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 3866 transitions. [2021-06-05 14:27:21,427 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 3866 transitions. Word has length 18 [2021-06-05 14:27:21,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:21,427 INFO L482 AbstractCegarLoop]: Abstraction has 981 states and 3866 transitions. [2021-06-05 14:27:21,428 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 3866 transitions. [2021-06-05 14:27:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 14:27:21,429 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:21,429 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:21,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5797,453 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:21,645 INFO L430 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:21,645 INFO L82 PathProgramCache]: Analyzing trace with hash -19028988, now seen corresponding path program 307 times [2021-06-05 14:27:21,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:21,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026859577] [2021-06-05 14:27:21,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:21,844 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:21,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026859577] [2021-06-05 14:27:21,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026859577] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:21,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135894218] [2021-06-05 14:27:21,844 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 454 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 454 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:21,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 25 conjunts are in the unsatisfiable core [2021-06-05 14:27:21,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:22,011 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:22,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:22,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:22,013 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:22,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:22,016 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:22,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2021-06-05 14:27:22,017 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:22,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:22,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:22,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:22,021 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:22,024 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:22,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 26 treesize of output 20 [2021-06-05 14:27:22,025 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:22,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:22,077 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 14:27:22,077 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:167, output treesize:135 [2021-06-05 14:27:22,236 INFO L446 ElimStorePlain]: Different costs {1=[array_0], 10=[array_4]} [2021-06-05 14:27:22,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:22,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 25 treesize of output 19 [2021-06-05 14:27:22,240 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:22,243 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:22,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 35 treesize of output 27 [2021-06-05 14:27:22,244 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:22,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:22,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:22,248 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:22,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 25 treesize of output 19 [2021-06-05 14:27:22,251 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:22,298 INFO L628 ElimStorePlain]: treesize reduction 80, result has 43.3 percent of original size [2021-06-05 14:27:22,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:22,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 22 treesize of output 14 [2021-06-05 14:27:22,302 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:22,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:22,322 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:22,322 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:175, output treesize:35 [2021-06-05 14:27:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:22,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135894218] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:22,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:22,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:27:22,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542818201] [2021-06-05 14:27:22,387 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:27:22,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:22,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:27:22,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:27:22,387 INFO L87 Difference]: Start difference. First operand 981 states and 3866 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:22,892 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2021-06-05 14:27:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:23,331 INFO L93 Difference]: Finished difference Result 1160 states and 4546 transitions. [2021-06-05 14:27:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:23,331 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:23,333 INFO L225 Difference]: With dead ends: 1160 [2021-06-05 14:27:23,333 INFO L226 Difference]: Without dead ends: 1155 [2021-06-05 14:27:23,333 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 882.3ms TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:27:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2021-06-05 14:27:23,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 975. [2021-06-05 14:27:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 974 states have (on average 3.9507186858316223) internal successors, (3848), 974 states have internal predecessors, (3848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 3848 transitions. [2021-06-05 14:27:23,344 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 3848 transitions. Word has length 18 [2021-06-05 14:27:23,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:23,344 INFO L482 AbstractCegarLoop]: Abstraction has 975 states and 3848 transitions. [2021-06-05 14:27:23,344 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:27:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 3848 transitions. [2021-06-05 14:27:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:23,345 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:23,345 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:23,546 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 454 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5812 [2021-06-05 14:27:23,546 INFO L430 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1736350512, now seen corresponding path program 308 times [2021-06-05 14:27:23,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:23,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398078274] [2021-06-05 14:27:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:23,644 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:23,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398078274] [2021-06-05 14:27:23,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398078274] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:23,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770398425] [2021-06-05 14:27:23,644 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 455 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 455 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:23,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:27:23,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:23,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:23,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:23,737 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:23,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 16 treesize of output 12 [2021-06-05 14:27:23,738 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:23,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:23,740 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:23,752 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:23,753 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:23,753 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:23,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:23,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 15 treesize of output 11 [2021-06-05 14:27:23,818 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:23,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 16 treesize of output 12 [2021-06-05 14:27:23,820 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:23,834 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:27:23,834 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:23,834 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:27:23,834 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:27:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:23,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770398425] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:23,853 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:23,853 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:23,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797792369] [2021-06-05 14:27:23,854 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:23,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:23,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:23,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:23,854 INFO L87 Difference]: Start difference. First operand 975 states and 3848 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:24,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:24,258 INFO L93 Difference]: Finished difference Result 1265 states and 4852 transitions. [2021-06-05 14:27:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:24,258 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:24,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:24,260 INFO L225 Difference]: With dead ends: 1265 [2021-06-05 14:27:24,260 INFO L226 Difference]: Without dead ends: 1265 [2021-06-05 14:27:24,260 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 306.2ms TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:27:24,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2021-06-05 14:27:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 988. [2021-06-05 14:27:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 3.951367781155015) internal successors, (3900), 987 states have internal predecessors, (3900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 3900 transitions. [2021-06-05 14:27:24,272 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 3900 transitions. Word has length 19 [2021-06-05 14:27:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:24,272 INFO L482 AbstractCegarLoop]: Abstraction has 988 states and 3900 transitions. [2021-06-05 14:27:24,272 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 3900 transitions. [2021-06-05 14:27:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:24,274 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:24,274 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:24,474 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 455 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5829 [2021-06-05 14:27:24,474 INFO L430 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:24,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:24,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1780604390, now seen corresponding path program 309 times [2021-06-05 14:27:24,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:24,474 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371531413] [2021-06-05 14:27:24,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:24,536 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:24,536 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371531413] [2021-06-05 14:27:24,536 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371531413] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:24,536 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617117660] [2021-06-05 14:27:24,536 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 456 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 456 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:24,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:27:24,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:24,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:24,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:24,608 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:24,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 16 treesize of output 12 [2021-06-05 14:27:24,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:24,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:24,611 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:24,623 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:24,623 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:24,623 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:24,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:24,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:24,670 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:24,671 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:27:24,672 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:24,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:27:24,674 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:24,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 16 treesize of output 12 [2021-06-05 14:27:24,676 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:24,690 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 14:27:24,690 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:24,690 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:24,690 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 14:27:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:24,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617117660] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:24,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:24,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2021-06-05 14:27:24,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174498194] [2021-06-05 14:27:24,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:27:24,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:24,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:27:24,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:27:24,709 INFO L87 Difference]: Start difference. First operand 988 states and 3900 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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:27:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:25,037 INFO L93 Difference]: Finished difference Result 1177 states and 4540 transitions. [2021-06-05 14:27:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:25,037 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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:27:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:25,039 INFO L225 Difference]: With dead ends: 1177 [2021-06-05 14:27:25,039 INFO L226 Difference]: Without dead ends: 1163 [2021-06-05 14:27:25,039 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 288.2ms TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:25,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2021-06-05 14:27:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 988. [2021-06-05 14:27:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 3.9463019250253293) internal successors, (3895), 987 states have internal predecessors, (3895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 3895 transitions. [2021-06-05 14:27:25,050 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 3895 transitions. Word has length 19 [2021-06-05 14:27:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:25,050 INFO L482 AbstractCegarLoop]: Abstraction has 988 states and 3895 transitions. [2021-06-05 14:27:25,050 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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:27:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 3895 transitions. [2021-06-05 14:27:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:25,052 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:25,052 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:25,252 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5832,456 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:25,252 INFO L430 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:25,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:25,252 INFO L82 PathProgramCache]: Analyzing trace with hash 609550430, now seen corresponding path program 310 times [2021-06-05 14:27:25,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:25,252 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540519724] [2021-06-05 14:27:25,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:25,369 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:25,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540519724] [2021-06-05 14:27:25,369 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540519724] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:25,369 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606300323] [2021-06-05 14:27:25,369 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 457 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 457 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:25,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:27:25,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:25,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:25,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:25,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:25,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 16 treesize of output 12 [2021-06-05 14:27:25,484 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:25,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:25,486 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:25,497 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:25,498 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:25,498 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:25,573 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:25,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 15 treesize of output 11 [2021-06-05 14:27:25,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:25,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 16 treesize of output 12 [2021-06-05 14:27:25,576 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:25,589 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:27:25,589 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:25,589 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:27:25,590 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:27:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:25,608 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606300323] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:25,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:25,609 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:25,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243623733] [2021-06-05 14:27:25,609 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:25,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:25,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:25,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:25,609 INFO L87 Difference]: Start difference. First operand 988 states and 3895 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:26,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:26,026 INFO L93 Difference]: Finished difference Result 1184 states and 4571 transitions. [2021-06-05 14:27:26,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:26,026 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:26,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:26,028 INFO L225 Difference]: With dead ends: 1184 [2021-06-05 14:27:26,028 INFO L226 Difference]: Without dead ends: 1184 [2021-06-05 14:27:26,028 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 357.3ms TimeCoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:27:26,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2021-06-05 14:27:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 991. [2021-06-05 14:27:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 3.9464646464646465) internal successors, (3907), 990 states have internal predecessors, (3907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 3907 transitions. [2021-06-05 14:27:26,039 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 3907 transitions. Word has length 19 [2021-06-05 14:27:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:26,039 INFO L482 AbstractCegarLoop]: Abstraction has 991 states and 3907 transitions. [2021-06-05 14:27:26,039 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 3907 transitions. [2021-06-05 14:27:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:26,041 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:26,041 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:26,241 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 457 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5838 [2021-06-05 14:27:26,241 INFO L430 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:26,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:26,241 INFO L82 PathProgramCache]: Analyzing trace with hash -999033840, now seen corresponding path program 311 times [2021-06-05 14:27:26,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:26,241 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624124208] [2021-06-05 14:27:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:26,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:26,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624124208] [2021-06-05 14:27:26,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624124208] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:26,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073161781] [2021-06-05 14:27:26,309 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 458 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 458 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:26,335 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:27:26,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:26,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:26,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:26,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 15 treesize of output 11 [2021-06-05 14:27:26,381 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:26,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:27:26,384 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:26,396 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:26,396 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:26,396 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 14:27:26,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:26,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:26,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:26,471 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:27:26,471 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:26,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 7 treesize of output 5 [2021-06-05 14:27:26,474 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:26,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 16 treesize of output 12 [2021-06-05 14:27:26,476 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:26,489 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 14:27:26,489 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:26,489 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:26,490 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 14:27:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:26,508 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073161781] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:26,508 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:26,508 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:26,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473207184] [2021-06-05 14:27:26,508 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:26,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:26,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:26,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:26,508 INFO L87 Difference]: Start difference. First operand 991 states and 3907 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:26,854 INFO L93 Difference]: Finished difference Result 1189 states and 4580 transitions. [2021-06-05 14:27:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:26,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:26,856 INFO L225 Difference]: With dead ends: 1189 [2021-06-05 14:27:26,856 INFO L226 Difference]: Without dead ends: 1181 [2021-06-05 14:27:26,856 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 331.8ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:27:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2021-06-05 14:27:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 991. [2021-06-05 14:27:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 3.9434343434343435) internal successors, (3904), 990 states have internal predecessors, (3904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 3904 transitions. [2021-06-05 14:27:26,867 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 3904 transitions. Word has length 19 [2021-06-05 14:27:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:26,867 INFO L482 AbstractCegarLoop]: Abstraction has 991 states and 3904 transitions. [2021-06-05 14:27:26,867 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 3904 transitions. [2021-06-05 14:27:26,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:26,869 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:26,869 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:27,069 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5841,458 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:27,069 INFO L430 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:27,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:27,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2090788300, now seen corresponding path program 312 times [2021-06-05 14:27:27,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:27,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56456417] [2021-06-05 14:27:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:27,178 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:27,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56456417] [2021-06-05 14:27:27,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56456417] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:27,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329049860] [2021-06-05 14:27:27,178 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 459 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 459 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:27,204 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:27:27,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:27,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:27,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:27,290 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:27,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:27,291 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:27,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 15 treesize of output 11 [2021-06-05 14:27:27,294 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:27,307 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:27,308 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:27,308 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:27,368 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:27,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:27:27,369 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:27,371 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:27,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:27,372 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:27,374 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27: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 16 treesize of output 12 [2021-06-05 14:27:27,375 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:27,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 16 treesize of output 12 [2021-06-05 14:27:27,377 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:27,408 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:27,408 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:27,409 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:27,409 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:27,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329049860] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:27,457 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:27,458 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:27,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332451487] [2021-06-05 14:27:27,458 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:27,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:27,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:27,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:27,458 INFO L87 Difference]: Start difference. First operand 991 states and 3904 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:28,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:28,067 INFO L93 Difference]: Finished difference Result 1217 states and 4654 transitions. [2021-06-05 14:27:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:27:28,067 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:28,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:28,069 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 14:27:28,069 INFO L226 Difference]: Without dead ends: 1217 [2021-06-05 14:27:28,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 532.4ms TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:27:28,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-06-05 14:27:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 994. [2021-06-05 14:27:28,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 3.9466263846928498) internal successors, (3919), 993 states have internal predecessors, (3919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 3919 transitions. [2021-06-05 14:27:28,080 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 3919 transitions. Word has length 19 [2021-06-05 14:27:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:28,080 INFO L482 AbstractCegarLoop]: Abstraction has 994 states and 3919 transitions. [2021-06-05 14:27:28,080 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 3919 transitions. [2021-06-05 14:27:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:28,082 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:28,082 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:28,282 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5847,459 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:28,282 INFO L430 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:28,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:28,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1009142822, now seen corresponding path program 313 times [2021-06-05 14:27:28,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:28,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151323098] [2021-06-05 14:27:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:28,361 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:28,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151323098] [2021-06-05 14:27:28,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151323098] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:28,361 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460648886] [2021-06-05 14:27:28,361 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 460 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 460 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:28,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:28,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:28,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 15 treesize of output 11 [2021-06-05 14:27:28,439 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:28,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 16 treesize of output 12 [2021-06-05 14:27:28,441 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:28,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:28,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:28,454 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 14:27:28,516 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:28,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 16 treesize of output 12 [2021-06-05 14:27:28,517 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:28,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:28,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 16 treesize of output 12 [2021-06-05 14:27:28,520 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:28,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:28,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:28,522 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:28,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 17 treesize of output 13 [2021-06-05 14:27:28,525 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:28,557 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 14:27:28,558 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:28,558 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:28,558 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 14:27:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:28,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460648886] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:28,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:28,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:28,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957370184] [2021-06-05 14:27:28,613 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:28,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:28,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:28,613 INFO L87 Difference]: Start difference. First operand 994 states and 3919 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:29,181 INFO L93 Difference]: Finished difference Result 1208 states and 4629 transitions. [2021-06-05 14:27:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:27:29,182 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:29,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:29,184 INFO L225 Difference]: With dead ends: 1208 [2021-06-05 14:27:29,184 INFO L226 Difference]: Without dead ends: 1204 [2021-06-05 14:27:29,184 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 506.5ms TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:27:29,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2021-06-05 14:27:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 998. [2021-06-05 14:27:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 3.945837512537613) internal successors, (3934), 997 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 3934 transitions. [2021-06-05 14:27:29,195 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 3934 transitions. Word has length 19 [2021-06-05 14:27:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:29,195 INFO L482 AbstractCegarLoop]: Abstraction has 998 states and 3934 transitions. [2021-06-05 14:27:29,195 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 3934 transitions. [2021-06-05 14:27:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:29,196 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:29,196 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:29,397 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5852,460 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:29,397 INFO L430 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:29,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:29,397 INFO L82 PathProgramCache]: Analyzing trace with hash 419812284, now seen corresponding path program 314 times [2021-06-05 14:27:29,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:29,397 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136151840] [2021-06-05 14:27:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:29,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:29,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136151840] [2021-06-05 14:27:29,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136151840] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:29,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654391733] [2021-06-05 14:27:29,527 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 461 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 461 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:29,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:27:29,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:29,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:29,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:29,618 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:29,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 16 treesize of output 12 [2021-06-05 14:27:29,619 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:29,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 15 treesize of output 11 [2021-06-05 14:27:29,621 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:29,632 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:29,633 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:29,633 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:29,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:29,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:29,692 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:29,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27: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 17 treesize of output 13 [2021-06-05 14:27:29,695 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:29,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:29,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:29,698 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:29,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:29,700 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:29,730 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:29,730 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:29,730 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:29,730 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:29,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654391733] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:29,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:29,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:29,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437098232] [2021-06-05 14:27:29,787 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:29,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:29,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:29,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:29,788 INFO L87 Difference]: Start difference. First operand 998 states and 3934 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:30,368 INFO L93 Difference]: Finished difference Result 1200 states and 4622 transitions. [2021-06-05 14:27:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:27:30,368 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:30,370 INFO L225 Difference]: With dead ends: 1200 [2021-06-05 14:27:30,370 INFO L226 Difference]: Without dead ends: 1197 [2021-06-05 14:27:30,370 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 549.4ms TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:27:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2021-06-05 14:27:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 998. [2021-06-05 14:27:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 3.9428284854563693) internal successors, (3931), 997 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 3931 transitions. [2021-06-05 14:27:30,381 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 3931 transitions. Word has length 19 [2021-06-05 14:27:30,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:30,382 INFO L482 AbstractCegarLoop]: Abstraction has 998 states and 3931 transitions. [2021-06-05 14:27:30,382 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:30,382 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 3931 transitions. [2021-06-05 14:27:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:30,383 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:30,383 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:30,583 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 461 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5859 [2021-06-05 14:27:30,583 INFO L430 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:30,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:30,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1345835728, now seen corresponding path program 315 times [2021-06-05 14:27:30,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:30,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142738580] [2021-06-05 14:27:30,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:30,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:30,663 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:30,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142738580] [2021-06-05 14:27:30,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142738580] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:30,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629857462] [2021-06-05 14:27:30,663 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 462 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 462 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:30,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:27:30,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:30,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:30,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:30,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 15 treesize of output 11 [2021-06-05 14:27:30,736 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:30,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 16 treesize of output 12 [2021-06-05 14:27:30,738 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:30,750 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:30,751 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:30,751 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 14:27:30,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:30,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 16 treesize of output 12 [2021-06-05 14:27:30,817 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:30,819 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:30,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 16 treesize of output 12 [2021-06-05 14:27:30,819 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:30,821 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:30,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:27:30,822 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:30,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 17 treesize of output 13 [2021-06-05 14:27:30,825 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:30,856 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 14:27:30,856 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:30,856 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:30,856 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 14:27:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:30,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629857462] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:30,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:30,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:30,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396029677] [2021-06-05 14:27:30,900 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:30,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:30,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:30,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:30,900 INFO L87 Difference]: Start difference. First operand 998 states and 3931 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:31,350 INFO L93 Difference]: Finished difference Result 1190 states and 4592 transitions. [2021-06-05 14:27:31,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:27:31,351 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:31,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:31,352 INFO L225 Difference]: With dead ends: 1190 [2021-06-05 14:27:31,352 INFO L226 Difference]: Without dead ends: 1190 [2021-06-05 14:27:31,353 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 403.5ms TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:27:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2021-06-05 14:27:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 994. [2021-06-05 14:27:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 3.9405840886203425) internal successors, (3913), 993 states have internal predecessors, (3913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 3913 transitions. [2021-06-05 14:27:31,364 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 3913 transitions. Word has length 19 [2021-06-05 14:27:31,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:31,364 INFO L482 AbstractCegarLoop]: Abstraction has 994 states and 3913 transitions. [2021-06-05 14:27:31,364 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 3913 transitions. [2021-06-05 14:27:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:31,365 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:31,365 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:31,565 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 462 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5866 [2021-06-05 14:27:31,566 INFO L430 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:31,566 INFO L82 PathProgramCache]: Analyzing trace with hash -463534950, now seen corresponding path program 316 times [2021-06-05 14:27:31,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:31,566 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375737323] [2021-06-05 14:27:31,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:31,673 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:31,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375737323] [2021-06-05 14:27:31,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375737323] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:31,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415735187] [2021-06-05 14:27:31,673 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 463 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 463 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:31,699 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:27:31,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:31,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:31,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:31,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:31,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:27:31,783 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:31,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:31,786 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:31,800 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:31,800 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:31,800 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:31,853 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:31,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:31,854 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:31,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 16 treesize of output 12 [2021-06-05 14:27:31,856 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:31,869 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:27:31,869 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:31,869 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:27:31,870 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:27:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:31,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415735187] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:31,889 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:31,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:31,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31039929] [2021-06-05 14:27:31,889 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:31,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:31,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:31,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:31,889 INFO L87 Difference]: Start difference. First operand 994 states and 3913 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:32,250 INFO L93 Difference]: Finished difference Result 1097 states and 4258 transitions. [2021-06-05 14:27:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:32,250 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:32,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:32,252 INFO L225 Difference]: With dead ends: 1097 [2021-06-05 14:27:32,252 INFO L226 Difference]: Without dead ends: 1097 [2021-06-05 14:27:32,252 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 303.3ms TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:27:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2021-06-05 14:27:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1000. [2021-06-05 14:27:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.937937937937938) internal successors, (3934), 999 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3934 transitions. [2021-06-05 14:27:32,263 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3934 transitions. Word has length 19 [2021-06-05 14:27:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:32,263 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3934 transitions. [2021-06-05 14:27:32,263 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3934 transitions. [2021-06-05 14:27:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:32,264 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:32,264 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:32,464 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 463 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5871 [2021-06-05 14:27:32,464 INFO L430 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:32,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:32,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2072119220, now seen corresponding path program 317 times [2021-06-05 14:27:32,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:32,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962902610] [2021-06-05 14:27:32,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:32,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:32,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962902610] [2021-06-05 14:27:32,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962902610] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:32,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676805710] [2021-06-05 14:27:32,529 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 464 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 464 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:32,555 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:27:32,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:32,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:32,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:32,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:32,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 15 treesize of output 11 [2021-06-05 14:27:32,615 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:32,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 16 treesize of output 12 [2021-06-05 14:27:32,617 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:32,632 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:32,632 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:32,632 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:32,691 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:32,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:32,692 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:32,694 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:27:32,694 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:32,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 7 treesize of output 5 [2021-06-05 14:27:32,697 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:32,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 16 treesize of output 12 [2021-06-05 14:27:32,699 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:32,712 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 14:27:32,712 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:32,713 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:32,713 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 14:27:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:32,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676805710] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:32,731 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:32,731 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:32,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692652971] [2021-06-05 14:27:32,731 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:32,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:32,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:32,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:32,731 INFO L87 Difference]: Start difference. First operand 1000 states and 3934 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:33,027 INFO L93 Difference]: Finished difference Result 1087 states and 4222 transitions. [2021-06-05 14:27:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:33,028 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:33,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:33,030 INFO L225 Difference]: With dead ends: 1087 [2021-06-05 14:27:33,030 INFO L226 Difference]: Without dead ends: 1079 [2021-06-05 14:27:33,030 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 241.3ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:27:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-06-05 14:27:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1000. [2021-06-05 14:27:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.934934934934935) internal successors, (3931), 999 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3931 transitions. [2021-06-05 14:27:33,041 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3931 transitions. Word has length 19 [2021-06-05 14:27:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:33,041 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3931 transitions. [2021-06-05 14:27:33,041 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3931 transitions. [2021-06-05 14:27:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:33,042 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:33,042 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:33,242 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5874,464 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:33,243 INFO L430 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:33,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1017702920, now seen corresponding path program 318 times [2021-06-05 14:27:33,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:33,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937847762] [2021-06-05 14:27:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:33,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:33,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937847762] [2021-06-05 14:27:33,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937847762] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:33,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408178345] [2021-06-05 14:27:33,353 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 465 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 465 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:33,379 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:27:33,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:33,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:33,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:33,463 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:33,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 15 treesize of output 11 [2021-06-05 14:27:33,464 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:33,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 16 treesize of output 12 [2021-06-05 14:27:33,466 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:33,489 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:33,490 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:33,490 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:33,527 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:33,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:33,528 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:33,530 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:33,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 17 treesize of output 13 [2021-06-05 14:27:33,531 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:33,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:33,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:33,534 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:33,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 16 treesize of output 12 [2021-06-05 14:27:33,536 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:33,566 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:33,566 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:33,567 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:33,567 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:33,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408178345] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:33,615 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:33,615 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:33,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174317874] [2021-06-05 14:27:33,615 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:33,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:33,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:33,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:33,615 INFO L87 Difference]: Start difference. First operand 1000 states and 3931 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:34,074 INFO L93 Difference]: Finished difference Result 1096 states and 4256 transitions. [2021-06-05 14:27:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:34,074 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:34,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:34,076 INFO L225 Difference]: With dead ends: 1096 [2021-06-05 14:27:34,076 INFO L226 Difference]: Without dead ends: 1096 [2021-06-05 14:27:34,076 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 417.6ms TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:27:34,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2021-06-05 14:27:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1003. [2021-06-05 14:27:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 3.932135728542914) internal successors, (3940), 1002 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 3940 transitions. [2021-06-05 14:27:34,086 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 3940 transitions. Word has length 19 [2021-06-05 14:27:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:34,086 INFO L482 AbstractCegarLoop]: Abstraction has 1003 states and 3940 transitions. [2021-06-05 14:27:34,086 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 3940 transitions. [2021-06-05 14:27:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:34,087 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:34,087 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:34,288 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 465 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5881 [2021-06-05 14:27:34,288 INFO L430 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:34,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash 272750348, now seen corresponding path program 319 times [2021-06-05 14:27:34,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:34,288 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246650556] [2021-06-05 14:27:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:34,362 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:34,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246650556] [2021-06-05 14:27:34,362 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246650556] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:34,362 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288114194] [2021-06-05 14:27:34,362 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 466 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 466 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:34,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:34,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27: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 16 treesize of output 12 [2021-06-05 14:27:34,447 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:34,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 15 treesize of output 11 [2021-06-05 14:27:34,449 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:34,464 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:34,465 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:34,465 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 14:27:34,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:34,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 16 treesize of output 12 [2021-06-05 14:27:34,501 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:34,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:34,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 16 treesize of output 12 [2021-06-05 14:27:34,504 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:34,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:34,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 15 treesize of output 11 [2021-06-05 14:27:34,507 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:34,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 17 treesize of output 13 [2021-06-05 14:27:34,510 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:34,542 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 14:27:34,542 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:34,542 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:34,542 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 14:27:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:34,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288114194] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:34,586 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:34,586 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:34,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343815928] [2021-06-05 14:27:34,586 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:34,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:34,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:34,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:34,587 INFO L87 Difference]: Start difference. First operand 1003 states and 3940 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:34,863 INFO L93 Difference]: Finished difference Result 1088 states and 4234 transitions. [2021-06-05 14:27:34,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:34,863 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:34,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:34,865 INFO L225 Difference]: With dead ends: 1088 [2021-06-05 14:27:34,865 INFO L226 Difference]: Without dead ends: 1088 [2021-06-05 14:27:34,865 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 263.7ms TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:27:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-06-05 14:27:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 997. [2021-06-05 14:27:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 996 states have (on average 3.9377510040160644) internal successors, (3922), 996 states have internal predecessors, (3922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 3922 transitions. [2021-06-05 14:27:34,876 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 3922 transitions. Word has length 19 [2021-06-05 14:27:34,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:34,876 INFO L482 AbstractCegarLoop]: Abstraction has 997 states and 3922 transitions. [2021-06-05 14:27:34,876 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 3922 transitions. [2021-06-05 14:27:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:34,877 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:34,877 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:35,077 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5886,466 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:35,077 INFO L430 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:35,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:35,078 INFO L82 PathProgramCache]: Analyzing trace with hash -298454384, now seen corresponding path program 320 times [2021-06-05 14:27:35,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:35,078 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704922566] [2021-06-05 14:27:35,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:35,186 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:35,187 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704922566] [2021-06-05 14:27:35,187 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704922566] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:35,187 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919445258] [2021-06-05 14:27:35,187 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 467 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 467 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:35,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:27:35,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:35,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:35,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:35,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:35,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:27:35,298 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:35,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:35,300 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:35,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:35,315 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:35,315 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:35,353 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:35,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 17 treesize of output 13 [2021-06-05 14:27:35,354 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:35,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:35,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:35,357 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:35,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:35,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 16 treesize of output 12 [2021-06-05 14:27:35,360 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:35,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:35,362 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:35,393 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:35,393 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:35,393 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:35,394 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:35,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919445258] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:35,443 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:35,443 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:35,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381608914] [2021-06-05 14:27:35,443 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:35,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:35,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:35,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:35,443 INFO L87 Difference]: Start difference. First operand 997 states and 3922 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:35,917 INFO L93 Difference]: Finished difference Result 1119 states and 4310 transitions. [2021-06-05 14:27:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:35,917 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:35,919 INFO L225 Difference]: With dead ends: 1119 [2021-06-05 14:27:35,919 INFO L226 Difference]: Without dead ends: 1119 [2021-06-05 14:27:35,919 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 403.8ms TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:27:35,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2021-06-05 14:27:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1003. [2021-06-05 14:27:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 3.9411177644710578) internal successors, (3949), 1002 states have internal predecessors, (3949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 3949 transitions. [2021-06-05 14:27:35,930 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 3949 transitions. Word has length 19 [2021-06-05 14:27:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:35,930 INFO L482 AbstractCegarLoop]: Abstraction has 1003 states and 3949 transitions. [2021-06-05 14:27:35,930 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 3949 transitions. [2021-06-05 14:27:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:35,932 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:35,932 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:36,132 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5891,467 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:36,132 INFO L430 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:36,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:36,132 INFO L82 PathProgramCache]: Analyzing trace with hash 896581790, now seen corresponding path program 321 times [2021-06-05 14:27:36,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:36,132 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472919208] [2021-06-05 14:27:36,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:36,214 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:36,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472919208] [2021-06-05 14:27:36,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472919208] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:36,214 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105437550] [2021-06-05 14:27:36,214 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 468 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 468 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:36,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:27:36,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:36,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:36,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:36,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:36,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 18 treesize of output 14 [2021-06-05 14:27:36,302 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:36,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 17 treesize of output 13 [2021-06-05 14:27:36,304 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:36,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:36,320 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:36,320 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 14:27:36,354 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 14:27:36,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:36,356 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:36,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 15 treesize of output 11 [2021-06-05 14:27:36,359 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:36,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 17 treesize of output 13 [2021-06-05 14:27:36,362 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:36,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 16 treesize of output 12 [2021-06-05 14:27:36,364 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:36,396 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 14:27:36,396 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:36,397 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:36,397 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 14:27:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:36,452 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105437550] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:36,452 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:36,452 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:36,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707197827] [2021-06-05 14:27:36,452 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:36,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:36,452 INFO L87 Difference]: Start difference. First operand 1003 states and 3949 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:36,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:36,771 INFO L93 Difference]: Finished difference Result 1109 states and 4280 transitions. [2021-06-05 14:27:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:27:36,771 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:36,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:36,773 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 14:27:36,773 INFO L226 Difference]: Without dead ends: 1105 [2021-06-05 14:27:36,773 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 322.0ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:27:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2021-06-05 14:27:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1007. [2021-06-05 14:27:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.9403578528827037) internal successors, (3964), 1006 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3964 transitions. [2021-06-05 14:27:36,783 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3964 transitions. Word has length 19 [2021-06-05 14:27:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:36,784 INFO L482 AbstractCegarLoop]: Abstraction has 1007 states and 3964 transitions. [2021-06-05 14:27:36,784 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3964 transitions. [2021-06-05 14:27:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:36,785 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:36,785 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:36,985 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5896,468 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:36,985 INFO L430 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:36,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:36,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1969430400, now seen corresponding path program 322 times [2021-06-05 14:27:36,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:36,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213991484] [2021-06-05 14:27:36,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:37,093 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:37,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213991484] [2021-06-05 14:27:37,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213991484] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:37,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026372622] [2021-06-05 14:27:37,093 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 469 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 469 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:37,123 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:27:37,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:37,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:37,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:37,208 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:37,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:37,209 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:37,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 16 treesize of output 12 [2021-06-05 14:27:37,211 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:37,225 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:37,226 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:37,226 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:37,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:37,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 17 treesize of output 13 [2021-06-05 14:27:37,264 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:37,266 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:37,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:37,267 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:37,269 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:37,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:37,270 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:37,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:37,272 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:37,302 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:37,302 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:37,303 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:37,303 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:37,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026372622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:37,360 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:37,360 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:37,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689371353] [2021-06-05 14:27:37,360 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:37,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:37,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:37,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:37,360 INFO L87 Difference]: Start difference. First operand 1007 states and 3964 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:37,785 INFO L93 Difference]: Finished difference Result 1122 states and 4320 transitions. [2021-06-05 14:27:37,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:37,785 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:37,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:37,787 INFO L225 Difference]: With dead ends: 1122 [2021-06-05 14:27:37,787 INFO L226 Difference]: Without dead ends: 1119 [2021-06-05 14:27:37,787 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 425.0ms TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:27:37,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2021-06-05 14:27:37,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1007. [2021-06-05 14:27:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.9373757455268388) internal successors, (3961), 1006 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3961 transitions. [2021-06-05 14:27:37,798 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3961 transitions. Word has length 19 [2021-06-05 14:27:37,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:37,798 INFO L482 AbstractCegarLoop]: Abstraction has 1007 states and 3961 transitions. [2021-06-05 14:27:37,798 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:37,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3961 transitions. [2021-06-05 14:27:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:37,799 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:37,799 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:37,999 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5903,469 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:38,000 INFO L430 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:38,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1043406956, now seen corresponding path program 323 times [2021-06-05 14:27:38,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:38,000 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852759632] [2021-06-05 14:27:38,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:38,072 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:38,072 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852759632] [2021-06-05 14:27:38,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852759632] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:38,073 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670951651] [2021-06-05 14:27:38,073 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 470 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 470 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:38,099 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:27:38,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:38,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:38,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:38,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:38,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:27:38,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:38,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:38,162 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:38,177 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:38,178 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:38,178 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 14:27:38,212 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 14:27:38,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:38,215 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:38,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:38,217 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:38,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:38,220 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:38,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 16 treesize of output 12 [2021-06-05 14:27:38,223 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:38,255 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 14:27:38,255 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:38,256 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:38,256 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 14:27:38,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:38,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670951651] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:38,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:38,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:38,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330873565] [2021-06-05 14:27:38,300 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:38,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:38,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:38,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:38,300 INFO L87 Difference]: Start difference. First operand 1007 states and 3961 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:38,596 INFO L93 Difference]: Finished difference Result 1094 states and 4249 transitions. [2021-06-05 14:27:38,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:38,597 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:38,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:38,598 INFO L225 Difference]: With dead ends: 1094 [2021-06-05 14:27:38,598 INFO L226 Difference]: Without dead ends: 1094 [2021-06-05 14:27:38,598 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 257.4ms TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:27:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2021-06-05 14:27:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1000. [2021-06-05 14:27:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.937937937937938) internal successors, (3934), 999 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3934 transitions. [2021-06-05 14:27:38,609 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3934 transitions. Word has length 19 [2021-06-05 14:27:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:38,609 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3934 transitions. [2021-06-05 14:27:38,609 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3934 transitions. [2021-06-05 14:27:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:38,610 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:38,610 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:38,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5910,470 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:38,811 INFO L430 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:38,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:38,811 INFO L82 PathProgramCache]: Analyzing trace with hash 596489562, now seen corresponding path program 324 times [2021-06-05 14:27:38,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:38,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838613443] [2021-06-05 14:27:38,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:38,917 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:38,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838613443] [2021-06-05 14:27:38,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838613443] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:38,917 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3591773] [2021-06-05 14:27:38,917 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 471 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 471 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:38,943 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:27:38,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:38,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:38,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:39,026 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:39,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:39,027 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:39,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:39,029 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:39,044 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:39,044 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:39,044 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:39,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:39,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 16 treesize of output 12 [2021-06-05 14:27:39,109 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:39,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 8 treesize of output 6 [2021-06-05 14:27:39,111 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:39,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 7 treesize of output 5 [2021-06-05 14:27:39,113 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:39,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:39,116 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:39,131 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 14:27:39,131 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:39,132 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:39,132 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 14:27:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:39,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3591773] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:39,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:39,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:39,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012457159] [2021-06-05 14:27:39,153 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:39,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:39,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:39,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:39,154 INFO L87 Difference]: Start difference. First operand 1000 states and 3934 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:39,563 INFO L93 Difference]: Finished difference Result 1088 states and 4228 transitions. [2021-06-05 14:27:39,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:39,564 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:39,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:39,565 INFO L225 Difference]: With dead ends: 1088 [2021-06-05 14:27:39,565 INFO L226 Difference]: Without dead ends: 1082 [2021-06-05 14:27:39,566 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 386.9ms TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:27:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2021-06-05 14:27:39,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1000. [2021-06-05 14:27:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.934934934934935) internal successors, (3931), 999 states have internal predecessors, (3931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3931 transitions. [2021-06-05 14:27:39,576 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3931 transitions. Word has length 19 [2021-06-05 14:27:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:39,576 INFO L482 AbstractCegarLoop]: Abstraction has 1000 states and 3931 transitions. [2021-06-05 14:27:39,576 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3931 transitions. [2021-06-05 14:27:39,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:39,577 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:39,577 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:39,777 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 471 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5915 [2021-06-05 14:27:39,778 INFO L430 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:39,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:39,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1917147636, now seen corresponding path program 325 times [2021-06-05 14:27:39,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:39,778 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306371201] [2021-06-05 14:27:39,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:39,848 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:39,848 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306371201] [2021-06-05 14:27:39,848 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306371201] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:39,848 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831887557] [2021-06-05 14:27:39,848 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 472 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 472 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:39,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:39,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:39,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:39,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:27:39,934 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:39,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 17 treesize of output 13 [2021-06-05 14:27:39,936 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:39,951 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:39,952 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:39,952 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 14:27:39,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:39,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 15 treesize of output 11 [2021-06-05 14:27:39,999 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:40,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 16 treesize of output 12 [2021-06-05 14:27:40,001 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:40,016 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:27:40,016 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:40,016 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:27:40,017 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:27:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:40,035 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831887557] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:40,035 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:40,035 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:40,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195750190] [2021-06-05 14:27:40,035 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:40,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:40,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:40,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:40,035 INFO L87 Difference]: Start difference. First operand 1000 states and 3931 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:40,283 INFO L93 Difference]: Finished difference Result 1091 states and 4243 transitions. [2021-06-05 14:27:40,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:40,283 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:40,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:40,285 INFO L225 Difference]: With dead ends: 1091 [2021-06-05 14:27:40,285 INFO L226 Difference]: Without dead ends: 1091 [2021-06-05 14:27:40,285 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 210.8ms TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:27:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2021-06-05 14:27:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1003. [2021-06-05 14:27:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 3.935129740518962) internal successors, (3943), 1002 states have internal predecessors, (3943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 3943 transitions. [2021-06-05 14:27:40,295 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 3943 transitions. Word has length 19 [2021-06-05 14:27:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:40,296 INFO L482 AbstractCegarLoop]: Abstraction has 1003 states and 3943 transitions. [2021-06-05 14:27:40,296 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 3943 transitions. [2021-06-05 14:27:40,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:40,297 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:40,297 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:40,497 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5922,472 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:40,497 INFO L430 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:40,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:40,497 INFO L82 PathProgramCache]: Analyzing trace with hash -969881216, now seen corresponding path program 326 times [2021-06-05 14:27:40,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:40,498 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037289966] [2021-06-05 14:27:40,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:40,598 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:40,598 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037289966] [2021-06-05 14:27:40,598 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037289966] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:40,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722432951] [2021-06-05 14:27:40,607 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 473 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 473 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:40,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:27:40,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:40,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:40,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:40,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:40,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:27:40,735 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:40,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:40,738 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:40,756 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:40,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:40,757 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:40,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:40,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 15 treesize of output 11 [2021-06-05 14:27:40,821 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:40,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:40,823 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:40,836 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:27:40,836 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:40,837 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:27:40,837 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:27:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:40,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722432951] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:40,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:40,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:40,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067008890] [2021-06-05 14:27:40,856 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:40,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:40,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:40,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:40,856 INFO L87 Difference]: Start difference. First operand 1003 states and 3943 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:41,167 INFO L93 Difference]: Finished difference Result 1106 states and 4284 transitions. [2021-06-05 14:27:41,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:41,168 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:41,169 INFO L225 Difference]: With dead ends: 1106 [2021-06-05 14:27:41,169 INFO L226 Difference]: Without dead ends: 1106 [2021-06-05 14:27:41,170 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 298.7ms TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:27:41,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-06-05 14:27:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1012. [2021-06-05 14:27:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 14:27:41,180 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 14:27:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:41,180 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 14:27:41,180 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 14:27:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:41,182 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:41,182 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:41,382 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5925,473 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:41,382 INFO L430 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:41,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:41,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1716501810, now seen corresponding path program 327 times [2021-06-05 14:27:41,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:41,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607248631] [2021-06-05 14:27:41,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:41,448 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:41,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607248631] [2021-06-05 14:27:41,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607248631] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:41,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463309123] [2021-06-05 14:27:41,448 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 474 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 474 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:41,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:27:41,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:41,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:41,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:41,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:41,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:41,533 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:41,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 18 treesize of output 14 [2021-06-05 14:27:41,535 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:41,550 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:41,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:41,550 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 14:27:41,608 INFO L446 ElimStorePlain]: Different costs {0=[array_2], 1=[array_4]} [2021-06-05 14:27:41,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 17 treesize of output 13 [2021-06-05 14:27:41,611 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:41,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 16 treesize of output 12 [2021-06-05 14:27:41,613 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:41,615 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:27:41,615 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:41,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 7 treesize of output 5 [2021-06-05 14:27:41,618 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:41,640 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 14:27:41,641 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:41,641 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:41,641 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 14:27:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:41,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463309123] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:41,660 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:41,660 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:41,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187101179] [2021-06-05 14:27:41,660 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:41,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:41,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:41,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:41,660 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:42,000 INFO L93 Difference]: Finished difference Result 1102 states and 4266 transitions. [2021-06-05 14:27:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:42,000 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:42,002 INFO L225 Difference]: With dead ends: 1102 [2021-06-05 14:27:42,002 INFO L226 Difference]: Without dead ends: 1094 [2021-06-05 14:27:42,002 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 275.7ms TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:27:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2021-06-05 14:27:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1012. [2021-06-05 14:27:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.9268051434223543) internal successors, (3970), 1011 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3970 transitions. [2021-06-05 14:27:42,012 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3970 transitions. Word has length 19 [2021-06-05 14:27:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:42,012 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3970 transitions. [2021-06-05 14:27:42,012 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3970 transitions. [2021-06-05 14:27:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:42,013 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:42,013 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:42,214 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 474 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5928 [2021-06-05 14:27:42,214 INFO L430 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash 511356654, now seen corresponding path program 328 times [2021-06-05 14:27:42,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:42,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530831037] [2021-06-05 14:27:42,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:42,321 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:42,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530831037] [2021-06-05 14:27:42,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530831037] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:42,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348350979] [2021-06-05 14:27:42,321 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 475 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 475 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:42,347 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:27:42,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:42,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:42,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:42,429 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:42,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 15 treesize of output 11 [2021-06-05 14:27:42,430 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:42,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 16 treesize of output 12 [2021-06-05 14:27:42,432 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:42,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:42,446 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:42,446 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:42,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:42,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 15 treesize of output 11 [2021-06-05 14:27:42,484 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:42,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:42,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:42,487 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:42,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:42,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:42,490 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:42,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:42,492 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:42,522 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:42,523 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:42,523 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:42,523 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:42,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348350979] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:42,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:42,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:42,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705183262] [2021-06-05 14:27:42,572 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:42,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:42,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:42,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:42,573 INFO L87 Difference]: Start difference. First operand 1012 states and 3970 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:42,985 INFO L93 Difference]: Finished difference Result 1098 states and 4262 transitions. [2021-06-05 14:27:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:42,985 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:42,987 INFO L225 Difference]: With dead ends: 1098 [2021-06-05 14:27:42,987 INFO L226 Difference]: Without dead ends: 1098 [2021-06-05 14:27:42,987 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 359.8ms TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:27:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2021-06-05 14:27:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1015. [2021-06-05 14:27:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.924063116370809) internal successors, (3979), 1014 states have internal predecessors, (3979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3979 transitions. [2021-06-05 14:27:42,997 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3979 transitions. Word has length 19 [2021-06-05 14:27:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:42,997 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3979 transitions. [2021-06-05 14:27:42,998 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3979 transitions. [2021-06-05 14:27:42,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:42,999 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:42,999 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:43,199 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5934,475 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:43,199 INFO L430 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:43,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:43,199 INFO L82 PathProgramCache]: Analyzing trace with hash -233595918, now seen corresponding path program 329 times [2021-06-05 14:27:43,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:43,200 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127908311] [2021-06-05 14:27:43,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:43,273 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:43,273 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127908311] [2021-06-05 14:27:43,273 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127908311] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:43,273 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195288102] [2021-06-05 14:27:43,273 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 476 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 476 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:43,301 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:27:43,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:43,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:43,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:43,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:43,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:43,360 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:43,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:27:43,363 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:43,377 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:43,378 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:43,378 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 14:27:43,412 INFO L446 ElimStorePlain]: Different costs {0=[array_2], 1=[array_4]} [2021-06-05 14:27:43,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:43,415 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:43,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:43,417 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:43,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 15 treesize of output 11 [2021-06-05 14:27:43,420 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:43,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 16 treesize of output 12 [2021-06-05 14:27:43,422 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:43,453 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:43,453 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:43,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:43,454 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:43,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195288102] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:43,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:43,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:43,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110919088] [2021-06-05 14:27:43,496 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:43,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:43,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:43,497 INFO L87 Difference]: Start difference. First operand 1015 states and 3979 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:43,857 INFO L93 Difference]: Finished difference Result 1109 states and 4296 transitions. [2021-06-05 14:27:43,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:43,857 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:43,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:43,859 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 14:27:43,859 INFO L226 Difference]: Without dead ends: 1109 [2021-06-05 14:27:43,859 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 311.1ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:27:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-06-05 14:27:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1009. [2021-06-05 14:27:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 3.929563492063492) internal successors, (3961), 1008 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:43,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 3961 transitions. [2021-06-05 14:27:43,870 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 3961 transitions. Word has length 19 [2021-06-05 14:27:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:43,870 INFO L482 AbstractCegarLoop]: Abstraction has 1009 states and 3961 transitions. [2021-06-05 14:27:43,870 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 3961 transitions. [2021-06-05 14:27:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:43,871 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:43,871 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:44,071 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 476 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5939 [2021-06-05 14:27:44,072 INFO L430 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash -804800650, now seen corresponding path program 330 times [2021-06-05 14:27:44,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:44,072 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857225849] [2021-06-05 14:27:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:44,181 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:44,181 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857225849] [2021-06-05 14:27:44,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857225849] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:44,181 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606577869] [2021-06-05 14:27:44,181 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 477 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 477 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:44,208 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:27:44,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:44,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:44,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:44,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:44,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 15 treesize of output 11 [2021-06-05 14:27:44,293 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:44,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 16 treesize of output 12 [2021-06-05 14:27:44,295 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:44,309 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:44,310 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:44,310 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:44,357 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:44,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:44,358 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:44,360 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:44,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:44,361 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:44,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:44,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:44,364 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:44,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:44,367 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:44,397 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:44,397 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:44,397 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:44,397 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:44,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606577869] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:44,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:44,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:44,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082757362] [2021-06-05 14:27:44,446 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:44,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:44,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:44,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:44,446 INFO L87 Difference]: Start difference. First operand 1009 states and 3961 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:44,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:44,821 INFO L93 Difference]: Finished difference Result 1118 states and 4307 transitions. [2021-06-05 14:27:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:44,822 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:44,823 INFO L225 Difference]: With dead ends: 1118 [2021-06-05 14:27:44,823 INFO L226 Difference]: Without dead ends: 1118 [2021-06-05 14:27:44,824 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 356.4ms TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:27:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2021-06-05 14:27:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1015. [2021-06-05 14:27:44,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.932938856015779) internal successors, (3988), 1014 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:44,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3988 transitions. [2021-06-05 14:27:44,834 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3988 transitions. Word has length 19 [2021-06-05 14:27:44,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:44,834 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3988 transitions. [2021-06-05 14:27:44,834 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:44,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3988 transitions. [2021-06-05 14:27:44,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:44,836 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:44,836 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:45,036 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5944,477 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:45,036 INFO L430 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:45,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:45,036 INFO L82 PathProgramCache]: Analyzing trace with hash 390235524, now seen corresponding path program 331 times [2021-06-05 14:27:45,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:45,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415438829] [2021-06-05 14:27:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:45,109 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:45,109 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415438829] [2021-06-05 14:27:45,109 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415438829] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:45,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124560728] [2021-06-05 14:27:45,110 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 478 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 478 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:45,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:45,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:45,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 15 treesize of output 11 [2021-06-05 14:27:45,195 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:45,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:45,197 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:45,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:45,212 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:45,212 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:45,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:45,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:45,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:45,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:45,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 15 treesize of output 11 [2021-06-05 14:27:45,250 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:45,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:45,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:45,253 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:45,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:45,255 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:45,286 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:45,286 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:45,287 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:45,287 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:45,340 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124560728] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:45,340 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:45,340 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:45,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026676084] [2021-06-05 14:27:45,340 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:45,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:45,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:45,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:45,340 INFO L87 Difference]: Start difference. First operand 1015 states and 3988 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:45,695 INFO L93 Difference]: Finished difference Result 1124 states and 4324 transitions. [2021-06-05 14:27:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:27:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:45,697 INFO L225 Difference]: With dead ends: 1124 [2021-06-05 14:27:45,697 INFO L226 Difference]: Without dead ends: 1120 [2021-06-05 14:27:45,697 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 340.9ms TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:27:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2021-06-05 14:27:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1019. [2021-06-05 14:27:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.932220039292731) internal successors, (4003), 1018 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4003 transitions. [2021-06-05 14:27:45,707 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4003 transitions. Word has length 19 [2021-06-05 14:27:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:45,708 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4003 transitions. [2021-06-05 14:27:45,708 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4003 transitions. [2021-06-05 14:27:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:45,709 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:45,709 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:45,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 478 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5949 [2021-06-05 14:27:45,909 INFO L430 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:45,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:45,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1819190630, now seen corresponding path program 332 times [2021-06-05 14:27:45,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:45,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702486815] [2021-06-05 14:27:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:46,017 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:46,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702486815] [2021-06-05 14:27:46,017 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702486815] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:46,017 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419416233] [2021-06-05 14:27:46,017 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 479 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 479 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:46,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:27:46,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:46,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:46,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:46,143 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:46,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 15 treesize of output 11 [2021-06-05 14:27:46,145 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:46,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 16 treesize of output 12 [2021-06-05 14:27:46,147 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:46,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:46,163 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:46,164 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:46,210 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:46,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 17 treesize of output 13 [2021-06-05 14:27:46,212 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:46,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:46,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:46,215 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:46,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:46,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 16 treesize of output 12 [2021-06-05 14:27:46,218 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:46,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:46,221 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:46,256 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:46,257 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:46,257 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:46,257 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:46,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419416233] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:46,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:46,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:46,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497312904] [2021-06-05 14:27:46,319 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:46,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:46,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:46,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:46,320 INFO L87 Difference]: Start difference. First operand 1019 states and 4003 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:46,791 INFO L93 Difference]: Finished difference Result 1121 states and 4317 transitions. [2021-06-05 14:27:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:46,792 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:46,793 INFO L225 Difference]: With dead ends: 1121 [2021-06-05 14:27:46,793 INFO L226 Difference]: Without dead ends: 1118 [2021-06-05 14:27:46,794 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 419.6ms TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:27:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2021-06-05 14:27:46,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1019. [2021-06-05 14:27:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.9292730844793713) internal successors, (4000), 1018 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4000 transitions. [2021-06-05 14:27:46,804 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4000 transitions. Word has length 19 [2021-06-05 14:27:46,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:46,805 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4000 transitions. [2021-06-05 14:27:46,805 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4000 transitions. [2021-06-05 14:27:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:46,806 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:46,806 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:47,006 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5956,479 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:47,006 INFO L430 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1549753222, now seen corresponding path program 333 times [2021-06-05 14:27:47,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:47,007 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106273426] [2021-06-05 14:27:47,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:47,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:47,080 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:47,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106273426] [2021-06-05 14:27:47,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106273426] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:47,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249138296] [2021-06-05 14:27:47,080 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 480 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 480 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:47,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:27:47,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:47,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:47,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:47,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 15 treesize of output 11 [2021-06-05 14:27:47,175 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:47,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 16 treesize of output 12 [2021-06-05 14:27:47,177 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:47,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:47,192 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:47,192 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:47,226 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:47,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 16 treesize of output 12 [2021-06-05 14:27:47,227 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:47,230 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:47,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:27:47,230 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:47,232 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:47,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:47,233 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:47,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 17 treesize of output 13 [2021-06-05 14:27:47,236 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:47,266 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:47,266 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:47,267 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:47,267 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:47,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249138296] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:47,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:47,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:47,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956163441] [2021-06-05 14:27:47,310 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:47,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:47,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:47,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:47,310 INFO L87 Difference]: Start difference. First operand 1019 states and 4000 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:47,668 INFO L93 Difference]: Finished difference Result 1109 states and 4293 transitions. [2021-06-05 14:27:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:47,668 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:47,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:47,670 INFO L225 Difference]: With dead ends: 1109 [2021-06-05 14:27:47,670 INFO L226 Difference]: Without dead ends: 1109 [2021-06-05 14:27:47,670 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 304.1ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:27:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-06-05 14:27:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1012. [2021-06-05 14:27:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 14:27:47,681 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 14:27:47,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:47,681 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 14:27:47,681 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 14:27:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:47,682 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:47,682 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:47,882 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5963,480 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:47,882 INFO L430 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:47,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:47,883 INFO L82 PathProgramCache]: Analyzing trace with hash 90143296, now seen corresponding path program 334 times [2021-06-05 14:27:47,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:47,883 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037203295] [2021-06-05 14:27:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:47,977 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:47,977 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037203295] [2021-06-05 14:27:47,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037203295] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:47,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012696877] [2021-06-05 14:27:47,978 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 481 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 481 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:48,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:27:48,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:48,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:48,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:48,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:48,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:48,087 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:48,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:48,089 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:48,103 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:48,104 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:48,104 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:48,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:48,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 16 treesize of output 12 [2021-06-05 14:27:48,167 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:48,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 8 treesize of output 6 [2021-06-05 14:27:48,170 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:48,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:27:48,172 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:48,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 17 treesize of output 13 [2021-06-05 14:27:48,175 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:48,190 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 14:27:48,190 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:48,190 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:48,190 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 14:27:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:48,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012696877] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:48,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:48,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:48,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402864713] [2021-06-05 14:27:48,212 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:48,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:48,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:48,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:48,213 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:48,550 INFO L93 Difference]: Finished difference Result 1094 states and 4245 transitions. [2021-06-05 14:27:48,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:48,550 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:48,551 INFO L225 Difference]: With dead ends: 1094 [2021-06-05 14:27:48,552 INFO L226 Difference]: Without dead ends: 1088 [2021-06-05 14:27:48,552 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 339.3ms TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:27:48,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2021-06-05 14:27:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1012. [2021-06-05 14:27:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.9268051434223543) internal successors, (3970), 1011 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3970 transitions. [2021-06-05 14:27:48,562 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3970 transitions. Word has length 19 [2021-06-05 14:27:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:48,562 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3970 transitions. [2021-06-05 14:27:48,563 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3970 transitions. [2021-06-05 14:27:48,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:48,564 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:48,564 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:48,764 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5968,481 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:48,764 INFO L430 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1871473394, now seen corresponding path program 335 times [2021-06-05 14:27:48,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:48,765 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536469500] [2021-06-05 14:27:48,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:48,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:48,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:48,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536469500] [2021-06-05 14:27:48,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536469500] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:48,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392348571] [2021-06-05 14:27:48,834 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 482 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 482 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:48,900 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:27:48,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:48,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:48,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27: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 15 treesize of output 11 [2021-06-05 14:27:48,959 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:48,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 16 treesize of output 12 [2021-06-05 14:27:48,961 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:48,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:48,976 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:48,976 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:27:49,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:49,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:49,021 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:49,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:49,023 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:49,037 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:27:49,037 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:49,037 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:27:49,038 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:27:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:49,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392348571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:49,056 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:49,056 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:49,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659301205] [2021-06-05 14:27:49,056 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:49,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:49,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:49,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:49,056 INFO L87 Difference]: Start difference. First operand 1012 states and 3970 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:49,269 INFO L93 Difference]: Finished difference Result 1100 states and 4269 transitions. [2021-06-05 14:27:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:49,269 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:49,270 INFO L225 Difference]: With dead ends: 1100 [2021-06-05 14:27:49,270 INFO L226 Difference]: Without dead ends: 1100 [2021-06-05 14:27:49,270 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 197.5ms TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:27:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2021-06-05 14:27:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 1006. [2021-06-05 14:27:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 1005 states have (on average 3.9323383084577115) internal successors, (3952), 1005 states have internal predecessors, (3952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 3952 transitions. [2021-06-05 14:27:49,281 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 3952 transitions. Word has length 19 [2021-06-05 14:27:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:49,281 INFO L482 AbstractCegarLoop]: Abstraction has 1006 states and 3952 transitions. [2021-06-05 14:27:49,281 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 3952 transitions. [2021-06-05 14:27:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:49,282 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:49,282 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:49,482 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5975,482 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:49,482 INFO L430 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:49,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:49,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1340030452, now seen corresponding path program 336 times [2021-06-05 14:27:49,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:49,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50689209] [2021-06-05 14:27:49,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:49,595 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:49,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50689209] [2021-06-05 14:27:49,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50689209] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:49,595 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137968364] [2021-06-05 14:27:49,595 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 483 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 483 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:49,622 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:27:49,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:49,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:49,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:49,687 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:49,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:49,688 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:49,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 16 treesize of output 12 [2021-06-05 14:27:49,690 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:49,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:49,702 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:49,702 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:49,761 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:49,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 17 treesize of output 13 [2021-06-05 14:27:49,763 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:49,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:49,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:49,765 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:49,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:49,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 16 treesize of output 12 [2021-06-05 14:27:49,768 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:49,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:49,771 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:49,800 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:49,801 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:49,801 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:49,801 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:49,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137968364] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:49,864 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:49,864 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:49,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541213555] [2021-06-05 14:27:49,864 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:49,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:49,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:49,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:49,864 INFO L87 Difference]: Start difference. First operand 1006 states and 3952 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:50,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:50,474 INFO L93 Difference]: Finished difference Result 1214 states and 4633 transitions. [2021-06-05 14:27:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:27:50,475 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:50,476 INFO L225 Difference]: With dead ends: 1214 [2021-06-05 14:27:50,476 INFO L226 Difference]: Without dead ends: 1214 [2021-06-05 14:27:50,477 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 533.2ms TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:27:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-06-05 14:27:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1015. [2021-06-05 14:27:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.9358974358974357) internal successors, (3991), 1014 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3991 transitions. [2021-06-05 14:27:50,488 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3991 transitions. Word has length 19 [2021-06-05 14:27:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:50,488 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3991 transitions. [2021-06-05 14:27:50,488 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3991 transitions. [2021-06-05 14:27:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:50,490 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:50,490 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:50,690 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5978,483 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:50,690 INFO L430 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:50,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:50,690 INFO L82 PathProgramCache]: Analyzing trace with hash -144994278, now seen corresponding path program 337 times [2021-06-05 14:27:50,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:50,690 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330837606] [2021-06-05 14:27:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:50,762 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:50,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330837606] [2021-06-05 14:27:50,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330837606] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:50,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416744976] [2021-06-05 14:27:50,762 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 484 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 484 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:50,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:50,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:50,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27: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 16 treesize of output 12 [2021-06-05 14:27:50,834 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:50,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:27:50,836 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:50,847 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:50,848 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:50,848 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:50,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:50,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:50,903 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:50,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:50,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 16 treesize of output 12 [2021-06-05 14:27:50,906 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:50,908 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:50,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:50,908 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:50,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 17 treesize of output 13 [2021-06-05 14:27:50,911 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:50,942 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:50,942 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:50,942 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:50,942 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:50,995 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416744976] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:50,996 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:50,996 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:50,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976980792] [2021-06-05 14:27:50,996 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:50,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:50,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:50,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:50,996 INFO L87 Difference]: Start difference. First operand 1015 states and 3991 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:51,498 INFO L93 Difference]: Finished difference Result 1219 states and 4648 transitions. [2021-06-05 14:27:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 14:27:51,498 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:51,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:51,500 INFO L225 Difference]: With dead ends: 1219 [2021-06-05 14:27:51,500 INFO L226 Difference]: Without dead ends: 1215 [2021-06-05 14:27:51,500 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 441.2ms TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:27:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2021-06-05 14:27:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1019. [2021-06-05 14:27:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.9351669941060905) internal successors, (4006), 1018 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4006 transitions. [2021-06-05 14:27:51,511 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4006 transitions. Word has length 19 [2021-06-05 14:27:51,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:51,511 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4006 transitions. [2021-06-05 14:27:51,511 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 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:27:51,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4006 transitions. [2021-06-05 14:27:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:51,512 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:51,512 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:51,713 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5983,484 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:51,713 INFO L430 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:51,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:51,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1283960828, now seen corresponding path program 338 times [2021-06-05 14:27:51,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:51,713 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99285132] [2021-06-05 14:27:51,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:51,824 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:51,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99285132] [2021-06-05 14:27:51,824 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99285132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:51,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546820368] [2021-06-05 14:27:51,824 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 485 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 485 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:51,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:27:51,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:51,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:51,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:51,919 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:51,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 15 treesize of output 11 [2021-06-05 14:27:51,920 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:51,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 16 treesize of output 12 [2021-06-05 14:27:51,922 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:51,934 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:51,934 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:51,934 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:51,993 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:51,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 17 treesize of output 13 [2021-06-05 14:27:51,994 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:51,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:51,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 16 treesize of output 12 [2021-06-05 14:27:51,997 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:51,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:51,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 16 treesize of output 12 [2021-06-05 14:27:52,000 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:52,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 15 treesize of output 11 [2021-06-05 14:27:52,002 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:52,032 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:52,032 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:52,033 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:52,033 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:52,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546820368] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:52,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:52,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:52,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66416503] [2021-06-05 14:27:52,090 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:52,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:52,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:52,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:52,090 INFO L87 Difference]: Start difference. First operand 1019 states and 4006 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:52,753 INFO L93 Difference]: Finished difference Result 1217 states and 4643 transitions. [2021-06-05 14:27:52,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:27:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:52,755 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 14:27:52,755 INFO L226 Difference]: Without dead ends: 1214 [2021-06-05 14:27:52,755 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 560.3ms TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:27:52,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2021-06-05 14:27:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1019. [2021-06-05 14:27:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.932220039292731) internal successors, (4003), 1018 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4003 transitions. [2021-06-05 14:27:52,766 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4003 transitions. Word has length 19 [2021-06-05 14:27:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:52,766 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4003 transitions. [2021-06-05 14:27:52,766 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4003 transitions. [2021-06-05 14:27:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:52,767 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:52,767 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:52,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5990,485 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:52,968 INFO L430 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:52,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2084983024, now seen corresponding path program 339 times [2021-06-05 14:27:52,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:52,968 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416146646] [2021-06-05 14:27:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:53,042 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:53,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416146646] [2021-06-05 14:27:53,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416146646] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:53,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126646311] [2021-06-05 14:27:53,042 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 486 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 486 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:53,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:27:53,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:53,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:53,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:53,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:53,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:53,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:53,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:53,118 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:53,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:53,130 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:53,130 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:53,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:53,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:53,186 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:53,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:53,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 16 treesize of output 12 [2021-06-05 14:27:53,188 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:53,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:53,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 16 treesize of output 12 [2021-06-05 14:27:53,191 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:53,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 17 treesize of output 13 [2021-06-05 14:27:53,194 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:53,225 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:27:53,225 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:53,226 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:53,226 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:27:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:53,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126646311] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:53,269 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:53,269 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:53,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075344108] [2021-06-05 14:27:53,269 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:53,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:53,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:53,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:53,269 INFO L87 Difference]: Start difference. First operand 1019 states and 4003 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:53,754 INFO L93 Difference]: Finished difference Result 1204 states and 4617 transitions. [2021-06-05 14:27:53,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:27:53,755 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:53,756 INFO L225 Difference]: With dead ends: 1204 [2021-06-05 14:27:53,756 INFO L226 Difference]: Without dead ends: 1204 [2021-06-05 14:27:53,756 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 402.5ms TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:27:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2021-06-05 14:27:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1012. [2021-06-05 14:27:53,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.9327398615232445) internal successors, (3976), 1011 states have internal predecessors, (3976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3976 transitions. [2021-06-05 14:27:53,767 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3976 transitions. Word has length 19 [2021-06-05 14:27:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:53,767 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3976 transitions. [2021-06-05 14:27:53,767 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3976 transitions. [2021-06-05 14:27:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:53,769 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:53,769 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:53,969 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5997,486 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:53,969 INFO L430 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash -445086506, now seen corresponding path program 340 times [2021-06-05 14:27:53,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:53,970 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642128206] [2021-06-05 14:27:53,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:54,069 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:54,069 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642128206] [2021-06-05 14:27:54,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642128206] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:54,070 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305798272] [2021-06-05 14:27:54,070 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 487 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 487 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:54,096 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:27:54,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:54,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:54,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:54,161 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:54,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 15 treesize of output 11 [2021-06-05 14:27:54,162 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:54,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 16 treesize of output 12 [2021-06-05 14:27:54,165 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:54,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:54,177 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:54,177 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:54,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:54,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:54,253 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:54,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:27:54,255 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:54,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 8 treesize of output 6 [2021-06-05 14:27:54,257 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:54,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:54,260 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:54,275 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 14:27:54,275 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:54,276 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:54,276 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 14:27:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:54,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305798272] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:54,298 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:54,298 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:54,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879234282] [2021-06-05 14:27:54,298 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:54,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:54,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:54,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:54,298 INFO L87 Difference]: Start difference. First operand 1012 states and 3976 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:54,812 INFO L93 Difference]: Finished difference Result 1193 states and 4577 transitions. [2021-06-05 14:27:54,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:27:54,813 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:54,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:54,814 INFO L225 Difference]: With dead ends: 1193 [2021-06-05 14:27:54,814 INFO L226 Difference]: Without dead ends: 1187 [2021-06-05 14:27:54,815 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 437.8ms TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:27:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2021-06-05 14:27:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1012. [2021-06-05 14:27:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 14:27:54,826 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 14:27:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:54,826 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 14:27:54,826 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 14:27:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:54,827 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:54,827 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:55,027 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6002,487 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:55,028 INFO L430 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:55,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:55,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1336243592, now seen corresponding path program 341 times [2021-06-05 14:27:55,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:55,028 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818477211] [2021-06-05 14:27:55,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:55,100 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:55,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:55,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818477211] [2021-06-05 14:27:55,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818477211] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:55,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571058532] [2021-06-05 14:27:55,100 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 488 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 488 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:55,128 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:27:55,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:55,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 14:27:55,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:55,184 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:55,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 16 treesize of output 12 [2021-06-05 14:27:55,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:55,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 15 treesize of output 11 [2021-06-05 14:27:55,187 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:55,199 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:55,199 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:55,199 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:55,264 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:55,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:55,266 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:55,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 16 treesize of output 12 [2021-06-05 14:27:55,268 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:55,281 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:27:55,282 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:55,282 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:27:55,282 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:27:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:55,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571058532] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:55,300 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:55,300 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 14:27:55,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020749656] [2021-06-05 14:27:55,300 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 14:27:55,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:55,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 14:27:55,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 14:27:55,301 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:55,625 INFO L93 Difference]: Finished difference Result 1186 states and 4563 transitions. [2021-06-05 14:27:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:55,625 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:55,627 INFO L225 Difference]: With dead ends: 1186 [2021-06-05 14:27:55,627 INFO L226 Difference]: Without dead ends: 1186 [2021-06-05 14:27:55,627 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 234.2ms TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2021-06-05 14:27:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1009. [2021-06-05 14:27:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 3.9325396825396823) internal successors, (3964), 1008 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 3964 transitions. [2021-06-05 14:27:55,638 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 3964 transitions. Word has length 19 [2021-06-05 14:27:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:55,638 INFO L482 AbstractCegarLoop]: Abstraction has 1009 states and 3964 transitions. [2021-06-05 14:27:55,638 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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:27:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 3964 transitions. [2021-06-05 14:27:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:55,639 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:55,639 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:55,839 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6008,488 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:55,840 INFO L430 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:55,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1761243810, now seen corresponding path program 342 times [2021-06-05 14:27:55,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:55,840 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077674558] [2021-06-05 14:27:55,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:55,932 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:55,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077674558] [2021-06-05 14:27:55,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077674558] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:55,932 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440860320] [2021-06-05 14:27:55,932 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 489 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 489 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:55,958 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:27:55,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:55,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:55,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:56,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:56,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:56,024 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:56,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:56,026 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:56,037 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:56,038 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:56,038 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:56,098 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:56,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:56,099 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:56,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 7 treesize of output 5 [2021-06-05 14:27:56,102 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:56,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 8 treesize of output 6 [2021-06-05 14:27:56,104 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:56,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 17 treesize of output 13 [2021-06-05 14:27:56,107 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:56,122 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 14:27:56,122 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:56,122 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:56,122 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 14:27:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:56,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440860320] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:56,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:56,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:56,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26378774] [2021-06-05 14:27:56,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:56,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:56,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:56,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:56,143 INFO L87 Difference]: Start difference. First operand 1009 states and 3964 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:56,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:56,560 INFO L93 Difference]: Finished difference Result 1174 states and 4521 transitions. [2021-06-05 14:27:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:56,560 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:56,562 INFO L225 Difference]: With dead ends: 1174 [2021-06-05 14:27:56,562 INFO L226 Difference]: Without dead ends: 1165 [2021-06-05 14:27:56,562 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 407.1ms TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:27:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-06-05 14:27:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1009. [2021-06-05 14:27:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 1008 states have (on average 3.929563492063492) internal successors, (3961), 1008 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 3961 transitions. [2021-06-05 14:27:56,573 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 3961 transitions. Word has length 19 [2021-06-05 14:27:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:56,573 INFO L482 AbstractCegarLoop]: Abstraction has 1009 states and 3961 transitions. [2021-06-05 14:27:56,573 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 3961 transitions. [2021-06-05 14:27:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:56,574 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:56,574 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:56,775 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6011,489 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:56,775 INFO L430 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:56,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash 764788786, now seen corresponding path program 343 times [2021-06-05 14:27:56,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:56,775 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48977142] [2021-06-05 14:27:56,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:56,839 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:56,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48977142] [2021-06-05 14:27:56,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48977142] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:56,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385295188] [2021-06-05 14:27:56,839 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 490 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 490 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:56,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:56,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:56,910 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:56,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 16 treesize of output 12 [2021-06-05 14:27:56,911 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:56,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:56,913 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:56,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:56,925 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:56,925 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:56,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:56,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:27:56,972 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:56,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:56,974 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:56,988 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:27:56,988 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:56,989 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:27:56,989 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:27:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:57,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385295188] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:57,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:57,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2021-06-05 14:27:57,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855528525] [2021-06-05 14:27:57,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 14:27:57,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:57,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 14:27:57,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 14:27:57,007 INFO L87 Difference]: Start difference. First operand 1009 states and 3961 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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:27:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:57,277 INFO L93 Difference]: Finished difference Result 1241 states and 4758 transitions. [2021-06-05 14:27:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:57,278 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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:27:57,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:57,279 INFO L225 Difference]: With dead ends: 1241 [2021-06-05 14:27:57,279 INFO L226 Difference]: Without dead ends: 1241 [2021-06-05 14:27:57,279 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 192.5ms TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:27:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2021-06-05 14:27:57,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1012. [2021-06-05 14:27:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 14:27:57,291 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 14:27:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:57,291 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 14:27:57,291 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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:27:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 14:27:57,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:57,293 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:57,293 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:57,493 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6017,490 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:57,493 INFO L430 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:57,493 INFO L82 PathProgramCache]: Analyzing trace with hash -136082742, now seen corresponding path program 344 times [2021-06-05 14:27:57,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:57,494 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827530556] [2021-06-05 14:27:57,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:57,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:57,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827530556] [2021-06-05 14:27:57,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827530556] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:57,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3135847] [2021-06-05 14:27:57,607 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 491 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 491 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:57,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:27:57,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:57,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:57,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:57,706 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:57,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 16 treesize of output 12 [2021-06-05 14:27:57,707 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:57,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:57,709 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:57,720 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:57,721 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:57,721 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:57,785 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:57,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:57,786 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:57,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 16 treesize of output 12 [2021-06-05 14:27:57,788 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:57,802 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:27:57,802 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:57,802 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:27:57,802 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:27:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:57,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3135847] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:57,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:57,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:57,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787071662] [2021-06-05 14:27:57,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:57,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:57,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:57,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:57,822 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:58,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:58,206 INFO L93 Difference]: Finished difference Result 1290 states and 4947 transitions. [2021-06-05 14:27:58,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:58,206 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:58,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:58,208 INFO L225 Difference]: With dead ends: 1290 [2021-06-05 14:27:58,208 INFO L226 Difference]: Without dead ends: 1290 [2021-06-05 14:27:58,208 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 322.1ms TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 14:27:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2021-06-05 14:27:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1017. [2021-06-05 14:27:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1016 states have (on average 3.925196850393701) internal successors, (3988), 1016 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 3988 transitions. [2021-06-05 14:27:58,220 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 3988 transitions. Word has length 19 [2021-06-05 14:27:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:58,220 INFO L482 AbstractCegarLoop]: Abstraction has 1017 states and 3988 transitions. [2021-06-05 14:27:58,220 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 3988 transitions. [2021-06-05 14:27:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:58,221 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:58,221 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:58,422 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6020,491 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:58,422 INFO L430 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:58,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash -2085149096, now seen corresponding path program 345 times [2021-06-05 14:27:58,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:58,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648161153] [2021-06-05 14:27:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:58,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:58,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648161153] [2021-06-05 14:27:58,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648161153] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:58,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900819654] [2021-06-05 14:27:58,538 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 492 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 492 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:58,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:27:58,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:58,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:58,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:58,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:58,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 16 treesize of output 12 [2021-06-05 14:27:58,639 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:58,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:27:58,641 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:58,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:58,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:58,654 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:27:58,730 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:58,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:27:58,731 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:58,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 16 treesize of output 12 [2021-06-05 14:27:58,733 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:58,746 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:27:58,746 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:58,747 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:27:58,747 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:27:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:58,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900819654] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:58,766 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:58,766 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:27:58,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053939913] [2021-06-05 14:27:58,766 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:27:58,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:58,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:27:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:27:58,767 INFO L87 Difference]: Start difference. First operand 1017 states and 3988 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:59,088 INFO L93 Difference]: Finished difference Result 1213 states and 4672 transitions. [2021-06-05 14:27:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:59,088 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:27:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:59,090 INFO L225 Difference]: With dead ends: 1213 [2021-06-05 14:27:59,090 INFO L226 Difference]: Without dead ends: 1213 [2021-06-05 14:27:59,090 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 304.2ms TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:27:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2021-06-05 14:27:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1020. [2021-06-05 14:27:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.9254170755642788) internal successors, (4000), 1019 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 4000 transitions. [2021-06-05 14:27:59,101 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 4000 transitions. Word has length 19 [2021-06-05 14:27:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:59,101 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 4000 transitions. [2021-06-05 14:27:59,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 4000 transitions. [2021-06-05 14:27:59,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:59,103 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:59,103 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:27:59,303 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 492 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6023 [2021-06-05 14:27:59,303 INFO L430 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:27:59,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:27:59,303 INFO L82 PathProgramCache]: Analyzing trace with hash 601233930, now seen corresponding path program 346 times [2021-06-05 14:27:59,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:27:59,303 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376476719] [2021-06-05 14:27:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:27:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:27:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:59,399 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:27:59,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376476719] [2021-06-05 14:27:59,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376476719] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:59,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746377566] [2021-06-05 14:27:59,399 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 493 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 493 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:27:59,425 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:27:59,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:27:59,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:27:59,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:27:59,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 15 treesize of output 11 [2021-06-05 14:27:59,487 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:59,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 16 treesize of output 12 [2021-06-05 14:27:59,490 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:59,501 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:27:59,502 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:59,502 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 14:27:59,581 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:27:59,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:27:59,582 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:59,584 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:27:59,584 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:59,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:27:59,587 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:59,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:27:59,589 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:27:59,602 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 14:27:59,602 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:27:59,603 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:27:59,603 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 14:27:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:27:59,623 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746377566] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:27:59,623 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:27:59,623 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:27:59,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001517603] [2021-06-05 14:27:59,623 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:27:59,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:27:59,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:27:59,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:27:59,623 INFO L87 Difference]: Start difference. First operand 1020 states and 4000 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:27:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:27:59,870 INFO L93 Difference]: Finished difference Result 1203 states and 4636 transitions. [2021-06-05 14:27:59,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:27:59,871 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:27:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:27:59,872 INFO L225 Difference]: With dead ends: 1203 [2021-06-05 14:27:59,872 INFO L226 Difference]: Without dead ends: 1195 [2021-06-05 14:27:59,872 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 244.4ms TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:27:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2021-06-05 14:27:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1020. [2021-06-05 14:27:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.9224730127576053) internal successors, (3997), 1019 states have internal predecessors, (3997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:27:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 3997 transitions. [2021-06-05 14:27:59,884 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 3997 transitions. Word has length 19 [2021-06-05 14:27:59,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:27:59,884 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 3997 transitions. [2021-06-05 14:27:59,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:27:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 3997 transitions. [2021-06-05 14:27:59,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:27:59,885 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:27:59,885 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:00,085 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 493 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6026 [2021-06-05 14:28:00,086 INFO L430 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash -603911226, now seen corresponding path program 347 times [2021-06-05 14:28:00,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:00,086 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787893129] [2021-06-05 14:28:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:00,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:00,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787893129] [2021-06-05 14:28:00,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787893129] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:00,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059085435] [2021-06-05 14:28:00,207 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 494 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 494 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:00,234 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:00,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:00,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:00,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:00,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:00,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:00,308 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:00,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 15 treesize of output 11 [2021-06-05 14:28:00,310 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:00,321 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:00,322 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:00,322 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:28:00,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:00,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:28:00,383 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:00,385 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:00,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:00,386 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:00,388 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:00,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:00,397 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:00,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 16 treesize of output 12 [2021-06-05 14:28:00,400 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:00,430 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:28:00,431 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:00,431 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:00,431 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:28:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:00,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059085435] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:00,480 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:00,480 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:00,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665892274] [2021-06-05 14:28:00,480 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:00,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:00,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:00,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:00,480 INFO L87 Difference]: Start difference. First operand 1020 states and 3997 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:01,124 INFO L93 Difference]: Finished difference Result 1246 states and 4755 transitions. [2021-06-05 14:28:01,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:28:01,124 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:01,126 INFO L225 Difference]: With dead ends: 1246 [2021-06-05 14:28:01,126 INFO L226 Difference]: Without dead ends: 1246 [2021-06-05 14:28:01,126 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 524.1ms TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:28:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2021-06-05 14:28:01,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1023. [2021-06-05 14:28:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.9256360078277885) internal successors, (4012), 1022 states have internal predecessors, (4012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:01,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 4012 transitions. [2021-06-05 14:28:01,137 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 4012 transitions. Word has length 19 [2021-06-05 14:28:01,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:01,137 INFO L482 AbstractCegarLoop]: Abstraction has 1023 states and 4012 transitions. [2021-06-05 14:28:01,137 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 4012 transitions. [2021-06-05 14:28:01,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:01,139 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:01,139 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:01,339 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 494 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6032 [2021-06-05 14:28:01,339 INFO L430 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:01,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash 591124948, now seen corresponding path program 348 times [2021-06-05 14:28:01,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:01,339 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026746948] [2021-06-05 14:28:01,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:01,435 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:01,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026746948] [2021-06-05 14:28:01,435 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026746948] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:01,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686306975] [2021-06-05 14:28:01,435 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 495 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 495 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:01,461 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:28:01,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:01,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:01,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:01,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 15 treesize of output 11 [2021-06-05 14:28:01,525 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:01,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 16 treesize of output 12 [2021-06-05 14:28:01,527 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:01,540 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:01,540 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:01,541 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:37 [2021-06-05 14:28:01,600 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:01,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 16 treesize of output 12 [2021-06-05 14:28:01,601 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:01,603 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:01,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:01,604 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:01,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:01,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:01,607 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:01,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 17 treesize of output 13 [2021-06-05 14:28:01,609 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:01,641 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 14:28:01,641 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:01,641 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:01,642 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 14:28:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:01,698 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686306975] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:01,698 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:01,698 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:28:01,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429541233] [2021-06-05 14:28:01,698 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:28:01,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:28:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:28:01,698 INFO L87 Difference]: Start difference. First operand 1023 states and 4012 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:02,123 INFO L93 Difference]: Finished difference Result 1222 states and 4685 transitions. [2021-06-05 14:28:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:28:02,123 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:02,125 INFO L225 Difference]: With dead ends: 1222 [2021-06-05 14:28:02,125 INFO L226 Difference]: Without dead ends: 1218 [2021-06-05 14:28:02,125 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 430.8ms TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:28:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2021-06-05 14:28:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1027. [2021-06-05 14:28:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.9249512670565303) internal successors, (4027), 1026 states have internal predecessors, (4027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4027 transitions. [2021-06-05 14:28:02,136 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4027 transitions. Word has length 19 [2021-06-05 14:28:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:02,136 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4027 transitions. [2021-06-05 14:28:02,136 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4027 transitions. [2021-06-05 14:28:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:02,138 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:02,138 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:02,338 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 495 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6037 [2021-06-05 14:28:02,338 INFO L430 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:02,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:02,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2020080054, now seen corresponding path program 349 times [2021-06-05 14:28:02,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:02,338 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120054827] [2021-06-05 14:28:02,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:02,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:02,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120054827] [2021-06-05 14:28:02,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120054827] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:02,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967805638] [2021-06-05 14:28:02,460 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 496 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 496 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:02,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:02,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:02,557 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:02,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:02,558 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:02,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 15 treesize of output 11 [2021-06-05 14:28:02,560 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:02,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:02,572 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:02,572 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:28:02,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:02,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 15 treesize of output 11 [2021-06-05 14:28:02,633 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:02,635 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:02,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:02,636 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:02,638 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:02,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 16 treesize of output 12 [2021-06-05 14:28:02,638 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:02,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:02,641 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:02,671 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:28:02,671 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:02,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:02,671 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:28:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:02,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967805638] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:02,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:02,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:02,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47392378] [2021-06-05 14:28:02,726 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:02,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:02,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:02,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:02,726 INFO L87 Difference]: Start difference. First operand 1027 states and 4027 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:03,255 INFO L93 Difference]: Finished difference Result 1229 states and 4723 transitions. [2021-06-05 14:28:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 14:28:03,256 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:03,258 INFO L225 Difference]: With dead ends: 1229 [2021-06-05 14:28:03,258 INFO L226 Difference]: Without dead ends: 1226 [2021-06-05 14:28:03,258 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 527.9ms TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:28:03,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2021-06-05 14:28:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1027. [2021-06-05 14:28:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.922027290448343) internal successors, (4024), 1026 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4024 transitions. [2021-06-05 14:28:03,269 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4024 transitions. Word has length 19 [2021-06-05 14:28:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:03,269 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4024 transitions. [2021-06-05 14:28:03,269 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4024 transitions. [2021-06-05 14:28:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:03,270 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:03,271 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:03,471 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6044,496 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:03,471 INFO L430 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:03,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1348863798, now seen corresponding path program 350 times [2021-06-05 14:28:03,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:03,471 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084376465] [2021-06-05 14:28:03,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:03,588 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:03,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084376465] [2021-06-05 14:28:03,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084376465] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:03,588 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991149596] [2021-06-05 14:28:03,588 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 497 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 497 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:03,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:03,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:03,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:03,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:03,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:03,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:03,712 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:03,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:03,715 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:03,731 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:03,732 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:03,732 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:33 [2021-06-05 14:28:03,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:03,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 17 treesize of output 13 [2021-06-05 14:28:03,801 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:03,804 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:03,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:28:03,805 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:03,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:03,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:03,808 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:03,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 16 treesize of output 12 [2021-06-05 14:28:03,810 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:03,841 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:28:03,841 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:03,841 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:03,841 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:28:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:03,885 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991149596] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:03,885 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:03,885 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:28:03,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734305672] [2021-06-05 14:28:03,886 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:28:03,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:03,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:28:03,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:28:03,886 INFO L87 Difference]: Start difference. First operand 1027 states and 4024 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:04,130 INFO L93 Difference]: Finished difference Result 1204 states and 4648 transitions. [2021-06-05 14:28:04,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:04,130 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:04,132 INFO L225 Difference]: With dead ends: 1204 [2021-06-05 14:28:04,132 INFO L226 Difference]: Without dead ends: 1204 [2021-06-05 14:28:04,132 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 331.4ms TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:28:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2021-06-05 14:28:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1012. [2021-06-05 14:28:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 3.929772502472799) internal successors, (3973), 1011 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:04,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 3973 transitions. [2021-06-05 14:28:04,144 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 3973 transitions. Word has length 19 [2021-06-05 14:28:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:04,144 INFO L482 AbstractCegarLoop]: Abstraction has 1012 states and 3973 transitions. [2021-06-05 14:28:04,144 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 3973 transitions. [2021-06-05 14:28:04,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:04,145 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:04,145 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:04,345 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 497 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6051 [2021-06-05 14:28:04,346 INFO L430 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:04,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:04,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1136732820, now seen corresponding path program 351 times [2021-06-05 14:28:04,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:04,346 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966051761] [2021-06-05 14:28:04,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:04,459 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:04,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966051761] [2021-06-05 14:28:04,459 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966051761] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:04,459 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779157062] [2021-06-05 14:28:04,459 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 498 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 498 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:04,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:28:04,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:04,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:04,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:04,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28: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 15 treesize of output 11 [2021-06-05 14:28:04,577 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:04,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:04,579 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:04,593 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:04,594 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:04,594 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:28:04,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:04,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:28:04,660 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:04,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 16 treesize of output 12 [2021-06-05 14:28:04,662 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:04,676 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:28:04,676 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:04,676 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:28:04,676 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:28:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:04,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779157062] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:04,695 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:04,695 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:04,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554693253] [2021-06-05 14:28:04,695 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:04,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:04,696 INFO L87 Difference]: Start difference. First operand 1012 states and 3973 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:05,054 INFO L93 Difference]: Finished difference Result 1117 states and 4331 transitions. [2021-06-05 14:28:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:05,054 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:05,056 INFO L225 Difference]: With dead ends: 1117 [2021-06-05 14:28:05,056 INFO L226 Difference]: Without dead ends: 1117 [2021-06-05 14:28:05,056 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 294.3ms TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-06-05 14:28:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2021-06-05 14:28:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1018. [2021-06-05 14:28:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.927236971484759) internal successors, (3994), 1017 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3994 transitions. [2021-06-05 14:28:05,067 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3994 transitions. Word has length 19 [2021-06-05 14:28:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:05,067 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3994 transitions. [2021-06-05 14:28:05,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3994 transitions. [2021-06-05 14:28:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:05,068 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:05,068 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:05,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 498 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6056 [2021-06-05 14:28:05,269 INFO L430 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:05,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:05,269 INFO L82 PathProgramCache]: Analyzing trace with hash -471851450, now seen corresponding path program 352 times [2021-06-05 14:28:05,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:05,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304358813] [2021-06-05 14:28:05,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:05,351 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:05,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304358813] [2021-06-05 14:28:05,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304358813] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:05,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599286622] [2021-06-05 14:28:05,351 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 499 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 499 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:05,377 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:28:05,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:05,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:05,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:05,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:05,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:28:05,455 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:05,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 16 treesize of output 12 [2021-06-05 14:28:05,457 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:05,471 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:05,472 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:05,472 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:28:05,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:05,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 17 treesize of output 13 [2021-06-05 14:28:05,535 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:05,536 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 14:28:05,536 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:05,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 7 treesize of output 5 [2021-06-05 14:28:05,539 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:05,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:05,541 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:05,554 INFO L628 ElimStorePlain]: treesize reduction 16, result has 44.8 percent of original size [2021-06-05 14:28:05,554 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:05,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:05,555 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 14:28:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:05,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599286622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:05,574 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:05,574 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:28:05,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307805206] [2021-06-05 14:28:05,574 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:28:05,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:28:05,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:28:05,575 INFO L87 Difference]: Start difference. First operand 1018 states and 3994 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:05,837 INFO L93 Difference]: Finished difference Result 1107 states and 4295 transitions. [2021-06-05 14:28:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:05,837 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:05,839 INFO L225 Difference]: With dead ends: 1107 [2021-06-05 14:28:05,839 INFO L226 Difference]: Without dead ends: 1099 [2021-06-05 14:28:05,839 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 231.9ms TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2021-06-05 14:28:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1018. [2021-06-05 14:28:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.9242871189773845) internal successors, (3991), 1017 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3991 transitions. [2021-06-05 14:28:05,850 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3991 transitions. Word has length 19 [2021-06-05 14:28:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:05,850 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3991 transitions. [2021-06-05 14:28:05,850 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3991 transitions. [2021-06-05 14:28:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:05,851 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:05,851 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:06,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 499 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6059 [2021-06-05 14:28:06,052 INFO L430 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:06,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:06,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1676996606, now seen corresponding path program 353 times [2021-06-05 14:28:06,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:06,052 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577285299] [2021-06-05 14:28:06,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:06,184 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:06,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577285299] [2021-06-05 14:28:06,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577285299] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:06,184 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332762675] [2021-06-05 14:28:06,184 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 500 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 500 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:06,211 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:06,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:06,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:06,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:06,301 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:06,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:06,302 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:06,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 16 treesize of output 12 [2021-06-05 14:28:06,305 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:06,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:06,319 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:06,319 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:28:06,356 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:06,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:06,357 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:06,359 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:06,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 17 treesize of output 13 [2021-06-05 14:28:06,360 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:06,362 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:06,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:06,363 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:06,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:06,365 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:06,395 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:28:06,396 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:06,396 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:06,396 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:28:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:06,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332762675] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:06,445 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:06,445 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:06,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172894443] [2021-06-05 14:28:06,446 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:06,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:06,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:06,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:06,446 INFO L87 Difference]: Start difference. First operand 1018 states and 3991 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:06,937 INFO L93 Difference]: Finished difference Result 1133 states and 4365 transitions. [2021-06-05 14:28:06,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:28:06,938 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:06,939 INFO L225 Difference]: With dead ends: 1133 [2021-06-05 14:28:06,939 INFO L226 Difference]: Without dead ends: 1133 [2021-06-05 14:28:06,939 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 441.0ms TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:28:06,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-06-05 14:28:06,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1021. [2021-06-05 14:28:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.9274509803921567) internal successors, (4006), 1020 states have internal predecessors, (4006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 4006 transitions. [2021-06-05 14:28:06,950 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 4006 transitions. Word has length 19 [2021-06-05 14:28:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:06,951 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 4006 transitions. [2021-06-05 14:28:06,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:06,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 4006 transitions. [2021-06-05 14:28:06,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:06,952 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:06,952 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:07,152 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 500 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6066 [2021-06-05 14:28:07,152 INFO L430 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:07,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:07,153 INFO L82 PathProgramCache]: Analyzing trace with hash -481960432, now seen corresponding path program 354 times [2021-06-05 14:28:07,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:07,153 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133296189] [2021-06-05 14:28:07,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:07,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:07,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133296189] [2021-06-05 14:28:07,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133296189] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:07,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060632696] [2021-06-05 14:28:07,237 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 501 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 501 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:07,263 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:28:07,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:07,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:07,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28: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 16 treesize of output 12 [2021-06-05 14:28:07,342 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:07,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:07,344 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:07,359 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:07,360 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:07,360 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 14:28:07,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:07,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 16 treesize of output 12 [2021-06-05 14:28:07,406 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:07,408 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:07,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 16 treesize of output 12 [2021-06-05 14:28:07,409 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:07,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:07,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:28:07,412 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:07,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:07,415 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:07,446 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 14:28:07,447 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:07,447 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:07,447 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 14:28:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:07,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060632696] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:07,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:07,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:28:07,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096386600] [2021-06-05 14:28:07,504 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:28:07,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:07,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:28:07,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:28:07,504 INFO L87 Difference]: Start difference. First operand 1021 states and 4006 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:07,848 INFO L93 Difference]: Finished difference Result 1126 states and 4344 transitions. [2021-06-05 14:28:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:28:07,848 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:07,850 INFO L225 Difference]: With dead ends: 1126 [2021-06-05 14:28:07,850 INFO L226 Difference]: Without dead ends: 1122 [2021-06-05 14:28:07,850 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 306.2ms TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:07,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2021-06-05 14:28:07,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1025. [2021-06-05 14:28:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.9267578125) internal successors, (4021), 1024 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4021 transitions. [2021-06-05 14:28:07,861 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4021 transitions. Word has length 19 [2021-06-05 14:28:07,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:07,861 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4021 transitions. [2021-06-05 14:28:07,861 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4021 transitions. [2021-06-05 14:28:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:07,862 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:07,862 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:08,062 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6071,501 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:08,063 INFO L430 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:08,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:08,063 INFO L82 PathProgramCache]: Analyzing trace with hash 946994674, now seen corresponding path program 355 times [2021-06-05 14:28:08,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:08,063 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107816606] [2021-06-05 14:28:08,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:08,183 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:08,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107816606] [2021-06-05 14:28:08,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107816606] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:08,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126064716] [2021-06-05 14:28:08,183 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 502 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 502 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:08,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:08,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:08,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:08,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:08,297 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:08,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 16 treesize of output 12 [2021-06-05 14:28:08,300 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:08,314 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:08,314 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:08,314 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:28:08,351 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:08,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:08,352 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:08,354 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:08,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:08,355 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:08,357 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:08,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:08,358 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:08,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 16 treesize of output 12 [2021-06-05 14:28:08,360 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:08,390 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:28:08,390 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:08,391 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:08,391 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:28:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:08,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126064716] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:08,448 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:08,448 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:08,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609506875] [2021-06-05 14:28:08,448 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:08,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:08,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:08,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:08,449 INFO L87 Difference]: Start difference. First operand 1025 states and 4021 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:08,898 INFO L93 Difference]: Finished difference Result 1123 states and 4353 transitions. [2021-06-05 14:28:08,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:28:08,898 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:08,900 INFO L225 Difference]: With dead ends: 1123 [2021-06-05 14:28:08,900 INFO L226 Difference]: Without dead ends: 1120 [2021-06-05 14:28:08,900 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 417.8ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:28:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2021-06-05 14:28:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1025. [2021-06-05 14:28:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.923828125) internal successors, (4018), 1024 states have internal predecessors, (4018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4018 transitions. [2021-06-05 14:28:08,911 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4018 transitions. Word has length 19 [2021-06-05 14:28:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:08,911 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4018 transitions. [2021-06-05 14:28:08,911 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4018 transitions. [2021-06-05 14:28:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:08,912 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:08,912 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:09,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 502 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6078 [2021-06-05 14:28:09,113 INFO L430 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:09,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1873018118, now seen corresponding path program 356 times [2021-06-05 14:28:09,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:09,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132581253] [2021-06-05 14:28:09,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:09,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:09,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132581253] [2021-06-05 14:28:09,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132581253] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:09,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203485182] [2021-06-05 14:28:09,195 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 503 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 503 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:09,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:09,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:09,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:09,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:09,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:09,298 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:09,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:09,301 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:09,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:09,316 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:09,316 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:43 [2021-06-05 14:28:09,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:09,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 16 treesize of output 12 [2021-06-05 14:28:09,353 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:09,355 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:09,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:09,355 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:09,358 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:09,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:09,358 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:09,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:09,361 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:09,393 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 14:28:09,393 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:09,393 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:09,393 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 14:28:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:09,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203485182] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:09,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:09,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:28:09,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071432851] [2021-06-05 14:28:09,438 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:28:09,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:09,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:28:09,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:28:09,439 INFO L87 Difference]: Start difference. First operand 1025 states and 4018 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:09,649 INFO L93 Difference]: Finished difference Result 1108 states and 4307 transitions. [2021-06-05 14:28:09,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:09,649 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:09,651 INFO L225 Difference]: With dead ends: 1108 [2021-06-05 14:28:09,651 INFO L226 Difference]: Without dead ends: 1108 [2021-06-05 14:28:09,651 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 215.6ms TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2021-06-05 14:28:09,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1015. [2021-06-05 14:28:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 3.9270216962524653) internal successors, (3982), 1014 states have internal predecessors, (3982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 3982 transitions. [2021-06-05 14:28:09,661 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 3982 transitions. Word has length 19 [2021-06-05 14:28:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:09,661 INFO L482 AbstractCegarLoop]: Abstraction has 1015 states and 3982 transitions. [2021-06-05 14:28:09,661 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 3982 transitions. [2021-06-05 14:28:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:09,663 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:09,663 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:09,863 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 503 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6085 [2021-06-05 14:28:09,863 INFO L430 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:09,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1301813386, now seen corresponding path program 357 times [2021-06-05 14:28:09,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:09,864 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601533385] [2021-06-05 14:28:09,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:09,987 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:09,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601533385] [2021-06-05 14:28:09,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601533385] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:09,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633097784] [2021-06-05 14:28:09,987 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 504 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 504 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:10,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:28:10,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:10,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:10,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:10,115 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:10,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:10,116 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:10,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 16 treesize of output 12 [2021-06-05 14:28:10,118 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:10,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:10,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:10,133 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:28:10,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:10,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 17 treesize of output 13 [2021-06-05 14:28:10,172 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:10,174 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:10,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 16 treesize of output 12 [2021-06-05 14:28:10,174 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:10,176 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:10,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:10,177 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:10,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:10,180 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:10,210 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:28:10,210 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:10,210 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:10,211 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:28:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:10,260 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633097784] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:10,260 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:10,260 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:10,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425922191] [2021-06-05 14:28:10,260 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:10,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:10,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:10,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:10,261 INFO L87 Difference]: Start difference. First operand 1015 states and 3982 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:10,764 INFO L93 Difference]: Finished difference Result 1139 states and 4383 transitions. [2021-06-05 14:28:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:28:10,765 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:10,766 INFO L225 Difference]: With dead ends: 1139 [2021-06-05 14:28:10,766 INFO L226 Difference]: Without dead ends: 1139 [2021-06-05 14:28:10,766 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 450.2ms TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:28:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-06-05 14:28:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1021. [2021-06-05 14:28:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.930392156862745) internal successors, (4009), 1020 states have internal predecessors, (4009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 4009 transitions. [2021-06-05 14:28:10,777 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 4009 transitions. Word has length 19 [2021-06-05 14:28:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:10,778 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 4009 transitions. [2021-06-05 14:28:10,778 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 4009 transitions. [2021-06-05 14:28:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:10,779 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:10,779 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:10,979 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6090,504 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:10,979 INFO L430 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:10,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:10,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1798117736, now seen corresponding path program 358 times [2021-06-05 14:28:10,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:10,980 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983695943] [2021-06-05 14:28:10,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:11,058 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:11,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983695943] [2021-06-05 14:28:11,058 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983695943] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:11,058 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904917737] [2021-06-05 14:28:11,058 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 505 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 505 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:11,084 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:28:11,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:11,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:11,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:11,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:11,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 14:28:11,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:11,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 17 treesize of output 13 [2021-06-05 14:28:11,163 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:11,178 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:11,178 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:11,178 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 14:28:11,213 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 14:28:11,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 16 treesize of output 12 [2021-06-05 14:28:11,216 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:11,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 15 treesize of output 11 [2021-06-05 14:28:11,218 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:11,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 17 treesize of output 13 [2021-06-05 14:28:11,221 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:11,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:28:11,224 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:11,256 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 14:28:11,256 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:11,257 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:11,257 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 14:28:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:11,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904917737] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:11,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:11,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:28:11,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460560842] [2021-06-05 14:28:11,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:28:11,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:11,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:28:11,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:28:11,313 INFO L87 Difference]: Start difference. First operand 1021 states and 4009 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:11,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:11,642 INFO L93 Difference]: Finished difference Result 1129 states and 4353 transitions. [2021-06-05 14:28:11,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:28:11,642 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:11,644 INFO L225 Difference]: With dead ends: 1129 [2021-06-05 14:28:11,644 INFO L226 Difference]: Without dead ends: 1125 [2021-06-05 14:28:11,644 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 284.2ms TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2021-06-05 14:28:11,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1025. [2021-06-05 14:28:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.9296875) internal successors, (4024), 1024 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4024 transitions. [2021-06-05 14:28:11,654 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4024 transitions. Word has length 19 [2021-06-05 14:28:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:11,655 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4024 transitions. [2021-06-05 14:28:11,655 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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:28:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4024 transitions. [2021-06-05 14:28:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:11,656 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:11,656 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:11,869 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 505 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6095 [2021-06-05 14:28:11,869 INFO L430 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash -369162630, now seen corresponding path program 359 times [2021-06-05 14:28:11,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:11,869 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632512726] [2021-06-05 14:28:11,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:11,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:11,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632512726] [2021-06-05 14:28:11,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632512726] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:11,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853745421] [2021-06-05 14:28:11,990 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 506 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 506 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:12,017 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:12,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:12,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:12,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:12,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:12,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 15 treesize of output 11 [2021-06-05 14:28:12,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:12,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:12,108 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:12,122 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:12,122 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:12,122 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:28:12,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:12,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:12,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:12,162 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:12,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 16 treesize of output 12 [2021-06-05 14:28:12,163 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:12,165 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:12,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:12,170 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:12,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 15 treesize of output 11 [2021-06-05 14:28:12,172 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:12,202 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:28:12,202 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:12,203 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:12,203 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:28:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:12,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853745421] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:12,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:12,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:12,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657833325] [2021-06-05 14:28:12,261 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:12,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:12,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:12,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:12,262 INFO L87 Difference]: Start difference. First operand 1025 states and 4024 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:12,771 INFO L93 Difference]: Finished difference Result 1142 states and 4393 transitions. [2021-06-05 14:28:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:28:12,771 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:12,773 INFO L225 Difference]: With dead ends: 1142 [2021-06-05 14:28:12,773 INFO L226 Difference]: Without dead ends: 1139 [2021-06-05 14:28:12,773 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 461.0ms TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:28:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-06-05 14:28:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1025. [2021-06-05 14:28:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.9267578125) internal successors, (4021), 1024 states have internal predecessors, (4021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4021 transitions. [2021-06-05 14:28:12,784 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4021 transitions. Word has length 19 [2021-06-05 14:28:12,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:12,784 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4021 transitions. [2021-06-05 14:28:12,784 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4021 transitions. [2021-06-05 14:28:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:12,785 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:12,785 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:12,986 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 506 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6102 [2021-06-05 14:28:12,986 INFO L430 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:12,986 INFO L82 PathProgramCache]: Analyzing trace with hash 556860814, now seen corresponding path program 360 times [2021-06-05 14:28:12,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:12,986 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979840988] [2021-06-05 14:28:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:13,067 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:13,067 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979840988] [2021-06-05 14:28:13,068 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979840988] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:13,068 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385997961] [2021-06-05 14:28:13,068 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 507 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 507 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:13,094 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:28:13,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:13,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:13,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:13,170 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:13,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 18 treesize of output 14 [2021-06-05 14:28:13,171 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:13,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:13,174 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:13,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:13,189 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:13,189 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 14:28:13,223 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 14:28:13,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:13,226 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:13,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:13,228 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:13,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:13,231 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:13,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 16 treesize of output 12 [2021-06-05 14:28:13,234 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:13,264 INFO L628 ElimStorePlain]: treesize reduction 53, result has 36.9 percent of original size [2021-06-05 14:28:13,265 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:13,265 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:13,265 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:31 [2021-06-05 14:28:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:13,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385997961] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:13,310 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:13,310 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:28:13,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254955519] [2021-06-05 14:28:13,310 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:28:13,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:13,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:28:13,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:28:13,311 INFO L87 Difference]: Start difference. First operand 1025 states and 4021 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:13,572 INFO L93 Difference]: Finished difference Result 1114 states and 4322 transitions. [2021-06-05 14:28:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:13,572 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:13,574 INFO L225 Difference]: With dead ends: 1114 [2021-06-05 14:28:13,574 INFO L226 Difference]: Without dead ends: 1114 [2021-06-05 14:28:13,574 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 244.1ms TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:28:13,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2021-06-05 14:28:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1018. [2021-06-05 14:28:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.927236971484759) internal successors, (3994), 1017 states have internal predecessors, (3994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3994 transitions. [2021-06-05 14:28:13,584 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3994 transitions. Word has length 19 [2021-06-05 14:28:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:13,584 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3994 transitions. [2021-06-05 14:28:13,584 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3994 transitions. [2021-06-05 14:28:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:13,585 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:13,586 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:13,786 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6109,507 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:13,786 INFO L430 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:13,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:13,786 INFO L82 PathProgramCache]: Analyzing trace with hash -2098209964, now seen corresponding path program 361 times [2021-06-05 14:28:13,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:13,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994226979] [2021-06-05 14:28:13,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:13,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:13,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994226979] [2021-06-05 14:28:13,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994226979] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:13,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069174342] [2021-06-05 14:28:13,897 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 508 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 508 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:13,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:13,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:14,009 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:14,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:28:14,010 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:14,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:14,012 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:14,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:14,026 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:14,026 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:39 [2021-06-05 14:28:14,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:14,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 16 treesize of output 12 [2021-06-05 14:28:14,090 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:14,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 8 treesize of output 6 [2021-06-05 14:28:14,102 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:14,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:28:14,104 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:14,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 17 treesize of output 13 [2021-06-05 14:28:14,107 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:14,122 INFO L628 ElimStorePlain]: treesize reduction 24, result has 35.1 percent of original size [2021-06-05 14:28:14,122 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:14,123 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:14,123 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:13 [2021-06-05 14:28:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:14,144 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069174342] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:14,144 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:14,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:14,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426836927] [2021-06-05 14:28:14,144 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:14,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:14,145 INFO L87 Difference]: Start difference. First operand 1018 states and 3994 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:14,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:14,562 INFO L93 Difference]: Finished difference Result 1108 states and 4301 transitions. [2021-06-05 14:28:14,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:28:14,563 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:14,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:14,564 INFO L225 Difference]: With dead ends: 1108 [2021-06-05 14:28:14,564 INFO L226 Difference]: Without dead ends: 1102 [2021-06-05 14:28:14,565 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 399.2ms TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:28:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2021-06-05 14:28:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1018. [2021-06-05 14:28:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 3.9242871189773845) internal successors, (3991), 1017 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 3991 transitions. [2021-06-05 14:28:14,575 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 3991 transitions. Word has length 19 [2021-06-05 14:28:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:14,575 INFO L482 AbstractCegarLoop]: Abstraction has 1018 states and 3991 transitions. [2021-06-05 14:28:14,575 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 3991 transitions. [2021-06-05 14:28:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:14,577 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:14,577 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:14,777 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6114,508 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:14,777 INFO L430 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash -316879866, now seen corresponding path program 362 times [2021-06-05 14:28:14,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:14,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959642081] [2021-06-05 14:28:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:14,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:14,863 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:14,863 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959642081] [2021-06-05 14:28:14,863 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959642081] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:14,863 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258022183] [2021-06-05 14:28:14,863 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 509 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 509 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:14,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:14,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:14,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:14,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:14,968 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:14,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 18 treesize of output 14 [2021-06-05 14:28:14,969 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:14,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:14,971 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:14,986 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 14:28:14,987 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:14,987 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:61, output treesize:47 [2021-06-05 14:28:15,034 INFO L446 ElimStorePlain]: Different costs {0=[array_0], 1=[array_4]} [2021-06-05 14:28:15,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 16 treesize of output 12 [2021-06-05 14:28:15,036 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:15,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:15,038 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:15,053 INFO L628 ElimStorePlain]: treesize reduction 29, result has 32.6 percent of original size [2021-06-05 14:28:15,053 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:15,053 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:28:15,053 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:14 [2021-06-05 14:28:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:15,073 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258022183] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:15,073 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:15,073 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-06-05 14:28:15,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405580958] [2021-06-05 14:28:15,073 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 14:28:15,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:15,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 14:28:15,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 14:28:15,073 INFO L87 Difference]: Start difference. First operand 1018 states and 3991 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:15,367 INFO L93 Difference]: Finished difference Result 1111 states and 4316 transitions. [2021-06-05 14:28:15,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:15,368 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:15,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:15,369 INFO L225 Difference]: With dead ends: 1111 [2021-06-05 14:28:15,369 INFO L226 Difference]: Without dead ends: 1111 [2021-06-05 14:28:15,369 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 233.0ms TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-05 14:28:15,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2021-06-05 14:28:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1007. [2021-06-05 14:28:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 3.9343936381709743) internal successors, (3958), 1006 states have internal predecessors, (3958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 3958 transitions. [2021-06-05 14:28:15,389 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 3958 transitions. Word has length 19 [2021-06-05 14:28:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:15,389 INFO L482 AbstractCegarLoop]: Abstraction has 1007 states and 3958 transitions. [2021-06-05 14:28:15,390 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 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:28:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 3958 transitions. [2021-06-05 14:28:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:15,391 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:15,391 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:15,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 509 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6121 [2021-06-05 14:28:15,591 INFO L430 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:15,592 INFO L82 PathProgramCache]: Analyzing trace with hash 927027954, now seen corresponding path program 363 times [2021-06-05 14:28:15,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:15,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372901102] [2021-06-05 14:28:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:15,721 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:15,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372901102] [2021-06-05 14:28:15,721 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372901102] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:15,721 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595403478] [2021-06-05 14:28:15,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 510 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 510 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:15,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:28:15,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:15,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:15,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:15,809 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:15,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 15 treesize of output 11 [2021-06-05 14:28:15,810 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:15,812 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:15,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:15,813 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:15,815 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:15,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 16 treesize of output 12 [2021-06-05 14:28:15,816 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:15,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 17 treesize of output 13 [2021-06-05 14:28:15,819 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:15,862 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 14:28:15,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:15,863 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 14:28:15,967 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:15,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:15,968 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:15,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:15,970 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:15,984 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:28:15,984 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:15,984 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:28:15,984 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:28:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:16,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595403478] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:16,004 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:16,004 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:16,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162382852] [2021-06-05 14:28:16,004 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:16,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:16,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:16,005 INFO L87 Difference]: Start difference. First operand 1007 states and 3958 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:16,503 INFO L93 Difference]: Finished difference Result 1308 states and 5048 transitions. [2021-06-05 14:28:16,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:16,504 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:16,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:16,506 INFO L225 Difference]: With dead ends: 1308 [2021-06-05 14:28:16,506 INFO L226 Difference]: Without dead ends: 1308 [2021-06-05 14:28:16,506 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 429.0ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:28:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2021-06-05 14:28:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1016. [2021-06-05 14:28:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1015 states have (on average 3.9320197044334977) internal successors, (3991), 1015 states have internal predecessors, (3991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 3991 transitions. [2021-06-05 14:28:16,518 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 3991 transitions. Word has length 19 [2021-06-05 14:28:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:16,518 INFO L482 AbstractCegarLoop]: Abstraction has 1016 states and 3991 transitions. [2021-06-05 14:28:16,518 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 3991 transitions. [2021-06-05 14:28:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:16,520 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:16,520 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:16,720 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 510 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6124 [2021-06-05 14:28:16,720 INFO L430 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1022038400, now seen corresponding path program 364 times [2021-06-05 14:28:16,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:16,720 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531265415] [2021-06-05 14:28:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:16,859 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:16,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531265415] [2021-06-05 14:28:16,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531265415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:16,859 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556600796] [2021-06-05 14:28:16,859 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 511 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 511 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:16,886 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:28:16,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:16,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:16,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:16,946 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:16,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 15 treesize of output 11 [2021-06-05 14:28:16,947 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:16,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:16,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 16 treesize of output 12 [2021-06-05 14:28:16,950 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:16,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:16,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:16,953 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:16,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:16,955 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:16,999 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 14:28:17,000 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:17,000 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 14:28:17,116 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:17,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 15 treesize of output 11 [2021-06-05 14:28:17,117 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:17,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:17,119 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:17,132 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:28:17,132 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:17,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:28:17,133 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:28:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:17,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556600796] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:17,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:17,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:17,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107783014] [2021-06-05 14:28:17,153 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:17,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:17,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:17,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:17,153 INFO L87 Difference]: Start difference. First operand 1016 states and 3991 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:17,587 INFO L93 Difference]: Finished difference Result 1217 states and 4702 transitions. [2021-06-05 14:28:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:17,588 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:17,589 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 14:28:17,589 INFO L226 Difference]: Without dead ends: 1217 [2021-06-05 14:28:17,589 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 422.6ms TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-06-05 14:28:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-06-05 14:28:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1020. [2021-06-05 14:28:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.9332679097154073) internal successors, (4008), 1019 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 4008 transitions. [2021-06-05 14:28:17,601 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 4008 transitions. Word has length 19 [2021-06-05 14:28:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:17,601 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 4008 transitions. [2021-06-05 14:28:17,601 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:17,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 4008 transitions. [2021-06-05 14:28:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:17,602 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:17,602 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:17,803 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6130,511 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:17,803 INFO L430 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:17,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1664344626, now seen corresponding path program 365 times [2021-06-05 14:28:17,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:17,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796810025] [2021-06-05 14:28:17,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:17,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:17,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796810025] [2021-06-05 14:28:17,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796810025] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:17,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161228409] [2021-06-05 14:28:17,897 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 512 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 512 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:17,926 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:17,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:17,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-05 14:28:17,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:17,981 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:17,982 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:17,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:28:17,983 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:17,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:17,985 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:17,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 16 treesize of output 12 [2021-06-05 14:28:17,986 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:17,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:17,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:17,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 17 treesize of output 13 [2021-06-05 14:28:17,990 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:17,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:17,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:17,992 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:18,046 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:18,047 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:18,047 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:18,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 14:28:18,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:18,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 7 treesize of output 5 [2021-06-05 14:28:18,265 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:18,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:18,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:18,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 16 treesize of output 12 [2021-06-05 14:28:18,268 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:18,270 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:18,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 17 treesize of output 13 [2021-06-05 14:28:18,271 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:18,291 INFO L628 ElimStorePlain]: treesize reduction 30, result has 38.8 percent of original size [2021-06-05 14:28:18,291 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:18,292 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:18,292 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:13 [2021-06-05 14:28:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:18,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161228409] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:18,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:18,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:18,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990525065] [2021-06-05 14:28:18,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:18,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:18,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:18,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:18,313 INFO L87 Difference]: Start difference. First operand 1020 states and 4008 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:18,963 INFO L93 Difference]: Finished difference Result 1360 states and 5213 transitions. [2021-06-05 14:28:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 14:28:18,963 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 19 [2021-06-05 14:28:18,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:18,965 INFO L225 Difference]: With dead ends: 1360 [2021-06-05 14:28:18,965 INFO L226 Difference]: Without dead ends: 1352 [2021-06-05 14:28:18,965 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 693.9ms TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:28:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-06-05 14:28:18,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1020. [2021-06-05 14:28:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 3.929342492639843) internal successors, (4004), 1019 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 4004 transitions. [2021-06-05 14:28:18,977 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 4004 transitions. Word has length 19 [2021-06-05 14:28:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:18,977 INFO L482 AbstractCegarLoop]: Abstraction has 1020 states and 4004 transitions. [2021-06-05 14:28:18,977 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 4004 transitions. [2021-06-05 14:28:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:18,979 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:18,979 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:19,179 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 512 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6136 [2021-06-05 14:28:19,179 INFO L430 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:19,179 INFO L82 PathProgramCache]: Analyzing trace with hash 459199470, now seen corresponding path program 366 times [2021-06-05 14:28:19,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:19,179 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287488600] [2021-06-05 14:28:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:19,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:19,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:19,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287488600] [2021-06-05 14:28:19,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287488600] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:19,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17522519] [2021-06-05 14:28:19,319 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 513 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 513 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:19,346 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:28:19,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:19,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:19,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:19,416 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:19,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:28:19,417 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:19,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:19,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:19,420 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:19,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:19,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:19,422 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:19,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:19,425 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:19,468 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 14:28:19,469 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:19,469 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 14:28:19,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:19,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:19,571 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:19,573 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:19,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 17 treesize of output 13 [2021-06-05 14:28:19,574 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:19,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:19,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 16 treesize of output 12 [2021-06-05 14:28:19,577 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:19,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 16 treesize of output 12 [2021-06-05 14:28:19,579 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:19,609 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:28:19,609 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:19,610 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:19,610 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:28:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:19,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17522519] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:19,660 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:19,660 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:19,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639948328] [2021-06-05 14:28:19,660 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:19,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:19,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:19,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:19,660 INFO L87 Difference]: Start difference. First operand 1020 states and 4004 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:20,264 INFO L93 Difference]: Finished difference Result 1217 states and 4703 transitions. [2021-06-05 14:28:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:28:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:20,266 INFO L225 Difference]: With dead ends: 1217 [2021-06-05 14:28:20,266 INFO L226 Difference]: Without dead ends: 1217 [2021-06-05 14:28:20,266 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 581.6ms TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:28:20,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2021-06-05 14:28:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1024. [2021-06-05 14:28:20,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 3.9266862170087977) internal successors, (4017), 1023 states have internal predecessors, (4017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 4017 transitions. [2021-06-05 14:28:20,278 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 4017 transitions. Word has length 19 [2021-06-05 14:28:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:20,278 INFO L482 AbstractCegarLoop]: Abstraction has 1024 states and 4017 transitions. [2021-06-05 14:28:20,278 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 4017 transitions. [2021-06-05 14:28:20,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:20,279 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:20,279 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:20,479 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 513 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6147 [2021-06-05 14:28:20,480 INFO L430 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash -285753102, now seen corresponding path program 367 times [2021-06-05 14:28:20,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:20,480 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278701805] [2021-06-05 14:28:20,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:20,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:20,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278701805] [2021-06-05 14:28:20,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278701805] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:20,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663191057] [2021-06-05 14:28:20,582 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 514 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 514 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:20,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:20,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:20,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:20,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:20,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 15 treesize of output 11 [2021-06-05 14:28:20,674 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:20,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:20,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:20,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 16 treesize of output 12 [2021-06-05 14:28:20,677 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:20,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:20,679 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:20,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:20,680 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:20,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:20,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:20,683 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:20,737 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:20,738 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:20,738 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:20,905 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 14:28:20,907 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:20,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:28:20,908 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:20,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:20,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 16 treesize of output 12 [2021-06-05 14:28:20,911 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:20,914 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:20,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 16 treesize of output 12 [2021-06-05 14:28:20,915 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:20,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:20,918 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:20,962 INFO L628 ElimStorePlain]: treesize reduction 61, result has 39.0 percent of original size [2021-06-05 14:28:20,962 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:28:20,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:20,963 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:27 [2021-06-05 14:28:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:21,010 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663191057] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:21,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:21,010 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:21,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023414961] [2021-06-05 14:28:21,010 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:21,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:21,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:21,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:21,010 INFO L87 Difference]: Start difference. First operand 1024 states and 4017 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:28:22,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:22,032 INFO L93 Difference]: Finished difference Result 1401 states and 5347 transitions. [2021-06-05 14:28:22,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 14:28:22,032 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:28:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:22,034 INFO L225 Difference]: With dead ends: 1401 [2021-06-05 14:28:22,034 INFO L226 Difference]: Without dead ends: 1401 [2021-06-05 14:28:22,034 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 984.9ms TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 14:28:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2021-06-05 14:28:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1014. [2021-06-05 14:28:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 3.9378084896347483) internal successors, (3989), 1013 states have internal predecessors, (3989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 3989 transitions. [2021-06-05 14:28:22,046 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 3989 transitions. Word has length 19 [2021-06-05 14:28:22,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:22,046 INFO L482 AbstractCegarLoop]: Abstraction has 1014 states and 3989 transitions. [2021-06-05 14:28:22,046 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:28:22,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 3989 transitions. [2021-06-05 14:28:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:22,048 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:22,048 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:22,248 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6155,514 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:22,248 INFO L430 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:22,248 INFO L82 PathProgramCache]: Analyzing trace with hash -562698806, now seen corresponding path program 368 times [2021-06-05 14:28:22,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:22,248 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745843364] [2021-06-05 14:28:22,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:22,367 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:22,368 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745843364] [2021-06-05 14:28:22,368 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745843364] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:22,368 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596255321] [2021-06-05 14:28:22,368 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 515 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 515 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:22,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:22,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:22,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:22,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:22,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:22,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:22,456 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:22,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:22,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 16 treesize of output 12 [2021-06-05 14:28:22,458 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:22,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:22,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 16 treesize of output 12 [2021-06-05 14:28:22,461 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:22,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 17 treesize of output 13 [2021-06-05 14:28:22,470 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:22,513 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 14:28:22,514 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:22,514 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 14:28:22,619 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:22,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 15 treesize of output 11 [2021-06-05 14:28:22,620 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:22,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:22,622 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:22,635 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:28:22,636 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:22,636 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:28:22,636 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:28:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:22,656 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596255321] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:22,656 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:22,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:22,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105825245] [2021-06-05 14:28:22,656 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:22,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:22,657 INFO L87 Difference]: Start difference. First operand 1014 states and 3989 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:23,194 INFO L93 Difference]: Finished difference Result 1250 states and 4841 transitions. [2021-06-05 14:28:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:23,195 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:23,196 INFO L225 Difference]: With dead ends: 1250 [2021-06-05 14:28:23,196 INFO L226 Difference]: Without dead ends: 1250 [2021-06-05 14:28:23,197 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 489.1ms TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:28:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-06-05 14:28:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1019. [2021-06-05 14:28:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 3.93713163064833) internal successors, (4008), 1018 states have internal predecessors, (4008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 4008 transitions. [2021-06-05 14:28:23,209 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 4008 transitions. Word has length 19 [2021-06-05 14:28:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:23,209 INFO L482 AbstractCegarLoop]: Abstraction has 1019 states and 4008 transitions. [2021-06-05 14:28:23,209 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 4008 transitions. [2021-06-05 14:28:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:23,210 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:23,210 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:23,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 515 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6163 [2021-06-05 14:28:23,410 INFO L430 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:23,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:23,411 INFO L82 PathProgramCache]: Analyzing trace with hash 398399508, now seen corresponding path program 369 times [2021-06-05 14:28:23,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:23,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961185317] [2021-06-05 14:28:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:23,542 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:23,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961185317] [2021-06-05 14:28:23,543 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961185317] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:23,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015987827] [2021-06-05 14:28:23,543 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 516 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 516 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:23,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:28:23,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:23,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:23,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:23,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:23,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:28:23,631 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:23,633 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:23,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:23,634 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:23,636 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28: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 16 treesize of output 12 [2021-06-05 14:28:23,637 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:23,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 17 treesize of output 13 [2021-06-05 14:28:23,639 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:23,683 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 14:28:23,684 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:23,684 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 14:28:23,799 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:23,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:28:23,800 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:23,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:23,802 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:23,815 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:28:23,815 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:23,815 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:28:23,816 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:28:23,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:23,835 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015987827] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:23,835 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:23,836 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:23,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615341745] [2021-06-05 14:28:23,836 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:23,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:23,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:23,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:23,836 INFO L87 Difference]: Start difference. First operand 1019 states and 4008 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:24,393 INFO L93 Difference]: Finished difference Result 1133 states and 4379 transitions. [2021-06-05 14:28:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:24,393 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:24,395 INFO L225 Difference]: With dead ends: 1133 [2021-06-05 14:28:24,395 INFO L226 Difference]: Without dead ends: 1133 [2021-06-05 14:28:24,395 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 543.1ms TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:28:24,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2021-06-05 14:28:24,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1021. [2021-06-05 14:28:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1021 states, 1020 states have (on average 3.9352941176470586) internal successors, (4014), 1020 states have internal predecessors, (4014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021 states to 1021 states and 4014 transitions. [2021-06-05 14:28:24,406 INFO L78 Accepts]: Start accepts. Automaton has 1021 states and 4014 transitions. Word has length 19 [2021-06-05 14:28:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:24,406 INFO L482 AbstractCegarLoop]: Abstraction has 1021 states and 4014 transitions. [2021-06-05 14:28:24,406 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1021 states and 4014 transitions. [2021-06-05 14:28:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:24,416 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:24,416 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:24,616 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 516 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6169 [2021-06-05 14:28:24,616 INFO L430 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:24,617 INFO L82 PathProgramCache]: Analyzing trace with hash 325027028, now seen corresponding path program 370 times [2021-06-05 14:28:24,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:24,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292251295] [2021-06-05 14:28:24,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:24,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:24,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:24,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292251295] [2021-06-05 14:28:24,754 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292251295] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:24,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500418434] [2021-06-05 14:28:24,754 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 517 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 517 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:24,781 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:28:24,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:24,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:24,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:24,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:24,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:24,841 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:24,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:24,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 16 treesize of output 12 [2021-06-05 14:28:24,844 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:24,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:24,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 16 treesize of output 12 [2021-06-05 14:28:24,847 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:24,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 17 treesize of output 13 [2021-06-05 14:28:24,849 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:24,893 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 14:28:24,894 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:24,894 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 14:28:24,992 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:24,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 16 treesize of output 12 [2021-06-05 14:28:24,994 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:24,996 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:24,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 17 treesize of output 13 [2021-06-05 14:28:24,997 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:24,999 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:24,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 16 treesize of output 12 [2021-06-05 14:28:25,000 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:25,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:28:25,002 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:25,033 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:28:25,033 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:25,033 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:25,033 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:28:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:25,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500418434] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:25,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:25,086 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:25,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741946072] [2021-06-05 14:28:25,086 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:25,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:25,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:25,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:25,087 INFO L87 Difference]: Start difference. First operand 1021 states and 4014 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:25,813 INFO L93 Difference]: Finished difference Result 1152 states and 4422 transitions. [2021-06-05 14:28:25,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:28:25,814 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:25,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:25,815 INFO L225 Difference]: With dead ends: 1152 [2021-06-05 14:28:25,815 INFO L226 Difference]: Without dead ends: 1152 [2021-06-05 14:28:25,815 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 669.4ms TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2021-06-05 14:28:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2021-06-05 14:28:25,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1026. [2021-06-05 14:28:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 3.937560975609756) internal successors, (4036), 1025 states have internal predecessors, (4036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 4036 transitions. [2021-06-05 14:28:25,827 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 4036 transitions. Word has length 19 [2021-06-05 14:28:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:25,827 INFO L482 AbstractCegarLoop]: Abstraction has 1026 states and 4036 transitions. [2021-06-05 14:28:25,827 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 4036 transitions. [2021-06-05 14:28:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:25,828 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:25,828 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:26,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 517 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6175 [2021-06-05 14:28:26,029 INFO L430 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:26,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:26,029 INFO L82 PathProgramCache]: Analyzing trace with hash 935184276, now seen corresponding path program 371 times [2021-06-05 14:28:26,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:26,029 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263704864] [2021-06-05 14:28:26,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:26,159 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:26,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263704864] [2021-06-05 14:28:26,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263704864] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:26,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260801588] [2021-06-05 14:28:26,159 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 518 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 518 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:26,186 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 14:28:26,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:26,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:26,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:26,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:26,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:26,246 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:26,248 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:26,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 16 treesize of output 12 [2021-06-05 14:28:26,249 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:26,251 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:26,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 16 treesize of output 12 [2021-06-05 14:28:26,252 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:26,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 17 treesize of output 13 [2021-06-05 14:28:26,254 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:26,298 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 14:28:26,299 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:26,299 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 14:28:26,395 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:26,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:26,396 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:26,399 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:26,399 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:26,400 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:26,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:26,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 16 treesize of output 12 [2021-06-05 14:28:26,402 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:26,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:26,405 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:26,435 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:28:26,435 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:26,435 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:26,436 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:28:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:26,496 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260801588] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:26,496 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:26,496 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:26,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428121269] [2021-06-05 14:28:26,496 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:26,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:26,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:26,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:26,496 INFO L87 Difference]: Start difference. First operand 1026 states and 4036 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:27,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:27,279 INFO L93 Difference]: Finished difference Result 1138 states and 4392 transitions. [2021-06-05 14:28:27,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:28:27,279 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:27,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:27,281 INFO L225 Difference]: With dead ends: 1138 [2021-06-05 14:28:27,281 INFO L226 Difference]: Without dead ends: 1136 [2021-06-05 14:28:27,281 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 760.8ms TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2021-06-05 14:28:27,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2021-06-05 14:28:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1022. [2021-06-05 14:28:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1021 states have (on average 3.9431929480901076) internal successors, (4026), 1021 states have internal predecessors, (4026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 4026 transitions. [2021-06-05 14:28:27,292 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 4026 transitions. Word has length 19 [2021-06-05 14:28:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:27,292 INFO L482 AbstractCegarLoop]: Abstraction has 1022 states and 4026 transitions. [2021-06-05 14:28:27,292 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 4026 transitions. [2021-06-05 14:28:27,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:27,293 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:27,293 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:27,493 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6183,518 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:27,493 INFO L430 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:27,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1361309204, now seen corresponding path program 372 times [2021-06-05 14:28:27,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:27,494 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878905200] [2021-06-05 14:28:27,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:27,590 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:27,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878905200] [2021-06-05 14:28:27,590 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878905200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:27,590 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45353741] [2021-06-05 14:28:27,590 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 519 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 519 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:27,616 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:28:27,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:27,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:27,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:27,671 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:27,672 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:27,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:28:27,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:27,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:27,675 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:27,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:27,676 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:27,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:27,678 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:27,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 17 treesize of output 13 [2021-06-05 14:28:27,679 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:27,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:27,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 16 treesize of output 12 [2021-06-05 14:28:27,682 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:27,736 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:27,736 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:27,736 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:27,937 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:27,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:27,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:27,938 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:27,940 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:27,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:27,941 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:27,961 INFO L628 ElimStorePlain]: treesize reduction 33, result has 35.3 percent of original size [2021-06-05 14:28:27,961 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:27,962 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:28:27,962 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:12 [2021-06-05 14:28:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:27,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45353741] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:27,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:27,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:27,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639462790] [2021-06-05 14:28:27,980 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:27,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:27,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:27,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:27,980 INFO L87 Difference]: Start difference. First operand 1022 states and 4026 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:28:28,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:28,316 INFO L93 Difference]: Finished difference Result 1121 states and 4348 transitions. [2021-06-05 14:28:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:28,316 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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 19 [2021-06-05 14:28:28,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:28,318 INFO L225 Difference]: With dead ends: 1121 [2021-06-05 14:28:28,318 INFO L226 Difference]: Without dead ends: 1121 [2021-06-05 14:28:28,318 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 425.6ms TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-06-05 14:28:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1027. [2021-06-05 14:28:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.9444444444444446) internal successors, (4047), 1026 states have internal predecessors, (4047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4047 transitions. [2021-06-05 14:28:28,333 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4047 transitions. Word has length 19 [2021-06-05 14:28:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:28,334 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4047 transitions. [2021-06-05 14:28:28,334 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:28:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4047 transitions. [2021-06-05 14:28:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:28,335 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:28,335 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:28,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 519 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6193 [2021-06-05 14:28:28,545 INFO L430 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:28,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:28,545 INFO L82 PathProgramCache]: Analyzing trace with hash -247275066, now seen corresponding path program 373 times [2021-06-05 14:28:28,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:28,545 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298495141] [2021-06-05 14:28:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:28,651 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:28,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298495141] [2021-06-05 14:28:28,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298495141] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:28,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817972740] [2021-06-05 14:28:28,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 520 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 520 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:28,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:28,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:28,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:28,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:28,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 15 treesize of output 11 [2021-06-05 14:28:28,734 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:28,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:28,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:28,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:28,737 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:28,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:28,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:28,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:28,741 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:28,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:28,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 16 treesize of output 12 [2021-06-05 14:28:28,743 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:28,797 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:28,798 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:28,798 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:29,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 8 treesize of output 6 [2021-06-05 14:28:29,031 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:29,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:29,034 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:29,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 16 treesize of output 12 [2021-06-05 14:28:29,035 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:29,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 7 treesize of output 5 [2021-06-05 14:28:29,038 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:29,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:29,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 17 treesize of output 13 [2021-06-05 14:28:29,042 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:29,067 INFO L628 ElimStorePlain]: treesize reduction 30, result has 38.8 percent of original size [2021-06-05 14:28:29,068 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:29,069 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:29,069 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:13 [2021-06-05 14:28:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:29,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817972740] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:29,093 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:29,093 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:29,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126958712] [2021-06-05 14:28:29,093 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:29,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:29,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:29,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:29,094 INFO L87 Difference]: Start difference. First operand 1027 states and 4047 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:30,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:30,145 INFO L93 Difference]: Finished difference Result 1255 states and 4792 transitions. [2021-06-05 14:28:30,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 14:28:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 19 [2021-06-05 14:28:30,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:30,148 INFO L225 Difference]: With dead ends: 1255 [2021-06-05 14:28:30,148 INFO L226 Difference]: Without dead ends: 1247 [2021-06-05 14:28:30,148 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1006.1ms TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:28:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2021-06-05 14:28:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1027. [2021-06-05 14:28:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.9405458089668617) internal successors, (4043), 1026 states have internal predecessors, (4043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4043 transitions. [2021-06-05 14:28:30,164 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4043 transitions. Word has length 19 [2021-06-05 14:28:30,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:30,164 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4043 transitions. [2021-06-05 14:28:30,164 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4043 transitions. [2021-06-05 14:28:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:30,166 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:30,166 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:30,380 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 520 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6200 [2021-06-05 14:28:30,381 INFO L430 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:30,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:30,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1452420222, now seen corresponding path program 374 times [2021-06-05 14:28:30,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:30,381 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776107883] [2021-06-05 14:28:30,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:30,482 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:30,482 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:30,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776107883] [2021-06-05 14:28:30,482 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776107883] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:30,482 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597811998] [2021-06-05 14:28:30,482 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 521 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 521 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:30,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:30,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:30,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:30,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:30,562 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:30,563 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:30,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 15 treesize of output 11 [2021-06-05 14:28:30,564 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:30,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:30,567 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:30,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:30,567 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:30,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:30,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:30,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 17 treesize of output 13 [2021-06-05 14:28:30,571 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:30,573 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:30,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 16 treesize of output 12 [2021-06-05 14:28:30,574 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:30,626 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:30,626 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:30,626 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:30,804 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 14:28:30,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:30,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:28:30,808 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:30,810 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:30,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 16 treesize of output 12 [2021-06-05 14:28:30,811 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:30,814 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:30,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 17 treesize of output 13 [2021-06-05 14:28:30,815 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:30,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 16 treesize of output 12 [2021-06-05 14:28:30,817 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:30,862 INFO L628 ElimStorePlain]: treesize reduction 61, result has 39.0 percent of original size [2021-06-05 14:28:30,862 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:28:30,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:30,863 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:27 [2021-06-05 14:28:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:30,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597811998] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:30,909 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:30,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:30,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003032672] [2021-06-05 14:28:30,910 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:30,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:30,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:30,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:30,910 INFO L87 Difference]: Start difference. First operand 1027 states and 4043 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:28:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:31,292 INFO L93 Difference]: Finished difference Result 1136 states and 4375 transitions. [2021-06-05 14:28:31,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:31,292 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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 19 [2021-06-05 14:28:31,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:31,294 INFO L225 Difference]: With dead ends: 1136 [2021-06-05 14:28:31,294 INFO L226 Difference]: Without dead ends: 1136 [2021-06-05 14:28:31,294 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 451.7ms TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:28:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2021-06-05 14:28:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1031. [2021-06-05 14:28:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 1030 states have (on average 3.9456310679611653) internal successors, (4064), 1030 states have internal predecessors, (4064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 4064 transitions. [2021-06-05 14:28:31,305 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 4064 transitions. Word has length 19 [2021-06-05 14:28:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:31,305 INFO L482 AbstractCegarLoop]: Abstraction has 1031 states and 4064 transitions. [2021-06-05 14:28:31,305 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:28:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 4064 transitions. [2021-06-05 14:28:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:31,306 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:31,306 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:31,506 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 521 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6211 [2021-06-05 14:28:31,506 INFO L430 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:31,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:31,507 INFO L82 PathProgramCache]: Analyzing trace with hash -257384048, now seen corresponding path program 375 times [2021-06-05 14:28:31,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:31,507 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234850902] [2021-06-05 14:28:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:31,620 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:31,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234850902] [2021-06-05 14:28:31,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234850902] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:31,620 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736427648] [2021-06-05 14:28:31,620 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 522 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 522 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:31,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 14:28:31,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:31,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:31,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:31,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:31,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:31,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 15 treesize of output 11 [2021-06-05 14:28:31,703 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:31,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:31,705 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:31,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:31,706 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:31,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:31,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:31,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:31,713 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:31,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:31,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:31,716 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:31,769 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:31,770 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:31,770 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:31,949 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 14:28:31,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:31,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:31,953 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:31,955 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:31,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 15 treesize of output 11 [2021-06-05 14:28:31,956 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:31,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:31,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:31,960 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:31,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:31,962 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:32,007 INFO L628 ElimStorePlain]: treesize reduction 61, result has 39.0 percent of original size [2021-06-05 14:28:32,007 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:28:32,008 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:32,008 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:27 [2021-06-05 14:28:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:32,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736427648] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:32,064 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:32,065 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:32,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661707505] [2021-06-05 14:28:32,065 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:32,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:32,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:32,065 INFO L87 Difference]: Start difference. First operand 1031 states and 4064 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:33,297 INFO L93 Difference]: Finished difference Result 1370 states and 5134 transitions. [2021-06-05 14:28:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 14:28:33,297 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 19 [2021-06-05 14:28:33,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:33,299 INFO L225 Difference]: With dead ends: 1370 [2021-06-05 14:28:33,299 INFO L226 Difference]: Without dead ends: 1366 [2021-06-05 14:28:33,299 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1140.9ms TimeCoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 14:28:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2021-06-05 14:28:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1036. [2021-06-05 14:28:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1035 states have (on average 3.9458937198067634) internal successors, (4084), 1035 states have internal predecessors, (4084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 4084 transitions. [2021-06-05 14:28:33,311 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 4084 transitions. Word has length 19 [2021-06-05 14:28:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:33,311 INFO L482 AbstractCegarLoop]: Abstraction has 1036 states and 4084 transitions. [2021-06-05 14:28:33,311 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 4084 transitions. [2021-06-05 14:28:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:33,312 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:33,312 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:33,513 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 522 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6221 [2021-06-05 14:28:33,513 INFO L430 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:33,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1171571058, now seen corresponding path program 376 times [2021-06-05 14:28:33,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:33,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554006415] [2021-06-05 14:28:33,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:33,613 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:33,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554006415] [2021-06-05 14:28:33,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554006415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:33,613 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133276063] [2021-06-05 14:28:33,614 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 523 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 523 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:33,640 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:28:33,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:33,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:33,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:33,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:33,703 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:33,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:28:33,704 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:33,706 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:33,706 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:33,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 16 treesize of output 12 [2021-06-05 14:28:33,707 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:33,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:33,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:33,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:33,710 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:33,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:33,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:33,713 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:33,765 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:33,766 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:33,766 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:33,946 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 14:28:33,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:33,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 16 treesize of output 12 [2021-06-05 14:28:33,950 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:33,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:33,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:33,953 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:33,956 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:33,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 16 treesize of output 12 [2021-06-05 14:28:33,957 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:33,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:33,960 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:34,005 INFO L628 ElimStorePlain]: treesize reduction 61, result has 39.0 percent of original size [2021-06-05 14:28:34,005 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:28:34,006 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:34,006 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:27 [2021-06-05 14:28:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:34,062 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133276063] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:34,062 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:34,062 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:34,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027374029] [2021-06-05 14:28:34,062 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:34,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:34,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:34,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:34,062 INFO L87 Difference]: Start difference. First operand 1036 states and 4084 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:28:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:34,453 INFO L93 Difference]: Finished difference Result 1128 states and 4367 transitions. [2021-06-05 14:28:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 14:28:34,453 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:28:34,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:34,455 INFO L225 Difference]: With dead ends: 1128 [2021-06-05 14:28:34,455 INFO L226 Difference]: Without dead ends: 1124 [2021-06-05 14:28:34,455 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 481.1ms TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-06-05 14:28:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2021-06-05 14:28:34,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1036. [2021-06-05 14:28:34,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 1035 states have (on average 3.9420289855072466) internal successors, (4080), 1035 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 4080 transitions. [2021-06-05 14:28:34,466 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 4080 transitions. Word has length 19 [2021-06-05 14:28:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:34,466 INFO L482 AbstractCegarLoop]: Abstraction has 1036 states and 4080 transitions. [2021-06-05 14:28:34,466 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:28:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 4080 transitions. [2021-06-05 14:28:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:34,467 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:34,467 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:34,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 523 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6231 [2021-06-05 14:28:34,667 INFO L430 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:34,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2097594502, now seen corresponding path program 377 times [2021-06-05 14:28:34,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:34,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437563420] [2021-06-05 14:28:34,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:34,784 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:34,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437563420] [2021-06-05 14:28:34,784 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437563420] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:34,784 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99070798] [2021-06-05 14:28:34,784 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 524 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 524 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:34,811 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:34,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:34,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:34,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:34,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:34,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:34,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:34,868 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:34,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:34,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:34,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 16 treesize of output 12 [2021-06-05 14:28:34,871 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:34,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:34,874 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:34,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 17 treesize of output 13 [2021-06-05 14:28:34,875 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:34,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:34,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:34,877 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:34,940 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:34,941 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:34,941 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:35,127 INFO L446 ElimStorePlain]: Different costs {1=[array_4], 3=[array_2]} [2021-06-05 14:28:35,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:35,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 16 treesize of output 12 [2021-06-05 14:28:35,130 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:35,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28: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:28:35,134 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:35,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28: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 17 treesize of output 13 [2021-06-05 14:28:35,137 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:35,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 16 treesize of output 12 [2021-06-05 14:28:35,140 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:35,184 INFO L628 ElimStorePlain]: treesize reduction 61, result has 39.0 percent of original size [2021-06-05 14:28:35,185 INFO L518 ElimStorePlain]: Eliminatee array_2 vanished before elimination [2021-06-05 14:28:35,185 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:35,185 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:27 [2021-06-05 14:28:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:35,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99070798] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:35,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:35,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:35,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597317716] [2021-06-05 14:28:35,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:35,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:35,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:35,231 INFO L87 Difference]: Start difference. First operand 1036 states and 4080 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:28:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:36,329 INFO L93 Difference]: Finished difference Result 1363 states and 5138 transitions. [2021-06-05 14:28:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 14:28:36,330 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:28:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:36,332 INFO L225 Difference]: With dead ends: 1363 [2021-06-05 14:28:36,332 INFO L226 Difference]: Without dead ends: 1363 [2021-06-05 14:28:36,332 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1073.3ms TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 14:28:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2021-06-05 14:28:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1023. [2021-06-05 14:28:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.943248532289628) internal successors, (4030), 1022 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 4030 transitions. [2021-06-05 14:28:36,343 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 4030 transitions. Word has length 19 [2021-06-05 14:28:36,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:36,343 INFO L482 AbstractCegarLoop]: Abstraction has 1023 states and 4030 transitions. [2021-06-05 14:28:36,343 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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:28:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 4030 transitions. [2021-06-05 14:28:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:36,345 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:36,345 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:36,545 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6243,524 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:36,545 INFO L430 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:36,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:36,545 INFO L82 PathProgramCache]: Analyzing trace with hash -903503812, now seen corresponding path program 378 times [2021-06-05 14:28:36,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:36,546 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124314846] [2021-06-05 14:28:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:36,683 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:36,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124314846] [2021-06-05 14:28:36,683 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124314846] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:36,683 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621831664] [2021-06-05 14:28:36,684 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 525 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 525 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:36,710 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 14:28:36,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:36,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:36,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:36,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:36,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:28:36,772 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:36,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:36,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 16 treesize of output 12 [2021-06-05 14:28:36,774 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:36,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:36,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:36,777 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:36,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:36,780 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:36,823 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 14:28:36,823 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:36,824 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 14:28:36,954 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:36,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:28:36,955 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:36,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:36,958 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:36,985 INFO L628 ElimStorePlain]: treesize reduction 27, result has 30.8 percent of original size [2021-06-05 14:28:36,985 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:36,985 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 14:28:36,985 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:12 [2021-06-05 14:28:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:37,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621831664] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:37,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:37,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:37,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329067889] [2021-06-05 14:28:37,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:37,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:37,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:37,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:37,007 INFO L87 Difference]: Start difference. First operand 1023 states and 4030 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:37,599 INFO L93 Difference]: Finished difference Result 1117 states and 4339 transitions. [2021-06-05 14:28:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 14:28:37,599 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:37,601 INFO L225 Difference]: With dead ends: 1117 [2021-06-05 14:28:37,601 INFO L226 Difference]: Without dead ends: 1117 [2021-06-05 14:28:37,601 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 595.1ms TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 14:28:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2021-06-05 14:28:37,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1025. [2021-06-05 14:28:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 3.94140625) internal successors, (4036), 1024 states have internal predecessors, (4036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 4036 transitions. [2021-06-05 14:28:37,612 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 4036 transitions. Word has length 19 [2021-06-05 14:28:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:37,612 INFO L482 AbstractCegarLoop]: Abstraction has 1025 states and 4036 transitions. [2021-06-05 14:28:37,612 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 4036 transitions. [2021-06-05 14:28:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:37,614 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:37,614 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:37,814 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 525 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6253 [2021-06-05 14:28:37,814 INFO L430 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:37,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:37,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1718309966, now seen corresponding path program 379 times [2021-06-05 14:28:37,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:37,814 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962007695] [2021-06-05 14:28:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:37,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:37,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:37,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962007695] [2021-06-05 14:28:37,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962007695] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:37,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012268761] [2021-06-05 14:28:37,964 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 526 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 526 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:37,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:37,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:38,049 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:38,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:38,050 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:38,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:38,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 16 treesize of output 12 [2021-06-05 14:28:38,053 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:38,055 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:38,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 16 treesize of output 12 [2021-06-05 14:28:38,056 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:38,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:38,058 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:38,102 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.8 percent of original size [2021-06-05 14:28:38,103 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:38,103 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2021-06-05 14:28:38,214 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:38,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:38,215 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:38,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:38,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 17 treesize of output 13 [2021-06-05 14:28:38,218 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:38,220 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:38,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:38,221 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:38,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 15 treesize of output 11 [2021-06-05 14:28:38,223 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:38,254 INFO L628 ElimStorePlain]: treesize reduction 49, result has 35.5 percent of original size [2021-06-05 14:28:38,254 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:38,254 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:38,254 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:27 [2021-06-05 14:28:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:38,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012268761] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:38,307 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:38,307 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 14:28:38,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957683656] [2021-06-05 14:28:38,307 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 14:28:38,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:38,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 14:28:38,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 14:28:38,308 INFO L87 Difference]: Start difference. First operand 1025 states and 4036 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:39,021 INFO L93 Difference]: Finished difference Result 1123 states and 4344 transitions. [2021-06-05 14:28:39,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 14:28:39,021 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 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:28:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:39,023 INFO L225 Difference]: With dead ends: 1123 [2021-06-05 14:28:39,023 INFO L226 Difference]: Without dead ends: 1109 [2021-06-05 14:28:39,023 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 765.4ms TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2021-06-05 14:28:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-06-05 14:28:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1023. [2021-06-05 14:28:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.943248532289628) internal successors, (4030), 1022 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:39,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 4030 transitions. [2021-06-05 14:28:39,034 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 4030 transitions. Word has length 19 [2021-06-05 14:28:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:39,034 INFO L482 AbstractCegarLoop]: Abstraction has 1023 states and 4030 transitions. [2021-06-05 14:28:39,034 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 4030 transitions. [2021-06-05 14:28:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:39,035 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:39,035 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:39,235 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6259,526 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:39,236 INFO L430 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:39,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:39,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1756882480, now seen corresponding path program 380 times [2021-06-05 14:28:39,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:39,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916086930] [2021-06-05 14:28:39,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:39,340 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:39,340 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916086930] [2021-06-05 14:28:39,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916086930] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:39,341 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637261293] [2021-06-05 14:28:39,341 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 527 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 527 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:39,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:39,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:39,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:39,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:39,421 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:39,422 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:39,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out 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:28:39,422 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:39,424 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:39,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:39,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 16 treesize of output 12 [2021-06-05 14:28:39,426 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:39,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:39,428 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:39,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:39,429 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:39,431 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:39,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 16 treesize of output 12 [2021-06-05 14:28:39,432 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:39,485 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:39,486 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:39,486 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:39,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:39,684 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:39,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:39,685 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:39,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 14:28:39,688 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:39,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:39,690 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:39,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 17 treesize of output 13 [2021-06-05 14:28:39,691 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:39,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 7 treesize of output 5 [2021-06-05 14:28:39,693 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:39,713 INFO L628 ElimStorePlain]: treesize reduction 30, result has 38.8 percent of original size [2021-06-05 14:28:39,713 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:39,714 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 14:28:39,714 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:87, output treesize:13 [2021-06-05 14:28:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:39,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637261293] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:39,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:39,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:39,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533084987] [2021-06-05 14:28:39,734 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:39,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:39,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:39,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:39,735 INFO L87 Difference]: Start difference. First operand 1023 states and 4030 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:40,431 INFO L93 Difference]: Finished difference Result 1220 states and 4683 transitions. [2021-06-05 14:28:40,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 14:28:40,431 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 19 [2021-06-05 14:28:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:40,433 INFO L225 Difference]: With dead ends: 1220 [2021-06-05 14:28:40,433 INFO L226 Difference]: Without dead ends: 1212 [2021-06-05 14:28:40,433 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 767.3ms TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:28:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2021-06-05 14:28:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1023. [2021-06-05 14:28:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.943248532289628) internal successors, (4030), 1022 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 4030 transitions. [2021-06-05 14:28:40,444 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 4030 transitions. Word has length 19 [2021-06-05 14:28:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:40,444 INFO L482 AbstractCegarLoop]: Abstraction has 1023 states and 4030 transitions. [2021-06-05 14:28:40,444 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 4030 transitions. [2021-06-05 14:28:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:40,446 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:40,446 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:40,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 527 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6267 [2021-06-05 14:28:40,646 INFO L430 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:40,646 INFO L82 PathProgramCache]: Analyzing trace with hash 263537936, now seen corresponding path program 381 times [2021-06-05 14:28:40,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:40,646 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751643085] [2021-06-05 14:28:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:40,759 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:40,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751643085] [2021-06-05 14:28:40,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751643085] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:40,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457789115] [2021-06-05 14:28:40,759 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 528 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 528 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:40,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 14:28:40,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:40,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:40,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:40,839 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:40,840 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:40,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:40,841 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:40,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:40,843 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:40,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 16 treesize of output 12 [2021-06-05 14:28:40,844 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:40,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:40,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:40,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 17 treesize of output 13 [2021-06-05 14:28:40,847 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:40,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:40,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 16 treesize of output 12 [2021-06-05 14:28:40,850 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:40,903 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:40,904 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:40,904 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:41,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 8 treesize of output 6 [2021-06-05 14:28:41,042 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:41,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 8 treesize of output 6 [2021-06-05 14:28:41,045 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:41,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:41,048 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:41,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 16 treesize of output 12 [2021-06-05 14:28:41,049 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:41,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:28:41,052 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:41,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:28:41,055 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:41,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 7 treesize of output 5 [2021-06-05 14:28:41,058 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:41,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 8 treesize of output 6 [2021-06-05 14:28:41,061 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:41,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:41,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 17 treesize of output 13 [2021-06-05 14:28:41,064 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:41,111 INFO L628 ElimStorePlain]: treesize reduction 66, result has 42.6 percent of original size [2021-06-05 14:28:41,111 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:41,112 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:41,112 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:183, output treesize:49 [2021-06-05 14:28:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:41,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457789115] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:41,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:41,178 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:41,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411289588] [2021-06-05 14:28:41,178 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:41,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:41,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:41,179 INFO L87 Difference]: Start difference. First operand 1023 states and 4030 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:42,043 INFO L93 Difference]: Finished difference Result 1232 states and 4700 transitions. [2021-06-05 14:28:42,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 14:28:42,043 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 19 [2021-06-05 14:28:42,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:42,045 INFO L225 Difference]: With dead ends: 1232 [2021-06-05 14:28:42,045 INFO L226 Difference]: Without dead ends: 1227 [2021-06-05 14:28:42,045 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 975.9ms TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:28:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2021-06-05 14:28:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1027. [2021-06-05 14:28:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 3.935672514619883) internal successors, (4038), 1026 states have internal predecessors, (4038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 4038 transitions. [2021-06-05 14:28:42,056 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 4038 transitions. Word has length 19 [2021-06-05 14:28:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:42,056 INFO L482 AbstractCegarLoop]: Abstraction has 1027 states and 4038 transitions. [2021-06-05 14:28:42,056 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 4038 transitions. [2021-06-05 14:28:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:42,057 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:42,057 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:42,258 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 528 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6277 [2021-06-05 14:28:42,258 INFO L430 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:42,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:42,258 INFO L82 PathProgramCache]: Analyzing trace with hash 190165456, now seen corresponding path program 382 times [2021-06-05 14:28:42,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:42,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136232163] [2021-06-05 14:28:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:42,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:42,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136232163] [2021-06-05 14:28:42,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136232163] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:42,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231296996] [2021-06-05 14:28:42,371 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 529 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 529 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:42,397 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 14:28:42,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:42,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:42,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:42,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:42,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:42,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:42,452 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:42,454 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:42,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:42,455 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,457 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:42,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:42,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 17 treesize of output 13 [2021-06-05 14:28:42,459 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,461 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:42,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 16 treesize of output 12 [2021-06-05 14:28:42,462 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,523 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:42,524 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:42,524 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:42,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 14:28:42,660 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,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 8 treesize of output 6 [2021-06-05 14:28:42,663 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:42,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:42,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 16 treesize of output 12 [2021-06-05 14:28:42,667 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,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 7 treesize of output 5 [2021-06-05 14:28:42,670 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,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 7 treesize of output 5 [2021-06-05 14:28:42,673 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:28:42,675 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,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 8 treesize of output 6 [2021-06-05 14:28:42,678 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:42,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 17 treesize of output 13 [2021-06-05 14:28:42,682 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:42,729 INFO L628 ElimStorePlain]: treesize reduction 66, result has 42.6 percent of original size [2021-06-05 14:28:42,729 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:42,730 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:42,730 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:183, output treesize:49 [2021-06-05 14:28:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:42,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231296996] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:42,790 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:42,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:42,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251839311] [2021-06-05 14:28:42,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:42,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:42,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:42,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:42,790 INFO L87 Difference]: Start difference. First operand 1027 states and 4038 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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:28:43,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:43,606 INFO L93 Difference]: Finished difference Result 1215 states and 4673 transitions. [2021-06-05 14:28:43,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 14:28:43,607 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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:28:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:43,609 INFO L225 Difference]: With dead ends: 1215 [2021-06-05 14:28:43,609 INFO L226 Difference]: Without dead ends: 1211 [2021-06-05 14:28:43,609 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 951.7ms TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2021-06-05 14:28:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2021-06-05 14:28:43,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1023. [2021-06-05 14:28:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 3.9422700587084147) internal successors, (4029), 1022 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:43,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 4029 transitions. [2021-06-05 14:28:43,620 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 4029 transitions. Word has length 19 [2021-06-05 14:28:43,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:43,620 INFO L482 AbstractCegarLoop]: Abstraction has 1023 states and 4029 transitions. [2021-06-05 14:28:43,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 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:28:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 4029 transitions. [2021-06-05 14:28:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:43,621 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:43,621 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:43,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6285,529 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:43,822 INFO L430 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash -696410830, now seen corresponding path program 383 times [2021-06-05 14:28:43,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:43,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240989266] [2021-06-05 14:28:43,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:43,949 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:43,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240989266] [2021-06-05 14:28:43,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240989266] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:43,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126578592] [2021-06-05 14:28:43,949 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 530 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 530 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:43,976 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 14:28:43,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:43,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:43,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:44,029 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,030 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:44,031 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,033 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,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 16 treesize of output 12 [2021-06-05 14:28:44,034 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,036 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,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 17 treesize of output 13 [2021-06-05 14:28:44,037 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,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 16 treesize of output 12 [2021-06-05 14:28:44,040 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,092 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:44,093 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:44,093 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:44,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 8 treesize of output 6 [2021-06-05 14:28:44,186 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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:28:44,189 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,191 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,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 16 treesize of output 12 [2021-06-05 14:28:44,193 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28: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 17 treesize of output 13 [2021-06-05 14:28:44,196 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,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 17 treesize of output 13 [2021-06-05 14:28:44,200 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,203 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,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 16 treesize of output 12 [2021-06-05 14:28:44,204 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,206 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28: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 16 treesize of output 12 [2021-06-05 14:28:44,207 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:44,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 15 treesize of output 11 [2021-06-05 14:28:44,210 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:44,277 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 14:28:44,277 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:44,278 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:44,278 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 14:28:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:44,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126578592] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:44,371 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:44,371 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:44,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770413714] [2021-06-05 14:28:44,371 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:44,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:44,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:44,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:44,372 INFO L87 Difference]: Start difference. First operand 1023 states and 4029 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:28:44,921 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 14:28:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:45,121 INFO L93 Difference]: Finished difference Result 1236 states and 4674 transitions. [2021-06-05 14:28:45,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 14:28:45,121 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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 19 [2021-06-05 14:28:45,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:45,123 INFO L225 Difference]: With dead ends: 1236 [2021-06-05 14:28:45,123 INFO L226 Difference]: Without dead ends: 1236 [2021-06-05 14:28:45,123 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 800.9ms TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2021-06-05 14:28:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2021-06-05 14:28:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1033. [2021-06-05 14:28:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 3.9544573643410854) internal successors, (4081), 1032 states have internal predecessors, (4081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:45,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 4081 transitions. [2021-06-05 14:28:45,135 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 4081 transitions. Word has length 19 [2021-06-05 14:28:45,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:45,135 INFO L482 AbstractCegarLoop]: Abstraction has 1033 states and 4081 transitions. [2021-06-05 14:28:45,135 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 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:28:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 4081 transitions. [2021-06-05 14:28:45,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:45,136 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:45,136 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:45,337 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6293,530 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:45,337 INFO L430 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:45,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:45,337 INFO L82 PathProgramCache]: Analyzing trace with hash 498625344, now seen corresponding path program 384 times [2021-06-05 14:28:45,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:45,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507649519] [2021-06-05 14:28:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:45,457 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:45,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507649519] [2021-06-05 14:28:45,457 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507649519] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:45,457 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457364791] [2021-06-05 14:28:45,457 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 531 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 531 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:45,483 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 14:28:45,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 14:28:45,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:45,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:45,538 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,539 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:45,539 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,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 16 treesize of output 12 [2021-06-05 14:28:45,543 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,545 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28: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 17 treesize of output 13 [2021-06-05 14:28:45,546 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,548 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:45,549 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,602 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:45,603 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:45,603 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:45,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 8 treesize of output 6 [2021-06-05 14:28:45,695 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:28:45,698 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,700 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:45,702 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:45,705 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,708 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:45,709 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:45,713 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,715 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:45,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:45,716 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,718 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28: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 15 treesize of output 11 [2021-06-05 14:28:45,719 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:45,786 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 14:28:45,786 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:45,787 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:45,787 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 14:28:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:45,891 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457364791] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:45,891 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:45,891 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:45,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209699972] [2021-06-05 14:28:45,892 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:45,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:45,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:45,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:45,892 INFO L87 Difference]: Start difference. First operand 1033 states and 4081 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:46,827 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-06-05 14:28:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 14:28:47,464 INFO L93 Difference]: Finished difference Result 1429 states and 5291 transitions. [2021-06-05 14:28:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 14:28:47,464 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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 19 [2021-06-05 14:28:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 14:28:47,466 INFO L225 Difference]: With dead ends: 1429 [2021-06-05 14:28:47,466 INFO L226 Difference]: Without dead ends: 1424 [2021-06-05 14:28:47,467 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1560.1ms TimeCoverageRelationStatistics Valid=264, Invalid=1376, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 14:28:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-06-05 14:28:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1044. [2021-06-05 14:28:47,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 3.9606903163950142) internal successors, (4131), 1043 states have internal predecessors, (4131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 14:28:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 4131 transitions. [2021-06-05 14:28:47,480 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 4131 transitions. Word has length 19 [2021-06-05 14:28:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 14:28:47,480 INFO L482 AbstractCegarLoop]: Abstraction has 1044 states and 4131 transitions. [2021-06-05 14:28:47,480 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 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:28:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 4131 transitions. [2021-06-05 14:28:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 14:28:47,481 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 14:28:47,481 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 14:28:47,681 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 531 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6301 [2021-06-05 14:28:47,681 INFO L430 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 14:28:47,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 14:28:47,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1927580450, now seen corresponding path program 385 times [2021-06-05 14:28:47,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 14:28:47,682 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526672004] [2021-06-05 14:28:47,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 14:28:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:47,810 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 14:28:47,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526672004] [2021-06-05 14:28:47,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526672004] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:47,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807660844] [2021-06-05 14:28:47,810 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 532 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 532 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 14:28:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 14:28:47,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 14:28:47,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 14:28:47,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:47,891 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:47,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 15 treesize of output 11 [2021-06-05 14:28:47,892 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:47,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:47,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:47,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 16 treesize of output 12 [2021-06-05 14:28:47,895 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:47,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:47,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:47,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:47,898 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:47,900 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:47,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 16 treesize of output 12 [2021-06-05 14:28:47,901 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:47,954 INFO L628 ElimStorePlain]: treesize reduction 4, result has 94.7 percent of original size [2021-06-05 14:28:47,955 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:47,955 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:113, output treesize:72 [2021-06-05 14:28:48,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2021-06-05 14:28:48,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:48,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2021-06-05 14:28:48,055 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:48,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:48,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:48,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:48,059 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:48,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:48,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:48,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 17 treesize of output 13 [2021-06-05 14:28:48,064 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:48,067 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:48,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:48,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-06-05 14:28:48,069 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:48,072 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:48,073 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:48,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 14:28:48,074 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:48,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:48,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:48,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 16 treesize of output 12 [2021-06-05 14:28:48,079 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:48,081 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 14:28:48,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 14:28:48,082 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 14:28:48,152 INFO L628 ElimStorePlain]: treesize reduction 99, result has 39.6 percent of original size [2021-06-05 14:28:48,152 INFO L518 ElimStorePlain]: Eliminatee array_4 vanished before elimination [2021-06-05 14:28:48,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 14:28:48,153 INFO L247 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:239, output treesize:65 [2021-06-05 14:28:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 14:28:48,256 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807660844] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 14:28:48,256 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 14:28:48,256 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 14:28:48,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702155427] [2021-06-05 14:28:48,256 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 14:28:48,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 14:28:48,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 14:28:48,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-06-05 14:28:48,257 INFO L87 Difference]: Start difference. First operand 1044 states and 4131 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 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) Received shutdown request... [2021-06-05 14:28:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 14:28:48,751 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 532 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6311 [2021-06-05 14:28:48,751 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 14:28:48,753 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 14:28:48,754 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 14:28:48,754 INFO L202 PluginConnector]: Adding new model array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 02:28:48 BasicIcfg [2021-06-05 14:28:48,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 14:28:48,755 INFO L168 Benchmark]: Toolchain (without parser) took 828069.92 ms. Allocated memory was 358.6 MB in the beginning and 536.9 MB in the end (delta: 178.3 MB). Free memory was 338.1 MB in the beginning and 203.8 MB in the end (delta: 134.4 MB). Peak memory consumption was 314.6 MB. Max. memory is 16.0 GB. [2021-06-05 14:28:48,755 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 358.6 MB. Free memory is still 339.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 14:28:48,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.17 ms. Allocated memory is still 358.6 MB. Free memory was 338.1 MB in the beginning and 336.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 14:28:48,755 INFO L168 Benchmark]: Boogie Preprocessor took 13.63 ms. Allocated memory is still 358.6 MB. Free memory was 336.5 MB in the beginning and 335.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 14:28:48,755 INFO L168 Benchmark]: RCFGBuilder took 427.89 ms. Allocated memory is still 358.6 MB. Free memory was 335.4 MB in the beginning and 339.9 MB in the end (delta: -4.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.0 GB. [2021-06-05 14:28:48,755 INFO L168 Benchmark]: TraceAbstraction took 827569.64 ms. Allocated memory was 358.6 MB in the beginning and 536.9 MB in the end (delta: 178.3 MB). Free memory was 338.9 MB in the beginning and 203.8 MB in the end (delta: 135.1 MB). Peak memory consumption was 312.3 MB. Max. memory is 16.0 GB. [2021-06-05 14:28:48,756 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 358.6 MB. Free memory is still 339.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 27.17 ms. Allocated memory is still 358.6 MB. Free memory was 338.1 MB in the beginning and 336.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 13.63 ms. Allocated memory is still 358.6 MB. Free memory was 336.5 MB in the beginning and 335.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 427.89 ms. Allocated memory is still 358.6 MB. Free memory was 335.4 MB in the beginning and 339.9 MB in the end (delta: -4.5 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 827569.64 ms. Allocated memory was 358.6 MB in the beginning and 536.9 MB in the end (delta: 178.3 MB). Free memory was 338.9 MB in the beginning and 203.8 MB in the end (delta: 135.1 MB). Peak memory consumption was 312.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 86]: 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 (1044states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 82]: 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 (1044states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 85]: 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 (1044states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (1044states) and FLOYD_HOARE automaton (currently 9 states, 17 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 21 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 32 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 827433.2ms, OverallIterations: 611, TraceHistogramMax: 2, EmptinessCheckTime: 491.7ms, AutomataDifference: 369858.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 26.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 18970 SDtfs, 42176 SDslu, 104311 SDs, 0 SdLazy, 244318 SolverSat, 5226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 121095.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18599 GetRequests, 7213 SyntacticMatches, 503 SemanticMatches, 10882 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30673 ImplicationChecksByTransitivity, 410411.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1071occurred in iteration=472, InterpolantAutomatonStates: 6493, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 4193.7ms AutomataMinimizationTime, 610 MinimizatonAttempts, 62458 StatesRemovedByMinimization, 609 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2379.6ms SsaConstructionTime, 6278.6ms SatisfiabilityAnalysisTime, 322719.9ms InterpolantComputationTime, 19668 NumberOfCodeBlocks, 19668 NumberOfCodeBlocksAsserted, 1620 NumberOfCheckSat, 18526 ConstructedInterpolants, 493 QuantifiedInterpolants, 413403 SizeOfPredicates, 4686 NumberOfNonLiveVariables, 39616 ConjunctsInSsa, 10708 ConjunctsInUnsatCore, 1142 InterpolantComputations, 80 PerfectInterpolantSequences, 567/4406 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