/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2abb09bbbae98a04ae2fcc735832bfdba44f6fbc-2abb09b [2021-06-05 23:21:31,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 23:21:31,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 23:21:31,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 23:21:31,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 23:21:31,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 23:21:31,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 23:21:31,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 23:21:31,826 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 23:21:31,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 23:21:31,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 23:21:31,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 23:21:31,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 23:21:31,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 23:21:31,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 23:21:31,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 23:21:31,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 23:21:31,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 23:21:31,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 23:21:31,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 23:21:31,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 23:21:31,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 23:21:31,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 23:21:31,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 23:21:31,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 23:21:31,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 23:21:31,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 23:21:31,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 23:21:31,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 23:21:31,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 23:21:31,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 23:21:31,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 23:21:31,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 23:21:31,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 23:21:31,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 23:21:31,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 23:21:31,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 23:21:31,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 23:21:31,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 23:21:31,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 23:21:31,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 23:21:31,860 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-05 23:21:31,875 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 23:21:31,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 23:21:31,876 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 23:21:31,876 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 23:21:31,877 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 23:21:31,877 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 23:21:31,878 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 23:21:31,878 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 23:21:31,878 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 23:21:31,878 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 23:21:31,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 23:21:31,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 23:21:31,879 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 23:21:31,879 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 23:21:31,879 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 23:21:31,879 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 23:21:31,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 23:21:31,879 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 23:21:31,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 23:21:31,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 23:21:31,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 23:21:31,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 23:21:31,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 23:21:31,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 23:21:31,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 23:21:31,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 23:21:31,880 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 23:21:31,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 23:21:31,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 23:21:31,880 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 23:21:31,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 23:21:31,880 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 23:21:32,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 23:21:32,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 23:21:32,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 23:21:32,143 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-05 23:21:32,144 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-05 23:21:32,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl [2021-06-05 23:21:32,145 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl' [2021-06-05 23:21:32,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 23:21:32,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-05 23:21:32,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 23:21:32,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 23:21:32,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 23:21:32,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 11:21:32" (1/1) ... [2021-06-05 23:21:32,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 11:21:32" (1/1) ... [2021-06-05 23:21:32,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 23:21:32,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 23:21:32,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 23:21:32,183 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 23:21:32,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 11:21:32" (1/1) ... [2021-06-05 23:21:32,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 11:21:32" (1/1) ... [2021-06-05 23:21:32,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 11:21:32" (1/1) ... [2021-06-05 23:21:32,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 11:21:32" (1/1) ... [2021-06-05 23:21:32,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 11:21:32" (1/1) ... [2021-06-05 23:21:32,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 11:21:32" (1/1) ... [2021-06-05 23:21:32,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 11:21:32" (1/1) ... [2021-06-05 23:21:32,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 23:21:32,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 23:21:32,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 23:21:32,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 23:21:32,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 11:21:32" (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 23:21:32,250 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-06-05 23:21:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-06-05 23:21:32,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-06-05 23:21:32,250 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-06-05 23:21:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-06-05 23:21:32,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-06-05 23:21:32,250 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-05 23:21:32,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 23:21:32,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 23:21:32,251 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-06-05 23:21:32,251 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-06-05 23:21:32,252 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-06-05 23:21:32,252 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 23:21:32,412 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 23:21:32,412 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-06-05 23:21:32,413 INFO L202 PluginConnector]: Adding new model three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 11:21:32 BoogieIcfgContainer [2021-06-05 23:21:32,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 23:21:32,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 23:21:32,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 23:21:32,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 23:21:32,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.06 11:21:32" (1/2) ... [2021-06-05 23:21:32,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85b2d60 and model type three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 11:21:32, skipping insertion in model container [2021-06-05 23:21:32,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 11:21:32" (2/2) ... [2021-06-05 23:21:32,418 INFO L111 eAbstractionObserver]: Analyzing ICFG three-array-sum.wvr.bpl [2021-06-05 23:21:32,421 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 23:21:32,421 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 23:21:32,422 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 23:21:32,422 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 23:21:32,460 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-06-05 23:21:32,473 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 23:21:32,486 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 23:21:32,486 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 23:21:32,486 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 23:21:32,486 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 23:21:32,486 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 23:21:32,486 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 23:21:32,486 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 23:21:32,486 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-05 23:21:32,492 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 29 transitions, 82 flow [2021-06-05 23:21:32,510 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 133 states, 131 states have (on average 3.015267175572519) 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 23:21:32,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 131 states have (on average 3.015267175572519) 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 23:21:32,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-06-05 23:21:32,532 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:32,533 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:32,533 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:32,537 INFO L82 PathProgramCache]: Analyzing trace with hash 462888317, now seen corresponding path program 1 times [2021-06-05 23:21:32,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:32,542 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335581808] [2021-06-05 23:21:32,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:32,759 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 23:21:32,759 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:32,760 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335581808] [2021-06-05 23:21:32,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335581808] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 23:21:32,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 23:21:32,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 23:21:32,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142384584] [2021-06-05 23:21:32,764 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 23:21:32,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:32,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 23:21:32,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 23:21:32,779 INFO L87 Difference]: Start difference. First operand has 133 states, 131 states have (on average 3.015267175572519) 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) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:32,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:32,818 INFO L93 Difference]: Finished difference Result 257 states and 781 transitions. [2021-06-05 23:21:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 23:21:32,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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 23:21:32,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:32,832 INFO L225 Difference]: With dead ends: 257 [2021-06-05 23:21:32,832 INFO L226 Difference]: Without dead ends: 230 [2021-06-05 23:21:32,833 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 23:21:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-06-05 23:21:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 188. [2021-06-05 23:21:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 3.0802139037433154) internal successors, (576), 187 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 576 transitions. [2021-06-05 23:21:32,891 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 576 transitions. Word has length 16 [2021-06-05 23:21:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:32,892 INFO L482 AbstractCegarLoop]: Abstraction has 188 states and 576 transitions. [2021-06-05 23:21:32,892 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 576 transitions. [2021-06-05 23:21:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 23:21:32,894 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:32,894 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:32,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 23:21:32,894 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:32,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1780859517, now seen corresponding path program 1 times [2021-06-05 23:21:32,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:32,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505467352] [2021-06-05 23:21:32,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:32,937 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:32,937 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505467352] [2021-06-05 23:21:32,937 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505467352] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 23:21:32,937 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 23:21:32,937 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 23:21:32,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836886467] [2021-06-05 23:21:32,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 23:21:32,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:32,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 23:21:32,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 23:21:32,939 INFO L87 Difference]: Start difference. First operand 188 states and 576 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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 23:21:32,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:32,976 INFO L93 Difference]: Finished difference Result 355 states and 1087 transitions. [2021-06-05 23:21:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 23:21:32,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 23:21:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:32,982 INFO L225 Difference]: With dead ends: 355 [2021-06-05 23:21:32,982 INFO L226 Difference]: Without dead ends: 355 [2021-06-05 23:21:32,983 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-05 23:21:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-06-05 23:21:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 213. [2021-06-05 23:21:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 3.1792452830188678) internal successors, (674), 212 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 674 transitions. [2021-06-05 23:21:33,003 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 674 transitions. Word has length 18 [2021-06-05 23:21:33,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:33,003 INFO L482 AbstractCegarLoop]: Abstraction has 213 states and 674 transitions. [2021-06-05 23:21:33,003 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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 23:21:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 674 transitions. [2021-06-05 23:21:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 23:21:33,004 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:33,004 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:33,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 23:21:33,005 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:33,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2008080897, now seen corresponding path program 2 times [2021-06-05 23:21:33,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:33,006 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597896842] [2021-06-05 23:21:33,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:33,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:33,035 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597896842] [2021-06-05 23:21:33,036 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597896842] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 23:21:33,036 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 23:21:33,036 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 23:21:33,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859431216] [2021-06-05 23:21:33,037 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 23:21:33,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:33,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 23:21:33,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 23:21:33,040 INFO L87 Difference]: Start difference. First operand 213 states and 674 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 23:21:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:33,093 INFO L93 Difference]: Finished difference Result 450 states and 1348 transitions. [2021-06-05 23:21:33,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 23:21:33,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 23:21:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:33,097 INFO L225 Difference]: With dead ends: 450 [2021-06-05 23:21:33,099 INFO L226 Difference]: Without dead ends: 450 [2021-06-05 23:21:33,100 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 23:21:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-06-05 23:21:33,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 235. [2021-06-05 23:21:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 3.1837606837606836) internal successors, (745), 234 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 745 transitions. [2021-06-05 23:21:33,118 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 745 transitions. Word has length 18 [2021-06-05 23:21:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:33,119 INFO L482 AbstractCegarLoop]: Abstraction has 235 states and 745 transitions. [2021-06-05 23:21:33,119 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 23:21:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 745 transitions. [2021-06-05 23:21:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-06-05 23:21:33,121 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:33,121 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:33,122 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 23:21:33,122 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:33,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:33,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1920787651, now seen corresponding path program 3 times [2021-06-05 23:21:33,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:33,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764417514] [2021-06-05 23:21:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:33,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:33,158 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:33,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764417514] [2021-06-05 23:21:33,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764417514] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 23:21:33,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 23:21:33,158 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 23:21:33,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670213098] [2021-06-05 23:21:33,159 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 23:21:33,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:33,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 23:21:33,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 23:21:33,161 INFO L87 Difference]: Start difference. First operand 235 states and 745 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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 23:21:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:33,197 INFO L93 Difference]: Finished difference Result 349 states and 1037 transitions. [2021-06-05 23:21:33,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 23:21:33,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-06-05 23:21:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:33,199 INFO L225 Difference]: With dead ends: 349 [2021-06-05 23:21:33,199 INFO L226 Difference]: Without dead ends: 345 [2021-06-05 23:21:33,200 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 23:21:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-06-05 23:21:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 274. [2021-06-05 23:21:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 3.128205128205128) internal successors, (854), 273 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 854 transitions. [2021-06-05 23:21:33,210 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 854 transitions. Word has length 18 [2021-06-05 23:21:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:33,210 INFO L482 AbstractCegarLoop]: Abstraction has 274 states and 854 transitions. [2021-06-05 23:21:33,210 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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 23:21:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 854 transitions. [2021-06-05 23:21:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 23:21:33,211 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:33,211 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:33,212 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 23:21:33,212 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1827512345, now seen corresponding path program 1 times [2021-06-05 23:21:33,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:33,212 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726366018] [2021-06-05 23:21:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:33,244 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:33,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726366018] [2021-06-05 23:21:33,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726366018] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 23:21:33,245 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 23:21:33,245 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 23:21:33,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106009164] [2021-06-05 23:21:33,245 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 23:21:33,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:33,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 23:21:33,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 23:21:33,246 INFO L87 Difference]: Start difference. First operand 274 states and 854 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:33,327 INFO L93 Difference]: Finished difference Result 345 states and 1038 transitions. [2021-06-05 23:21:33,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-05 23:21:33,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 23:21:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:33,332 INFO L225 Difference]: With dead ends: 345 [2021-06-05 23:21:33,332 INFO L226 Difference]: Without dead ends: 307 [2021-06-05 23:21:33,333 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 23:21:33,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-06-05 23:21:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 276. [2021-06-05 23:21:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 3.036363636363636) internal successors, (835), 275 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 835 transitions. [2021-06-05 23:21:33,339 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 835 transitions. Word has length 19 [2021-06-05 23:21:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:33,339 INFO L482 AbstractCegarLoop]: Abstraction has 276 states and 835 transitions. [2021-06-05 23:21:33,339 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 835 transitions. [2021-06-05 23:21:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-06-05 23:21:33,340 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:33,340 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:33,340 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 23:21:33,341 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:33,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:33,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1166540627, now seen corresponding path program 2 times [2021-06-05 23:21:33,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:33,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076235116] [2021-06-05 23:21:33,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:33,370 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:33,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076235116] [2021-06-05 23:21:33,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076235116] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 23:21:33,373 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 23:21:33,373 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 23:21:33,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207951412] [2021-06-05 23:21:33,373 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 23:21:33,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 23:21:33,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 23:21:33,374 INFO L87 Difference]: Start difference. First operand 276 states and 835 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:33,383 INFO L93 Difference]: Finished difference Result 257 states and 747 transitions. [2021-06-05 23:21:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 23:21:33,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-06-05 23:21:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:33,385 INFO L225 Difference]: With dead ends: 257 [2021-06-05 23:21:33,385 INFO L226 Difference]: Without dead ends: 241 [2021-06-05 23:21:33,385 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 23:21:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-06-05 23:21:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 231. [2021-06-05 23:21:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 3.017391304347826) internal successors, (694), 230 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 694 transitions. [2021-06-05 23:21:33,391 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 694 transitions. Word has length 19 [2021-06-05 23:21:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:33,391 INFO L482 AbstractCegarLoop]: Abstraction has 231 states and 694 transitions. [2021-06-05 23:21:33,391 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 694 transitions. [2021-06-05 23:21:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-06-05 23:21:33,392 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:33,392 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:33,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 23:21:33,392 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:33,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1889778531, now seen corresponding path program 1 times [2021-06-05 23:21:33,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:33,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518521224] [2021-06-05 23:21:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:33,429 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 23:21:33,429 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:33,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518521224] [2021-06-05 23:21:33,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518521224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:33,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039438423] [2021-06-05 23:21:33,429 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 23:21:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:33,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-05 23:21:33,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:33,548 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 23:21:33,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039438423] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:33,548 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:33,548 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 5 [2021-06-05 23:21:33,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145586704] [2021-06-05 23:21:33,549 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 23:21:33,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:33,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 23:21:33,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-05 23:21:33,549 INFO L87 Difference]: Start difference. First operand 231 states and 694 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:33,599 INFO L93 Difference]: Finished difference Result 295 states and 908 transitions. [2021-06-05 23:21:33,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 23:21:33,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-06-05 23:21:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:33,606 INFO L225 Difference]: With dead ends: 295 [2021-06-05 23:21:33,607 INFO L226 Difference]: Without dead ends: 295 [2021-06-05 23:21:33,607 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 41.7ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 23:21:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-06-05 23:21:33,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 203. [2021-06-05 23:21:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 3.0247524752475248) internal successors, (611), 202 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 611 transitions. [2021-06-05 23:21:33,612 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 611 transitions. Word has length 20 [2021-06-05 23:21:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:33,612 INFO L482 AbstractCegarLoop]: Abstraction has 203 states and 611 transitions. [2021-06-05 23:21:33,612 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 611 transitions. [2021-06-05 23:21:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-06-05 23:21:33,613 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:33,613 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:33,825 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 23:21:33,826 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:33,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:33,826 INFO L82 PathProgramCache]: Analyzing trace with hash 795815307, now seen corresponding path program 1 times [2021-06-05 23:21:33,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:33,826 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749165307] [2021-06-05 23:21:33,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:33,883 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 23:21:33,883 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:33,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749165307] [2021-06-05 23:21:33,883 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749165307] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:33,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479397942] [2021-06-05 23:21:33,884 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 23:21:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:33,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2021-06-05 23:21:33,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:33,978 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 23:21:33,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479397942] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:33,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:33,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 5 [2021-06-05 23:21:33,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543598919] [2021-06-05 23:21:33,979 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 23:21:33,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:33,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 23:21:33,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-05 23:21:33,979 INFO L87 Difference]: Start difference. First operand 203 states and 611 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:34,033 INFO L93 Difference]: Finished difference Result 280 states and 853 transitions. [2021-06-05 23:21:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 23:21:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-06-05 23:21:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:34,035 INFO L225 Difference]: With dead ends: 280 [2021-06-05 23:21:34,035 INFO L226 Difference]: Without dead ends: 280 [2021-06-05 23:21:34,035 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 28.7ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 23:21:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-06-05 23:21:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 215. [2021-06-05 23:21:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 3.0233644859813085) internal successors, (647), 214 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 647 transitions. [2021-06-05 23:21:34,040 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 647 transitions. Word has length 21 [2021-06-05 23:21:34,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:34,041 INFO L482 AbstractCegarLoop]: Abstraction has 215 states and 647 transitions. [2021-06-05 23:21:34,041 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:34,041 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 647 transitions. [2021-06-05 23:21:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-06-05 23:21:34,041 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:34,041 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:34,252 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:21:34,253 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:34,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:34,253 INFO L82 PathProgramCache]: Analyzing trace with hash -944430851, now seen corresponding path program 1 times [2021-06-05 23:21:34,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:34,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185849311] [2021-06-05 23:21:34,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:34,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:34,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185849311] [2021-06-05 23:21:34,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185849311] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:34,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769989597] [2021-06-05 23:21:34,334 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 23:21:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:34,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 23:21:34,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:34,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 23:21:34,503 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:34,510 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:34,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-06-05 23:21:34,513 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:34,518 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:34,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-06-05 23:21:34,523 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:34,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:34,529 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:34,529 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2021-06-05 23:21:34,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 13 treesize of output 9 [2021-06-05 23:21:34,564 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:34,565 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:34,567 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:34,567 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:5 [2021-06-05 23:21:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:34,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769989597] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:34,591 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:34,591 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 23:21:34,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284978595] [2021-06-05 23:21:34,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 23:21:34,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 23:21:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 23:21:34,592 INFO L87 Difference]: Start difference. First operand 215 states and 647 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:34,687 INFO L93 Difference]: Finished difference Result 476 states and 1460 transitions. [2021-06-05 23:21:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 23:21:34,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-06-05 23:21:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:34,689 INFO L225 Difference]: With dead ends: 476 [2021-06-05 23:21:34,689 INFO L226 Difference]: Without dead ends: 449 [2021-06-05 23:21:34,690 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 61.1ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 23:21:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-06-05 23:21:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 314. [2021-06-05 23:21:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 3.073482428115016) internal successors, (962), 313 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 962 transitions. [2021-06-05 23:21:34,697 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 962 transitions. Word has length 23 [2021-06-05 23:21:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:34,698 INFO L482 AbstractCegarLoop]: Abstraction has 314 states and 962 transitions. [2021-06-05 23:21:34,699 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 962 transitions. [2021-06-05 23:21:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-06-05 23:21:34,699 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:34,700 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:34,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:21:34,915 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash 444763657, now seen corresponding path program 2 times [2021-06-05 23:21:34,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:34,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17787073] [2021-06-05 23:21:34,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:35,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:35,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:35,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17787073] [2021-06-05 23:21:35,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17787073] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:35,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888340795] [2021-06-05 23:21:35,022 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 23:21:35,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:21:35,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:35,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 23:21:35,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:35,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:21:35,100 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,119 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:35,120 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,120 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2021-06-05 23:21:35,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 23:21:35,150 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,155 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:35,156 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,156 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-06-05 23:21:35,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2021-06-05 23:21:35,182 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:35,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 20 treesize of output 14 [2021-06-05 23:21:35,188 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:35,195 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,196 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:11 [2021-06-05 23:21:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:35,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888340795] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:35,219 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:35,219 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-05 23:21:35,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089244224] [2021-06-05 23:21:35,220 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 23:21:35,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:35,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 23:21:35,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 23:21:35,221 INFO L87 Difference]: Start difference. First operand 314 states and 962 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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 23:21:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:35,273 INFO L93 Difference]: Finished difference Result 517 states and 1600 transitions. [2021-06-05 23:21:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 23:21:35,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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 23 [2021-06-05 23:21:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:35,275 INFO L225 Difference]: With dead ends: 517 [2021-06-05 23:21:35,275 INFO L226 Difference]: Without dead ends: 490 [2021-06-05 23:21:35,275 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 72.1ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 23:21:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-06-05 23:21:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 366. [2021-06-05 23:21:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.084931506849315) internal successors, (1126), 365 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1126 transitions. [2021-06-05 23:21:35,282 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1126 transitions. Word has length 23 [2021-06-05 23:21:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:35,282 INFO L482 AbstractCegarLoop]: Abstraction has 366 states and 1126 transitions. [2021-06-05 23:21:35,282 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 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 23:21:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1126 transitions. [2021-06-05 23:21:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-06-05 23:21:35,285 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:35,285 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:35,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:21:35,503 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:35,503 INFO L82 PathProgramCache]: Analyzing trace with hash -674031635, now seen corresponding path program 3 times [2021-06-05 23:21:35,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:35,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591526835] [2021-06-05 23:21:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:35,556 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:35,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591526835] [2021-06-05 23:21:35,556 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591526835] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:35,556 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900236041] [2021-06-05 23:21:35,556 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 23:21:35,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 23:21:35,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:35,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 23:21:35,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:35,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:21:35,616 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,623 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:35,624 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,624 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2021-06-05 23:21:35,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-06-05 23:21:35,660 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,666 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:35,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 20 treesize of output 16 [2021-06-05 23:21:35,670 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,675 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:35,676 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,676 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2021-06-05 23:21:35,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 13 treesize of output 9 [2021-06-05 23:21:35,696 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:35,697 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:35,699 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:5 [2021-06-05 23:21:35,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 23:21:35,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900236041] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:35,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:35,735 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 23:21:35,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3225107] [2021-06-05 23:21:35,735 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 23:21:35,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:35,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 23:21:35,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 23:21:35,735 INFO L87 Difference]: Start difference. First operand 366 states and 1126 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:35,834 INFO L93 Difference]: Finished difference Result 572 states and 1775 transitions. [2021-06-05 23:21:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 23:21:35,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-06-05 23:21:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:35,837 INFO L225 Difference]: With dead ends: 572 [2021-06-05 23:21:35,837 INFO L226 Difference]: Without dead ends: 545 [2021-06-05 23:21:35,837 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 54.7ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 23:21:35,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-06-05 23:21:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 366. [2021-06-05 23:21:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 3.084931506849315) internal successors, (1126), 365 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1126 transitions. [2021-06-05 23:21:35,844 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1126 transitions. Word has length 23 [2021-06-05 23:21:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:35,844 INFO L482 AbstractCegarLoop]: Abstraction has 366 states and 1126 transitions. [2021-06-05 23:21:35,844 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1126 transitions. [2021-06-05 23:21:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 23:21:35,845 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:35,845 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:36,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-06-05 23:21:36,058 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:36,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2112397989, now seen corresponding path program 4 times [2021-06-05 23:21:36,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:36,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255657464] [2021-06-05 23:21:36,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:36,092 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:36,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255657464] [2021-06-05 23:21:36,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255657464] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:36,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709785982] [2021-06-05 23:21:36,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 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 23:21:36,130 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:21:36,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:36,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 23:21:36,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:36,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709785982] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:36,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:36,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-05 23:21:36,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246099702] [2021-06-05 23:21:36,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 23:21:36,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 23:21:36,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 23:21:36,184 INFO L87 Difference]: Start difference. First operand 366 states and 1126 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 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 23:21:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:36,275 INFO L93 Difference]: Finished difference Result 886 states and 2662 transitions. [2021-06-05 23:21:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 23:21:36,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 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 25 [2021-06-05 23:21:36,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:36,279 INFO L225 Difference]: With dead ends: 886 [2021-06-05 23:21:36,279 INFO L226 Difference]: Without dead ends: 886 [2021-06-05 23:21:36,279 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 44.4ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-06-05 23:21:36,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2021-06-05 23:21:36,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 517. [2021-06-05 23:21:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 3.203488372093023) internal successors, (1653), 516 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1653 transitions. [2021-06-05 23:21:36,291 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1653 transitions. Word has length 25 [2021-06-05 23:21:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:36,292 INFO L482 AbstractCegarLoop]: Abstraction has 517 states and 1653 transitions. [2021-06-05 23:21:36,292 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 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 23:21:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1653 transitions. [2021-06-05 23:21:36,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 23:21:36,293 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:36,294 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:36,512 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:21:36,513 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:36,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:36,513 INFO L82 PathProgramCache]: Analyzing trace with hash -307591603, now seen corresponding path program 5 times [2021-06-05 23:21:36,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:36,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668795237] [2021-06-05 23:21:36,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:36,555 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:36,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668795237] [2021-06-05 23:21:36,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668795237] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:36,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904839229] [2021-06-05 23:21:36,555 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 23:21:36,584 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-05 23:21:36,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:36,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 23:21:36,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:21:36,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904839229] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:36,658 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:36,658 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-06-05 23:21:36,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446042146] [2021-06-05 23:21:36,659 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 23:21:36,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:36,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 23:21:36,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 23:21:36,660 INFO L87 Difference]: Start difference. First operand 517 states and 1653 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:37,436 INFO L93 Difference]: Finished difference Result 1264 states and 3790 transitions. [2021-06-05 23:21:37,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 23:21:37,437 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-06-05 23:21:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:37,442 INFO L225 Difference]: With dead ends: 1264 [2021-06-05 23:21:37,443 INFO L226 Difference]: Without dead ends: 1264 [2021-06-05 23:21:37,443 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 416.3ms TimeCoverageRelationStatistics Valid=389, Invalid=1333, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 23:21:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2021-06-05 23:21:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 771. [2021-06-05 23:21:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 770 states have (on average 3.177922077922078) internal successors, (2447), 770 states have internal predecessors, (2447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 2447 transitions. [2021-06-05 23:21:37,461 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 2447 transitions. Word has length 25 [2021-06-05 23:21:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:37,461 INFO L482 AbstractCegarLoop]: Abstraction has 771 states and 2447 transitions. [2021-06-05 23:21:37,461 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:37,461 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 2447 transitions. [2021-06-05 23:21:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 23:21:37,463 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:37,463 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:37,675 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:21:37,676 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2047516449, now seen corresponding path program 6 times [2021-06-05 23:21:37,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:37,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346766756] [2021-06-05 23:21:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:37,697 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:37,697 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346766756] [2021-06-05 23:21:37,697 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346766756] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:37,697 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378410782] [2021-06-05 23:21:37,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 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 23:21:37,724 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 23:21:37,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:37,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 23:21:37,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:21:37,788 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378410782] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:37,788 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:37,788 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-06-05 23:21:37,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990411633] [2021-06-05 23:21:37,788 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 23:21:37,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:37,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 23:21:37,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 23:21:37,789 INFO L87 Difference]: Start difference. First operand 771 states and 2447 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:38,325 INFO L93 Difference]: Finished difference Result 2477 states and 7775 transitions. [2021-06-05 23:21:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 23:21:38,325 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-06-05 23:21:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:38,334 INFO L225 Difference]: With dead ends: 2477 [2021-06-05 23:21:38,334 INFO L226 Difference]: Without dead ends: 2451 [2021-06-05 23:21:38,335 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 198.7ms TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2021-06-05 23:21:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2021-06-05 23:21:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 1175. [2021-06-05 23:21:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1174 states have (on average 3.4148211243611586) internal successors, (4009), 1174 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 23:21:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 4009 transitions. [2021-06-05 23:21:38,364 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 4009 transitions. Word has length 25 [2021-06-05 23:21:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:38,364 INFO L482 AbstractCegarLoop]: Abstraction has 1175 states and 4009 transitions. [2021-06-05 23:21:38,364 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 4009 transitions. [2021-06-05 23:21:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 23:21:38,366 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:38,366 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:38,580 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-06-05 23:21:38,581 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:38,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:38,581 INFO L82 PathProgramCache]: Analyzing trace with hash 156506377, now seen corresponding path program 7 times [2021-06-05 23:21:38,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:38,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293755940] [2021-06-05 23:21:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:21:38,600 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:38,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293755940] [2021-06-05 23:21:38,600 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293755940] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:38,600 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50421275] [2021-06-05 23:21:38,600 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 23:21:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:38,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 23:21:38,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:38,686 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50421275] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:38,686 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:38,687 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2021-06-05 23:21:38,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214985237] [2021-06-05 23:21:38,687 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 23:21:38,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:38,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 23:21:38,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 23:21:38,687 INFO L87 Difference]: Start difference. First operand 1175 states and 4009 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:38,921 INFO L93 Difference]: Finished difference Result 4049 states and 12968 transitions. [2021-06-05 23:21:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 23:21:38,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-06-05 23:21:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:38,936 INFO L225 Difference]: With dead ends: 4049 [2021-06-05 23:21:38,936 INFO L226 Difference]: Without dead ends: 4037 [2021-06-05 23:21:38,936 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 85.0ms TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:21:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4037 states. [2021-06-05 23:21:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 1667. [2021-06-05 23:21:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1666 states have (on average 3.5834333733493398) internal successors, (5970), 1666 states have internal predecessors, (5970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:38,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 5970 transitions. [2021-06-05 23:21:38,984 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 5970 transitions. Word has length 25 [2021-06-05 23:21:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:38,984 INFO L482 AbstractCegarLoop]: Abstraction has 1667 states and 5970 transitions. [2021-06-05 23:21:38,984 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 5970 transitions. [2021-06-05 23:21:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 23:21:38,987 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:38,987 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:39,200 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 23:21:39,201 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:39,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:39,201 INFO L82 PathProgramCache]: Analyzing trace with hash 2082329639, now seen corresponding path program 8 times [2021-06-05 23:21:39,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:39,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574526480] [2021-06-05 23:21:39,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:21:39,221 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:39,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574526480] [2021-06-05 23:21:39,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574526480] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:39,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307250337] [2021-06-05 23:21:39,221 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 23:21:39,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:21:39,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:39,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 23:21:39,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:39,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307250337] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:39,312 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:39,312 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 23:21:39,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777220981] [2021-06-05 23:21:39,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 23:21:39,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:39,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 23:21:39,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-05 23:21:39,313 INFO L87 Difference]: Start difference. First operand 1667 states and 5970 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:39,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:39,541 INFO L93 Difference]: Finished difference Result 4301 states and 14736 transitions. [2021-06-05 23:21:39,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 23:21:39,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-06-05 23:21:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:39,556 INFO L225 Difference]: With dead ends: 4301 [2021-06-05 23:21:39,556 INFO L226 Difference]: Without dead ends: 4283 [2021-06-05 23:21:39,556 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 87.7ms TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:21:39,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4283 states. [2021-06-05 23:21:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4283 to 2105. [2021-06-05 23:21:39,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 2104 states have (on average 3.7243346007604563) internal successors, (7836), 2104 states have internal predecessors, (7836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:39,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 7836 transitions. [2021-06-05 23:21:39,615 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 7836 transitions. Word has length 25 [2021-06-05 23:21:39,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:39,616 INFO L482 AbstractCegarLoop]: Abstraction has 2105 states and 7836 transitions. [2021-06-05 23:21:39,616 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 7836 transitions. [2021-06-05 23:21:39,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 23:21:39,620 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:39,620 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:39,836 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-06-05 23:21:39,836 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:39,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:39,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1027156865, now seen corresponding path program 9 times [2021-06-05 23:21:39,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:39,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650140241] [2021-06-05 23:21:39,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:39,862 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:39,862 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650140241] [2021-06-05 23:21:39,863 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650140241] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:39,863 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496816460] [2021-06-05 23:21:39,863 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 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 23:21:39,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 23:21:39,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:39,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 23:21:39,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:39,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 23:21:39,940 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496816460] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:39,940 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:39,940 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-06-05 23:21:39,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865476711] [2021-06-05 23:21:39,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 23:21:39,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:39,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 23:21:39,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-06-05 23:21:39,941 INFO L87 Difference]: Start difference. First operand 2105 states and 7836 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:40,417 INFO L93 Difference]: Finished difference Result 5231 states and 17596 transitions. [2021-06-05 23:21:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 23:21:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-06-05 23:21:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:40,428 INFO L225 Difference]: With dead ends: 5231 [2021-06-05 23:21:40,428 INFO L226 Difference]: Without dead ends: 5183 [2021-06-05 23:21:40,429 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 228.7ms TimeCoverageRelationStatistics Valid=312, Invalid=1020, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 23:21:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2021-06-05 23:21:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 2511. [2021-06-05 23:21:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2510 states have (on average 3.7788844621513946) internal successors, (9485), 2510 states have internal predecessors, (9485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:40,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 9485 transitions. [2021-06-05 23:21:40,518 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 9485 transitions. Word has length 25 [2021-06-05 23:21:40,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:40,518 INFO L482 AbstractCegarLoop]: Abstraction has 2511 states and 9485 transitions. [2021-06-05 23:21:40,518 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:40,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 9485 transitions. [2021-06-05 23:21:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 23:21:40,523 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:40,523 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:40,739 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-06-05 23:21:40,740 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:40,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:40,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1344251693, now seen corresponding path program 10 times [2021-06-05 23:21:40,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:40,740 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409710689] [2021-06-05 23:21:40,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:21:40,766 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:40,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409710689] [2021-06-05 23:21:40,766 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409710689] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:40,766 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964863572] [2021-06-05 23:21:40,766 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 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 23:21:40,792 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:21:40,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:40,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 23:21:40,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:21:40,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964863572] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:40,831 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:40,831 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-06-05 23:21:40,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991320884] [2021-06-05 23:21:40,831 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 23:21:40,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:40,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 23:21:40,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 23:21:40,832 INFO L87 Difference]: Start difference. First operand 2511 states and 9485 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:40,927 INFO L93 Difference]: Finished difference Result 4562 states and 16827 transitions. [2021-06-05 23:21:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 23:21:40,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-06-05 23:21:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:40,937 INFO L225 Difference]: With dead ends: 4562 [2021-06-05 23:21:40,937 INFO L226 Difference]: Without dead ends: 4178 [2021-06-05 23:21:40,937 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 27.2ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 23:21:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2021-06-05 23:21:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 3687. [2021-06-05 23:21:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3686 states have (on average 3.8027672273467172) internal successors, (14017), 3686 states have internal predecessors, (14017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 14017 transitions. [2021-06-05 23:21:41,008 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 14017 transitions. Word has length 26 [2021-06-05 23:21:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:41,009 INFO L482 AbstractCegarLoop]: Abstraction has 3687 states and 14017 transitions. [2021-06-05 23:21:41,009 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 14017 transitions. [2021-06-05 23:21:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 23:21:41,015 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:41,015 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:41,224 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-05 23:21:41,225 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:41,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1428029849, now seen corresponding path program 11 times [2021-06-05 23:21:41,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:41,225 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656159450] [2021-06-05 23:21:41,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:41,255 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:41,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656159450] [2021-06-05 23:21:41,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656159450] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:41,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027621411] [2021-06-05 23:21:41,255 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 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 23:21:41,282 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-05 23:21:41,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:41,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 23:21:41,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:41,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027621411] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:41,311 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:41,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2021-06-05 23:21:41,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708140093] [2021-06-05 23:21:41,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 23:21:41,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 23:21:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 23:21:41,312 INFO L87 Difference]: Start difference. First operand 3687 states and 14017 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:41,420 INFO L93 Difference]: Finished difference Result 7909 states and 29810 transitions. [2021-06-05 23:21:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 23:21:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-06-05 23:21:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:41,437 INFO L225 Difference]: With dead ends: 7909 [2021-06-05 23:21:41,437 INFO L226 Difference]: Without dead ends: 7742 [2021-06-05 23:21:41,437 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 27.7ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 23:21:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7742 states. [2021-06-05 23:21:41,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7742 to 6781. [2021-06-05 23:21:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6781 states, 6780 states have (on average 3.888938053097345) internal successors, (26367), 6780 states have internal predecessors, (26367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6781 states to 6781 states and 26367 transitions. [2021-06-05 23:21:41,641 INFO L78 Accepts]: Start accepts. Automaton has 6781 states and 26367 transitions. Word has length 26 [2021-06-05 23:21:41,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:41,641 INFO L482 AbstractCegarLoop]: Abstraction has 6781 states and 26367 transitions. [2021-06-05 23:21:41,641 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 6781 states and 26367 transitions. [2021-06-05 23:21:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 23:21:41,651 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:41,651 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:41,861 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:21:41,862 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:41,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1734973483, now seen corresponding path program 12 times [2021-06-05 23:21:41,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:41,862 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333922820] [2021-06-05 23:21:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:21:41,883 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:41,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333922820] [2021-06-05 23:21:41,883 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333922820] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:41,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268670314] [2021-06-05 23:21:41,883 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 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 23:21:41,908 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 23:21:41,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:41,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 23:21:41,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:41,958 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 23:21:41,959 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268670314] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:41,959 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:41,959 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-06-05 23:21:41,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878096408] [2021-06-05 23:21:41,959 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 23:21:41,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:41,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 23:21:41,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 23:21:41,960 INFO L87 Difference]: Start difference. First operand 6781 states and 26367 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:42,416 INFO L93 Difference]: Finished difference Result 8978 states and 32104 transitions. [2021-06-05 23:21:42,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 23:21:42,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-06-05 23:21:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:42,433 INFO L225 Difference]: With dead ends: 8978 [2021-06-05 23:21:42,433 INFO L226 Difference]: Without dead ends: 8940 [2021-06-05 23:21:42,433 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 236.6ms TimeCoverageRelationStatistics Valid=372, Invalid=1110, Unknown=0, NotChecked=0, Total=1482 [2021-06-05 23:21:42,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8940 states. [2021-06-05 23:21:42,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8940 to 6164. [2021-06-05 23:21:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6164 states, 6163 states have (on average 3.8249229271458707) internal successors, (23573), 6163 states have internal predecessors, (23573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6164 states to 6164 states and 23573 transitions. [2021-06-05 23:21:42,603 INFO L78 Accepts]: Start accepts. Automaton has 6164 states and 23573 transitions. Word has length 26 [2021-06-05 23:21:42,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:42,603 INFO L482 AbstractCegarLoop]: Abstraction has 6164 states and 23573 transitions. [2021-06-05 23:21:42,604 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6164 states and 23573 transitions. [2021-06-05 23:21:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-06-05 23:21:42,614 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:42,614 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:42,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:21:42,832 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:42,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:42,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1999834593, now seen corresponding path program 13 times [2021-06-05 23:21:42,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:42,832 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864608975] [2021-06-05 23:21:42,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:21:42,852 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:42,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864608975] [2021-06-05 23:21:42,852 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864608975] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:42,852 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104961127] [2021-06-05 23:21:42,852 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:21:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:42,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 23:21:42,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:21:42,918 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104961127] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:42,918 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:42,918 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-06-05 23:21:42,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951084441] [2021-06-05 23:21:42,919 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 23:21:42,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:42,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 23:21:42,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-05 23:21:42,919 INFO L87 Difference]: Start difference. First operand 6164 states and 23573 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:43,008 INFO L93 Difference]: Finished difference Result 9044 states and 33591 transitions. [2021-06-05 23:21:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 23:21:43,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-06-05 23:21:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:43,024 INFO L225 Difference]: With dead ends: 9044 [2021-06-05 23:21:43,025 INFO L226 Difference]: Without dead ends: 8684 [2021-06-05 23:21:43,025 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 35.5ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-05 23:21:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8684 states. [2021-06-05 23:21:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8684 to 7878. [2021-06-05 23:21:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7878 states, 7877 states have (on average 3.693665100926749) internal successors, (29095), 7877 states have internal predecessors, (29095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 29095 transitions. [2021-06-05 23:21:43,158 INFO L78 Accepts]: Start accepts. Automaton has 7878 states and 29095 transitions. Word has length 28 [2021-06-05 23:21:43,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:43,158 INFO L482 AbstractCegarLoop]: Abstraction has 7878 states and 29095 transitions. [2021-06-05 23:21:43,159 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 7878 states and 29095 transitions. [2021-06-05 23:21:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-06-05 23:21:43,170 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:43,170 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:43,386 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-05 23:21:43,386 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:43,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:43,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1894101357, now seen corresponding path program 14 times [2021-06-05 23:21:43,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:43,386 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423295644] [2021-06-05 23:21:43,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:21:43,474 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:43,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423295644] [2021-06-05 23:21:43,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423295644] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:43,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266595355] [2021-06-05 23:21:43,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:21:43,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:21:43,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:43,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2021-06-05 23:21:43,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:21:43,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266595355] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:43,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:43,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-06-05 23:21:43,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962516569] [2021-06-05 23:21:43,592 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 23:21:43,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:43,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 23:21:43,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-06-05 23:21:43,593 INFO L87 Difference]: Start difference. First operand 7878 states and 29095 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:43,958 INFO L93 Difference]: Finished difference Result 13810 states and 49396 transitions. [2021-06-05 23:21:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 23:21:43,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-06-05 23:21:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:43,985 INFO L225 Difference]: With dead ends: 13810 [2021-06-05 23:21:43,985 INFO L226 Difference]: Without dead ends: 13666 [2021-06-05 23:21:43,985 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 173.2ms TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2021-06-05 23:21:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13666 states. [2021-06-05 23:21:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13666 to 12279. [2021-06-05 23:21:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12279 states, 12278 states have (on average 3.6391920508226097) internal successors, (44682), 12278 states have internal predecessors, (44682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12279 states to 12279 states and 44682 transitions. [2021-06-05 23:21:44,232 INFO L78 Accepts]: Start accepts. Automaton has 12279 states and 44682 transitions. Word has length 28 [2021-06-05 23:21:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:44,232 INFO L482 AbstractCegarLoop]: Abstraction has 12279 states and 44682 transitions. [2021-06-05 23:21:44,232 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 12279 states and 44682 transitions. [2021-06-05 23:21:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:21:44,251 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:44,251 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:44,465 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:21:44,465 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash -946031339, now seen corresponding path program 15 times [2021-06-05 23:21:44,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:44,465 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947937901] [2021-06-05 23:21:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:44,717 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:44,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947937901] [2021-06-05 23:21:44,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947937901] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:44,718 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214669312] [2021-06-05 23:21:44,718 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 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 23:21:44,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 23:21:44,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:44,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 23:21:44,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:44,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:21:44,877 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:44,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:44,888 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:44,888 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:47 [2021-06-05 23:21:44,993 INFO L446 ElimStorePlain]: Different costs {1=[v_C_14], 2=[A, B]} [2021-06-05 23:21:45,005 INFO L354 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2021-06-05 23:21:45,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:21:45,007 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:45,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:45,032 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-06-05 23:21:45,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 30 [2021-06-05 23:21:45,033 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:21:45,044 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:45,126 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:45,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 37 [2021-06-05 23:21:45,159 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2021-06-05 23:21:45,176 INFO L628 ElimStorePlain]: treesize reduction 27, result has 53.4 percent of original size [2021-06-05 23:21:45,185 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:21:45,185 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:31 [2021-06-05 23:21:45,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:21:45,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:21:45,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 23:21:45,391 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:45,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:45,395 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:45,395 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:5 [2021-06-05 23:21:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:45,412 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214669312] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:45,413 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:45,413 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 23:21:45,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400858315] [2021-06-05 23:21:45,413 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:21:45,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:45,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:21:45,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:21:45,413 INFO L87 Difference]: Start difference. First operand 12279 states and 44682 transitions. Second operand has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:46,984 INFO L93 Difference]: Finished difference Result 19477 states and 69650 transitions. [2021-06-05 23:21:46,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 23:21:46,985 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:21:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:47,021 INFO L225 Difference]: With dead ends: 19477 [2021-06-05 23:21:47,021 INFO L226 Difference]: Without dead ends: 19400 [2021-06-05 23:21:47,022 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1214.6ms TimeCoverageRelationStatistics Valid=231, Invalid=1329, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 23:21:47,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19400 states. [2021-06-05 23:21:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19400 to 12579. [2021-06-05 23:21:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12579 states, 12578 states have (on average 3.6326920019080937) internal successors, (45692), 12578 states have internal predecessors, (45692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12579 states to 12579 states and 45692 transitions. [2021-06-05 23:21:47,290 INFO L78 Accepts]: Start accepts. Automaton has 12579 states and 45692 transitions. Word has length 30 [2021-06-05 23:21:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:47,290 INFO L482 AbstractCegarLoop]: Abstraction has 12579 states and 45692 transitions. [2021-06-05 23:21:47,290 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:47,290 INFO L276 IsEmpty]: Start isEmpty. Operand 12579 states and 45692 transitions. [2021-06-05 23:21:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:21:47,307 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:47,307 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:47,520 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-06-05 23:21:47,521 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:47,521 INFO L82 PathProgramCache]: Analyzing trace with hash 237194815, now seen corresponding path program 16 times [2021-06-05 23:21:47,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:47,521 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366187468] [2021-06-05 23:21:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:47,898 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:47,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:47,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366187468] [2021-06-05 23:21:47,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366187468] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:47,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760097507] [2021-06-05 23:21:47,898 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 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 23:21:47,934 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:21:47,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:47,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:21:47,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:48,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:21:48,013 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:48,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:48,022 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:48,022 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:41 [2021-06-05 23:21:48,109 INFO L446 ElimStorePlain]: Different costs {1=[v_C_16], 5=[A, B]} [2021-06-05 23:21:48,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:21:48,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:21:48,117 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:48,127 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:48,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:21:48,130 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:21:48,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 23:21:48,131 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:48,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:48,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:21:48,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:21:48,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2021-06-05 23:21:48,141 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:48,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:48,146 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:48,146 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:54, output treesize:20 [2021-06-05 23:21:48,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:21:48,208 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:48,209 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:48,210 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:48,210 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:5 [2021-06-05 23:21:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:48,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760097507] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:48,233 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:48,233 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2021-06-05 23:21:48,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21720740] [2021-06-05 23:21:48,233 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 23:21:48,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:48,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 23:21:48,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-06-05 23:21:48,234 INFO L87 Difference]: Start difference. First operand 12579 states and 45692 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:49,140 INFO L93 Difference]: Finished difference Result 18700 states and 67364 transitions. [2021-06-05 23:21:49,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 23:21:49,141 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:21:49,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:49,177 INFO L225 Difference]: With dead ends: 18700 [2021-06-05 23:21:49,177 INFO L226 Difference]: Without dead ends: 18673 [2021-06-05 23:21:49,178 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 730.4ms TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:21:49,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18673 states. [2021-06-05 23:21:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18673 to 12554. [2021-06-05 23:21:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12554 states, 12553 states have (on average 3.630606229586553) internal successors, (45575), 12553 states have internal predecessors, (45575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12554 states to 12554 states and 45575 transitions. [2021-06-05 23:21:49,476 INFO L78 Accepts]: Start accepts. Automaton has 12554 states and 45575 transitions. Word has length 30 [2021-06-05 23:21:49,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:49,476 INFO L482 AbstractCegarLoop]: Abstraction has 12554 states and 45575 transitions. [2021-06-05 23:21:49,476 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 12554 states and 45575 transitions. [2021-06-05 23:21:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:21:49,496 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:49,496 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:49,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-06-05 23:21:49,709 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:49,709 INFO L82 PathProgramCache]: Analyzing trace with hash 86318325, now seen corresponding path program 17 times [2021-06-05 23:21:49,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:49,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388004971] [2021-06-05 23:21:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:49,965 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:49,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388004971] [2021-06-05 23:21:49,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388004971] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:49,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753020503] [2021-06-05 23:21:49,965 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 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 23:21:49,994 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-05 23:21:49,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:49,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 23:21:49,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:50,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:21:50,046 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:50,057 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:50,057 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:50,057 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:43 [2021-06-05 23:21:50,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-06-05 23:21:50,165 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:50,170 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:50,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-06-05 23:21:50,173 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:50,177 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:50,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2021-06-05 23:21:50,179 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:50,183 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:50,184 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:50,184 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:50, output treesize:18 [2021-06-05 23:21:50,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 23:21:50,209 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:50,210 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:50,211 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:50,211 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:5 [2021-06-05 23:21:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:50,243 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753020503] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:50,243 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:50,243 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-06-05 23:21:50,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044034511] [2021-06-05 23:21:50,244 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 23:21:50,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:50,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 23:21:50,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2021-06-05 23:21:50,244 INFO L87 Difference]: Start difference. First operand 12554 states and 45575 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:50,939 INFO L93 Difference]: Finished difference Result 18964 states and 68176 transitions. [2021-06-05 23:21:50,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 23:21:50,940 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:21:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:50,972 INFO L225 Difference]: With dead ends: 18964 [2021-06-05 23:21:50,972 INFO L226 Difference]: Without dead ends: 18829 [2021-06-05 23:21:50,972 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 621.1ms TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2021-06-05 23:21:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18829 states. [2021-06-05 23:21:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18829 to 12568. [2021-06-05 23:21:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12568 states, 12567 states have (on average 3.629983289567916) internal successors, (45618), 12567 states have internal predecessors, (45618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 45618 transitions. [2021-06-05 23:21:51,243 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 45618 transitions. Word has length 30 [2021-06-05 23:21:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:51,243 INFO L482 AbstractCegarLoop]: Abstraction has 12568 states and 45618 transitions. [2021-06-05 23:21:51,243 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 45618 transitions. [2021-06-05 23:21:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:21:51,259 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:51,259 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:51,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-06-05 23:21:51,477 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:51,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:51,477 INFO L82 PathProgramCache]: Analyzing trace with hash -2058545279, now seen corresponding path program 18 times [2021-06-05 23:21:51,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:51,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258259931] [2021-06-05 23:21:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:51,698 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:51,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258259931] [2021-06-05 23:21:51,698 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258259931] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:51,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465124131] [2021-06-05 23:21:51,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 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 23:21:51,726 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-06-05 23:21:51,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:51,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:21:51,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:51,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:21:51,787 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:51,798 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:51,799 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:51,799 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:36 [2021-06-05 23:21:51,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:21:51,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-06-05 23:21:51,857 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:51,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:51,872 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:51,872 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:58 [2021-06-05 23:21:51,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-06-05 23:21:51,910 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:51,916 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:51,916 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:51,916 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:29 [2021-06-05 23:21:51,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 23:21:51,955 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:51,959 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:51,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-06-05 23:21:51,962 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:51,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:51,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:51,963 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:7 [2021-06-05 23:21:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:51,982 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465124131] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:51,982 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:51,982 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 23:21:51,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043690123] [2021-06-05 23:21:51,983 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 23:21:51,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:51,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 23:21:51,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-06-05 23:21:51,983 INFO L87 Difference]: Start difference. First operand 12568 states and 45618 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:52,716 INFO L93 Difference]: Finished difference Result 19016 states and 68403 transitions. [2021-06-05 23:21:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 23:21:52,716 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:21:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:52,749 INFO L225 Difference]: With dead ends: 19016 [2021-06-05 23:21:52,749 INFO L226 Difference]: Without dead ends: 18988 [2021-06-05 23:21:52,749 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 534.6ms TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2021-06-05 23:21:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18988 states. [2021-06-05 23:21:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18988 to 12589. [2021-06-05 23:21:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12589 states, 12588 states have (on average 3.6296472831267876) internal successors, (45690), 12588 states have internal predecessors, (45690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12589 states to 12589 states and 45690 transitions. [2021-06-05 23:21:52,962 INFO L78 Accepts]: Start accepts. Automaton has 12589 states and 45690 transitions. Word has length 30 [2021-06-05 23:21:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:52,963 INFO L482 AbstractCegarLoop]: Abstraction has 12589 states and 45690 transitions. [2021-06-05 23:21:52,963 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 12589 states and 45690 transitions. [2021-06-05 23:21:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:21:52,977 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:52,977 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:53,177 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-06-05 23:21:53,178 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:53,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:53,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1117626725, now seen corresponding path program 19 times [2021-06-05 23:21:53,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:53,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361808242] [2021-06-05 23:21:53,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:53,395 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:53,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361808242] [2021-06-05 23:21:53,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361808242] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:53,395 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527944682] [2021-06-05 23:21:53,395 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:21:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:53,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:21:53,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:53,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:21:53,461 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:53,470 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:53,470 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:53,471 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2021-06-05 23:21:53,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:21:53,533 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:53,543 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:53,544 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:53,544 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:48 [2021-06-05 23:21:53,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 23:21:53,580 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:53,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:53,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 23:21:53,588 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:53,592 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:53,592 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:53,592 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:20 [2021-06-05 23:21:53,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:21:53,610 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:53,611 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:53,612 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:53,612 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:5 [2021-06-05 23:21:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:53,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527944682] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:53,630 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:53,630 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2021-06-05 23:21:53,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728015986] [2021-06-05 23:21:53,631 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 23:21:53,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:53,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 23:21:53,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-06-05 23:21:53,631 INFO L87 Difference]: Start difference. First operand 12589 states and 45690 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:54,317 INFO L93 Difference]: Finished difference Result 19083 states and 68572 transitions. [2021-06-05 23:21:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 23:21:54,317 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:21:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:54,354 INFO L225 Difference]: With dead ends: 19083 [2021-06-05 23:21:54,354 INFO L226 Difference]: Without dead ends: 18996 [2021-06-05 23:21:54,354 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 482.0ms TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2021-06-05 23:21:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18996 states. [2021-06-05 23:21:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18996 to 12601. [2021-06-05 23:21:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12601 states, 12600 states have (on average 3.628968253968254) internal successors, (45725), 12600 states have internal predecessors, (45725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12601 states to 12601 states and 45725 transitions. [2021-06-05 23:21:54,624 INFO L78 Accepts]: Start accepts. Automaton has 12601 states and 45725 transitions. Word has length 30 [2021-06-05 23:21:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:54,624 INFO L482 AbstractCegarLoop]: Abstraction has 12601 states and 45725 transitions. [2021-06-05 23:21:54,624 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 12601 states and 45725 transitions. [2021-06-05 23:21:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:21:54,640 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:54,640 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:54,840 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-06-05 23:21:54,840 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1872555743, now seen corresponding path program 20 times [2021-06-05 23:21:54,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:54,841 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533243607] [2021-06-05 23:21:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:55,052 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:55,052 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533243607] [2021-06-05 23:21:55,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533243607] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:55,052 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462736822] [2021-06-05 23:21:55,052 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 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 23:21:55,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:21:55,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:55,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 23:21:55,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:55,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:21:55,156 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:55,167 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:55,168 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:55,168 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:43 [2021-06-05 23:21:55,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-06-05 23:21:55,260 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:55,267 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:55,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-06-05 23:21:55,271 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:55,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:55,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 23:21:55,281 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:55,286 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:55,286 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:55,286 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:53, output treesize:21 [2021-06-05 23:21:55,327 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:55,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2021-06-05 23:21:55,332 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:21:55,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:55,353 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:55,354 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:53 [2021-06-05 23:21:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:55,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462736822] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:55,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:55,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-06-05 23:21:55,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315369378] [2021-06-05 23:21:55,401 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 23:21:55,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:55,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 23:21:55,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-06-05 23:21:55,402 INFO L87 Difference]: Start difference. First operand 12601 states and 45725 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:55,980 INFO L93 Difference]: Finished difference Result 19076 states and 68581 transitions. [2021-06-05 23:21:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 23:21:55,980 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:21:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:56,014 INFO L225 Difference]: With dead ends: 19076 [2021-06-05 23:21:56,014 INFO L226 Difference]: Without dead ends: 19013 [2021-06-05 23:21:56,014 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 422.2ms TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:21:56,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19013 states. [2021-06-05 23:21:56,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19013 to 12639. [2021-06-05 23:21:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12639 states, 12638 states have (on average 3.627868333597088) internal successors, (45849), 12638 states have internal predecessors, (45849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:56,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12639 states to 12639 states and 45849 transitions. [2021-06-05 23:21:56,229 INFO L78 Accepts]: Start accepts. Automaton has 12639 states and 45849 transitions. Word has length 30 [2021-06-05 23:21:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:56,230 INFO L482 AbstractCegarLoop]: Abstraction has 12639 states and 45849 transitions. [2021-06-05 23:21:56,230 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 12639 states and 45849 transitions. [2021-06-05 23:21:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:21:56,244 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:56,245 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:21:56,453 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:21:56,453 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:21:56,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:21:56,453 INFO L82 PathProgramCache]: Analyzing trace with hash -702398561, now seen corresponding path program 21 times [2021-06-05 23:21:56,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:21:56,453 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127890089] [2021-06-05 23:21:56,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:21:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:21:56,698 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2021-06-05 23:21:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:56,838 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:21:56,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127890089] [2021-06-05 23:21:56,839 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127890089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:56,839 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135092237] [2021-06-05 23:21:56,839 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 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 23:21:56,866 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 23:21:56,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:21:56,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 23:21:56,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:21:56,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:21:56,931 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:56,938 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:56,945 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:21:56,945 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:31 [2021-06-05 23:21:57,038 INFO L446 ElimStorePlain]: Different costs {1=[v_C_26], 5=[A, B]} [2021-06-05 23:21:57,050 INFO L354 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2021-06-05 23:21:57,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 26 [2021-06-05 23:21:57,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:57,063 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:57,075 INFO L354 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2021-06-05 23:21:57,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 32 [2021-06-05 23:21:57,077 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:21:57,091 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:57,100 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:57,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2021-06-05 23:21:57,108 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2021-06-05 23:21:57,128 INFO L628 ElimStorePlain]: treesize reduction 28, result has 52.5 percent of original size [2021-06-05 23:21:57,131 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:21:57,132 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:56, output treesize:31 [2021-06-05 23:21:57,353 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_1], 2=[C]} [2021-06-05 23:21: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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-06-05 23:21:57,357 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:57,369 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:57,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:21:57,372 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:21:57,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:21:57,373 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:21:57,382 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:21:57,384 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 23:21:57,384 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:20 [2021-06-05 23:21:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:21:57,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135092237] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:21:57,427 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:21:57,427 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2021-06-05 23:21:57,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922058664] [2021-06-05 23:21:57,427 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:21:57,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:21:57,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:21:57,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:21:57,427 INFO L87 Difference]: Start difference. First operand 12639 states and 45849 transitions. Second operand has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:21:59,443 INFO L93 Difference]: Finished difference Result 19998 states and 71567 transitions. [2021-06-05 23:21:59,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 23:21:59,444 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:21:59,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:21:59,479 INFO L225 Difference]: With dead ends: 19998 [2021-06-05 23:21:59,480 INFO L226 Difference]: Without dead ends: 19967 [2021-06-05 23:21:59,480 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1682.7ms TimeCoverageRelationStatistics Valid=299, Invalid=1771, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 23:21:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19967 states. [2021-06-05 23:21:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19967 to 12900. [2021-06-05 23:21:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12900 states, 12899 states have (on average 3.6274129777502133) internal successors, (46790), 12899 states have internal predecessors, (46790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12900 states to 12900 states and 46790 transitions. [2021-06-05 23:21:59,775 INFO L78 Accepts]: Start accepts. Automaton has 12900 states and 46790 transitions. Word has length 30 [2021-06-05 23:21:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:21:59,775 INFO L482 AbstractCegarLoop]: Abstraction has 12900 states and 46790 transitions. [2021-06-05 23:21:59,775 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:21:59,775 INFO L276 IsEmpty]: Start isEmpty. Operand 12900 states and 46790 transitions. [2021-06-05 23:21:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:21:59,791 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:21:59,791 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:00,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-06-05 23:22:00,005 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:00,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:00,005 INFO L82 PathProgramCache]: Analyzing trace with hash 867632129, now seen corresponding path program 22 times [2021-06-05 23:22:00,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:00,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879859464] [2021-06-05 23:22:00,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:00,269 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:00,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879859464] [2021-06-05 23:22:00,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879859464] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:00,269 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997969935] [2021-06-05 23:22:00,269 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) [2021-06-05 23:22:00,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:22:00,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:00,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:00,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:00,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:00,339 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:00,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:00,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:00,348 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:36 [2021-06-05 23:22:00,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:00,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:00,382 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:00,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:00,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:00,392 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:48 [2021-06-05 23:22: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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 23:22:00,449 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:00,454 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:00,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:00,454 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:29 [2021-06-05 23:22:00,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 23:22:00,481 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:00,484 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:00,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-06-05 23:22:00,486 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:00,487 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:00,488 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:00,488 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:5 [2021-06-05 23:22:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:00,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997969935] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:00,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:00,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2021-06-05 23:22:00,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86632893] [2021-06-05 23:22:00,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 23:22:00,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:00,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 23:22:00,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-06-05 23:22:00,506 INFO L87 Difference]: Start difference. First operand 12900 states and 46790 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:01,408 INFO L93 Difference]: Finished difference Result 17463 states and 62307 transitions. [2021-06-05 23:22:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 23:22:01,409 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:01,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:01,438 INFO L225 Difference]: With dead ends: 17463 [2021-06-05 23:22:01,438 INFO L226 Difference]: Without dead ends: 17424 [2021-06-05 23:22:01,438 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 621.7ms TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:22:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17424 states. [2021-06-05 23:22:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17424 to 12965. [2021-06-05 23:22:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12965 states, 12964 states have (on average 3.6258870718913916) internal successors, (47006), 12964 states have internal predecessors, (47006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12965 states to 12965 states and 47006 transitions. [2021-06-05 23:22:01,639 INFO L78 Accepts]: Start accepts. Automaton has 12965 states and 47006 transitions. Word has length 30 [2021-06-05 23:22:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:01,639 INFO L482 AbstractCegarLoop]: Abstraction has 12965 states and 47006 transitions. [2021-06-05 23:22:01,639 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12965 states and 47006 transitions. [2021-06-05 23:22:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:01,654 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:01,654 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:01,854 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:01,854 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash -251163163, now seen corresponding path program 23 times [2021-06-05 23:22:01,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:01,855 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230839367] [2021-06-05 23:22:01,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:02,087 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:02,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230839367] [2021-06-05 23:22:02,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230839367] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:02,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662597534] [2021-06-05 23:22:02,087 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 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 23:22:02,116 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-05 23:22:02,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:02,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 23:22:02,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:02,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:02,163 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:02,171 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:02,172 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:02,172 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2021-06-05 23:22:02,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-06-05 23:22:02,246 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:02,257 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:02,257 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:02,257 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:45 [2021-06-05 23:22:02,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 23:22:02,327 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:02,335 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:02,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 23:22:02,338 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:02,345 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:02,345 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:02,346 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:25 [2021-06-05 23:22:02,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:02,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:02,391 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:02,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 39 [2021-06-05 23:22:02,397 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: and 3 xjuncts. [2021-06-05 23:22:02,414 INFO L628 ElimStorePlain]: treesize reduction 23, result has 48.9 percent of original size [2021-06-05 23:22:02,416 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:02,416 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2021-06-05 23:22:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:02,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662597534] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:02,467 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:02,467 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 23:22:02,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032406547] [2021-06-05 23:22:02,467 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:22:02,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:02,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:22:02,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:22:02,467 INFO L87 Difference]: Start difference. First operand 12965 states and 47006 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:04,034 INFO L93 Difference]: Finished difference Result 17500 states and 62338 transitions. [2021-06-05 23:22:04,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 23:22:04,034 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:04,065 INFO L225 Difference]: With dead ends: 17500 [2021-06-05 23:22:04,065 INFO L226 Difference]: Without dead ends: 17417 [2021-06-05 23:22:04,065 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1047.9ms TimeCoverageRelationStatistics Valid=186, Invalid=1296, Unknown=0, NotChecked=0, Total=1482 [2021-06-05 23:22:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17417 states. [2021-06-05 23:22:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17417 to 13000. [2021-06-05 23:22:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13000 states, 12999 states have (on average 3.624201861681668) internal successors, (47111), 12999 states have internal predecessors, (47111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13000 states to 13000 states and 47111 transitions. [2021-06-05 23:22:04,271 INFO L78 Accepts]: Start accepts. Automaton has 13000 states and 47111 transitions. Word has length 30 [2021-06-05 23:22:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:04,271 INFO L482 AbstractCegarLoop]: Abstraction has 13000 states and 47111 transitions. [2021-06-05 23:22:04,271 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 13000 states and 47111 transitions. [2021-06-05 23:22:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:04,286 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:04,286 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:04,492 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2021-06-05 23:22:04,493 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:04,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:04,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2094092255, now seen corresponding path program 24 times [2021-06-05 23:22:04,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:04,493 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716160231] [2021-06-05 23:22:04,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:04,758 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:04,758 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716160231] [2021-06-05 23:22:04,758 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716160231] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:04,758 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074512019] [2021-06-05 23:22:04,758 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 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 23:22:04,785 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 23:22:04,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:04,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 23:22:04,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:04,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:04,835 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:04,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:04,844 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:04,844 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:42 [2021-06-05 23:22:04,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:04,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:04,899 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:04,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:04,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:04,912 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2021-06-05 23:22:04,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:04,951 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:22:04,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 23:22:04,954 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:04,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:04,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:04,969 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:22:04,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2021-06-05 23:22:04,970 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:04,976 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:04,977 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:04,977 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:25 [2021-06-05 23:22:05,035 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:05,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2021-06-05 23:22:05,039 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:22:05,052 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:05,057 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:05,057 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:55 [2021-06-05 23:22:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:05,108 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074512019] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:05,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:05,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2021-06-05 23:22:05,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809075916] [2021-06-05 23:22:05,109 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 23:22:05,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:05,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 23:22:05,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2021-06-05 23:22:05,109 INFO L87 Difference]: Start difference. First operand 13000 states and 47111 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:06,079 INFO L93 Difference]: Finished difference Result 17447 states and 62196 transitions. [2021-06-05 23:22:06,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 23:22:06,079 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:06,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:06,113 INFO L225 Difference]: With dead ends: 17447 [2021-06-05 23:22:06,113 INFO L226 Difference]: Without dead ends: 17414 [2021-06-05 23:22:06,113 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 714.7ms TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2021-06-05 23:22:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17414 states. [2021-06-05 23:22:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17414 to 13030. [2021-06-05 23:22:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13030 states, 13029 states have (on average 3.62452989484995) internal successors, (47224), 13029 states have internal predecessors, (47224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13030 states to 13030 states and 47224 transitions. [2021-06-05 23:22:06,364 INFO L78 Accepts]: Start accepts. Automaton has 13030 states and 47224 transitions. Word has length 30 [2021-06-05 23:22:06,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:06,365 INFO L482 AbstractCegarLoop]: Abstraction has 13030 states and 47224 transitions. [2021-06-05 23:22:06,365 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 13030 states and 47224 transitions. [2021-06-05 23:22:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:06,380 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:06,380 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:06,580 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-06-05 23:22:06,580 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:06,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2003600359, now seen corresponding path program 25 times [2021-06-05 23:22:06,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:06,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992448041] [2021-06-05 23:22:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:06,797 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:06,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992448041] [2021-06-05 23:22:06,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992448041] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:06,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141584991] [2021-06-05 23:22:06,797 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 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 23:22:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:06,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:06,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:06,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:06,884 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:06,894 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:06,895 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:06,895 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:56 [2021-06-05 23:22:07,003 INFO L446 ElimStorePlain]: Different costs {0=[A, B], 2=[v_C_34]} [2021-06-05 23:22:07,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-06-05 23:22:07,007 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:07,013 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:07,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-06-05 23:22:07,018 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:07,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:07,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:22:07,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-06-05 23:22:07,027 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:07,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:07,032 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:07,032 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:52, output treesize:24 [2021-06-05 23:22:07,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:22:07,069 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:07,071 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:07,071 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:07,071 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:5 [2021-06-05 23:22:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:07,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141584991] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:07,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:07,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2021-06-05 23:22:07,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782033525] [2021-06-05 23:22:07,090 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 23:22:07,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:07,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 23:22:07,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-05 23:22:07,091 INFO L87 Difference]: Start difference. First operand 13030 states and 47224 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:08,161 INFO L93 Difference]: Finished difference Result 19697 states and 70632 transitions. [2021-06-05 23:22:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 23:22:08,162 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:08,198 INFO L225 Difference]: With dead ends: 19697 [2021-06-05 23:22:08,198 INFO L226 Difference]: Without dead ends: 19634 [2021-06-05 23:22:08,199 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 922.3ms TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 23:22:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19634 states. [2021-06-05 23:22:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19634 to 13048. [2021-06-05 23:22:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13048 states, 13047 states have (on average 3.621368897064459) internal successors, (47248), 13047 states have internal predecessors, (47248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13048 states to 13048 states and 47248 transitions. [2021-06-05 23:22:08,423 INFO L78 Accepts]: Start accepts. Automaton has 13048 states and 47248 transitions. Word has length 30 [2021-06-05 23:22:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:08,423 INFO L482 AbstractCegarLoop]: Abstraction has 13048 states and 47248 transitions. [2021-06-05 23:22:08,423 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 13048 states and 47248 transitions. [2021-06-05 23:22:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:08,438 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:08,438 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:08,638 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2021-06-05 23:22:08,638 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:08,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:08,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1224465061, now seen corresponding path program 26 times [2021-06-05 23:22:08,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:08,639 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967066583] [2021-06-05 23:22:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:08,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:08,982 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967066583] [2021-06-05 23:22:08,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967066583] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:08,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071414007] [2021-06-05 23:22:08,983 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 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 23:22:09,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:22:09,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:09,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:09,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:09,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:09,061 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:09,084 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:09,085 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:09,085 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:42 [2021-06-05 23:22:09,152 INFO L446 ElimStorePlain]: Different costs {1=[v_C_36], 5=[A, B]} [2021-06-05 23:22:09,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:09,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:09,157 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:09,166 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:09,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:09,173 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:22:09,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2021-06-05 23:22:09,174 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:09,180 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:09,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:09,182 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:22:09,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2021-06-05 23:22:09,184 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:09,188 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:09,188 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:09,188 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:54, output treesize:20 [2021-06-05 23:22:09,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:22:09,240 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:09,241 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:09,245 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:09,245 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:5 [2021-06-05 23:22:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:09,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071414007] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:09,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:09,262 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2021-06-05 23:22:09,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411450566] [2021-06-05 23:22:09,262 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 23:22:09,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:09,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 23:22:09,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-06-05 23:22:09,262 INFO L87 Difference]: Start difference. First operand 13048 states and 47248 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:10,673 INFO L93 Difference]: Finished difference Result 20216 states and 72247 transitions. [2021-06-05 23:22:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 23:22:10,673 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:10,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:10,708 INFO L225 Difference]: With dead ends: 20216 [2021-06-05 23:22:10,708 INFO L226 Difference]: Without dead ends: 20179 [2021-06-05 23:22:10,708 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1164.7ms TimeCoverageRelationStatistics Valid=214, Invalid=1046, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 23:22:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20179 states. [2021-06-05 23:22:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20179 to 13071. [2021-06-05 23:22:10,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13071 states, 13070 states have (on average 3.620734506503443) internal successors, (47323), 13070 states have internal predecessors, (47323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13071 states to 13071 states and 47323 transitions. [2021-06-05 23:22:10,932 INFO L78 Accepts]: Start accepts. Automaton has 13071 states and 47323 transitions. Word has length 30 [2021-06-05 23:22:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:10,932 INFO L482 AbstractCegarLoop]: Abstraction has 13071 states and 47323 transitions. [2021-06-05 23:22:10,932 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 13071 states and 47323 transitions. [2021-06-05 23:22:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:10,947 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:10,947 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:11,149 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:11,149 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:11,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1418556337, now seen corresponding path program 27 times [2021-06-05 23:22:11,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:11,150 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340172178] [2021-06-05 23:22:11,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:11,396 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:11,396 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:11,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340172178] [2021-06-05 23:22:11,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340172178] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:11,396 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745985332] [2021-06-05 23:22:11,396 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 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 23:22:11,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 23:22:11,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:11,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 23:22:11,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:11,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:11,468 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:11,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:11,477 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:11,477 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-06-05 23:22:11,697 INFO L446 ElimStorePlain]: Different costs {0=[v_C_38], 2=[A, B]} [2021-06-05 23:22:11,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:22:11,701 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:11,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:11,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:11,721 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:22:11,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-06-05 23:22:11,722 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:11,732 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:11,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:11,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:22:11,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 23:22:11,736 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:11,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:11,745 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:11,745 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:61, output treesize:24 [2021-06-05 23:22:11,812 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:11,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2021-06-05 23:22:11,814 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:22:11,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:11,834 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:11,834 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:56 [2021-06-05 23:22:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:11,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745985332] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:11,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:11,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2021-06-05 23:22:11,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454562824] [2021-06-05 23:22:11,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 23:22:11,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:11,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 23:22:11,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-06-05 23:22:11,895 INFO L87 Difference]: Start difference. First operand 13071 states and 47323 transitions. Second operand has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:14,753 INFO L93 Difference]: Finished difference Result 20182 states and 72102 transitions. [2021-06-05 23:22:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 23:22:14,753 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:14,789 INFO L225 Difference]: With dead ends: 20182 [2021-06-05 23:22:14,789 INFO L226 Difference]: Without dead ends: 20063 [2021-06-05 23:22:14,790 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2176.4ms TimeCoverageRelationStatistics Valid=292, Invalid=1870, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 23:22:14,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20063 states. [2021-06-05 23:22:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20063 to 13091. [2021-06-05 23:22:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13091 states, 13090 states have (on average 3.620550038197097) internal successors, (47393), 13090 states have internal predecessors, (47393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:15,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13091 states to 13091 states and 47393 transitions. [2021-06-05 23:22:15,012 INFO L78 Accepts]: Start accepts. Automaton has 13091 states and 47393 transitions. Word has length 30 [2021-06-05 23:22:15,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:15,012 INFO L482 AbstractCegarLoop]: Abstraction has 13091 states and 47393 transitions. [2021-06-05 23:22:15,012 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 2.5454545454545454) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:15,012 INFO L276 IsEmpty]: Start isEmpty. Operand 13091 states and 47393 transitions. [2021-06-05 23:22:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:15,028 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:15,028 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:15,228 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2021-06-05 23:22:15,228 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:15,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:15,229 INFO L82 PathProgramCache]: Analyzing trace with hash -726307267, now seen corresponding path program 28 times [2021-06-05 23:22:15,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:15,229 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694970798] [2021-06-05 23:22:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:15,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:15,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694970798] [2021-06-05 23:22:15,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694970798] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:15,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885513555] [2021-06-05 23:22:15,349 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 23:22:15,380 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:22:15,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:15,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:15,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:15,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:15,409 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:15,418 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:15,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:15,418 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-06-05 23:22:15,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:15,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2021-06-05 23:22:15,496 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:15,509 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:15,509 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:15,509 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:73 [2021-06-05 23:22:15,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:15,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2021-06-05 23:22:15,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:15,552 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:15,553 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:15,553 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:48 [2021-06-05 23:22:15,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 23:22:15,592 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:15,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:15,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 23:22:15,597 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:15,598 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:15,599 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:15,599 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:5 [2021-06-05 23:22:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:15,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885513555] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:15,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:15,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 23:22:15,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503460488] [2021-06-05 23:22:15,614 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 23:22:15,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:15,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 23:22:15,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:15,615 INFO L87 Difference]: Start difference. First operand 13091 states and 47393 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:15,936 INFO L93 Difference]: Finished difference Result 13664 states and 49172 transitions. [2021-06-05 23:22:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 23:22:15,936 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:15,962 INFO L225 Difference]: With dead ends: 13664 [2021-06-05 23:22:15,962 INFO L226 Difference]: Without dead ends: 13609 [2021-06-05 23:22:15,962 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 213.8ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-06-05 23:22:15,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13609 states. [2021-06-05 23:22:16,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13609 to 13109. [2021-06-05 23:22:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13109 states, 13108 states have (on average 3.6195453158376565) internal successors, (47445), 13108 states have internal predecessors, (47445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13109 states to 13109 states and 47445 transitions. [2021-06-05 23:22:16,162 INFO L78 Accepts]: Start accepts. Automaton has 13109 states and 47445 transitions. Word has length 30 [2021-06-05 23:22:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:16,162 INFO L482 AbstractCegarLoop]: Abstraction has 13109 states and 47445 transitions. [2021-06-05 23:22:16,162 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:16,162 INFO L276 IsEmpty]: Start isEmpty. Operand 13109 states and 47445 transitions. [2021-06-05 23:22:16,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:16,177 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:16,178 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:16,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:16,385 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:16,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:16,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1845102559, now seen corresponding path program 29 times [2021-06-05 23:22:16,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:16,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199015594] [2021-06-05 23:22:16,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:16,486 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:16,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199015594] [2021-06-05 23:22:16,486 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199015594] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:16,486 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623453647] [2021-06-05 23:22:16,486 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 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 23:22:16,515 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 23:22:16,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:16,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 23:22:16,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:16,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:16,544 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:16,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:16,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:16,555 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:41 [2021-06-05 23:22:16,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:16,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2021-06-05 23:22:16,683 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:16,695 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:16,696 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:16,696 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:70 [2021-06-05 23:22:16,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:16,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2021-06-05 23:22:16,737 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:16,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:16,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:16,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2021-06-05 23:22:16,748 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:16,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:16,753 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:16,753 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:29 [2021-06-05 23:22:16,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:22:16,776 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:16,779 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:16,780 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:16,780 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2021-06-05 23:22:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:16,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623453647] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:16,820 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:16,820 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2021-06-05 23:22:16,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140185690] [2021-06-05 23:22:16,820 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 23:22:16,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:16,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 23:22:16,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-06-05 23:22:16,821 INFO L87 Difference]: Start difference. First operand 13109 states and 47445 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:17,335 INFO L93 Difference]: Finished difference Result 13861 states and 49685 transitions. [2021-06-05 23:22:17,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 23:22:17,335 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:17,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:17,360 INFO L225 Difference]: With dead ends: 13861 [2021-06-05 23:22:17,361 INFO L226 Difference]: Without dead ends: 13687 [2021-06-05 23:22:17,361 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 308.2ms TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:22:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13687 states. [2021-06-05 23:22:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13687 to 13097. [2021-06-05 23:22:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13097 states, 13096 states have (on average 3.620494807574832) internal successors, (47414), 13096 states have internal predecessors, (47414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:17,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13097 states to 13097 states and 47414 transitions. [2021-06-05 23:22:17,556 INFO L78 Accepts]: Start accepts. Automaton has 13097 states and 47414 transitions. Word has length 30 [2021-06-05 23:22:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:17,556 INFO L482 AbstractCegarLoop]: Abstraction has 13097 states and 47414 transitions. [2021-06-05 23:22:17,556 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 13097 states and 47414 transitions. [2021-06-05 23:22:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:17,572 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:17,572 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:17,772 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:17,772 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:17,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:17,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1071325629, now seen corresponding path program 30 times [2021-06-05 23:22:17,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:17,773 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377526692] [2021-06-05 23:22:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:17,866 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:17,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377526692] [2021-06-05 23:22:17,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377526692] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:17,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911729797] [2021-06-05 23:22:17,866 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:22:17,895 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 23:22:17,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:17,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:17,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:17,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:17,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:17,936 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:17,937 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:17,937 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-06-05 23:22:17,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:17,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2021-06-05 23:22:17,989 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:18,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:18,000 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:18,000 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:51 [2021-06-05 23:22:18,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:18,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2021-06-05 23:22:18,109 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:18,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:18,116 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:18,116 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:30 [2021-06-05 23:22:18,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 23:22:18,164 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:18,167 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:18,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 23:22:18,169 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:18,170 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:18,170 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:18,170 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:7 [2021-06-05 23:22:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:18,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911729797] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:18,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:18,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 23:22:18,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783130736] [2021-06-05 23:22:18,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 23:22:18,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 23:22:18,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:18,187 INFO L87 Difference]: Start difference. First operand 13097 states and 47414 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:18,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:18,429 INFO L93 Difference]: Finished difference Result 14060 states and 50461 transitions. [2021-06-05 23:22:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 23:22:18,430 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:18,456 INFO L225 Difference]: With dead ends: 14060 [2021-06-05 23:22:18,456 INFO L226 Difference]: Without dead ends: 14032 [2021-06-05 23:22:18,457 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 254.0ms TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14032 states. [2021-06-05 23:22:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14032 to 13135. [2021-06-05 23:22:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13135 states, 13134 states have (on average 3.6185472818638647) internal successors, (47526), 13134 states have internal predecessors, (47526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13135 states to 13135 states and 47526 transitions. [2021-06-05 23:22:18,643 INFO L78 Accepts]: Start accepts. Automaton has 13135 states and 47526 transitions. Word has length 30 [2021-06-05 23:22:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:18,643 INFO L482 AbstractCegarLoop]: Abstraction has 13135 states and 47526 transitions. [2021-06-05 23:22:18,643 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:18,643 INFO L276 IsEmpty]: Start isEmpty. Operand 13135 states and 47526 transitions. [2021-06-05 23:22:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:18,658 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:18,658 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:18,858 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2021-06-05 23:22:18,858 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:18,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:18,859 INFO L82 PathProgramCache]: Analyzing trace with hash -349125983, now seen corresponding path program 31 times [2021-06-05 23:22:18,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:18,859 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929697731] [2021-06-05 23:22:18,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:18,946 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:18,946 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929697731] [2021-06-05 23:22:18,946 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929697731] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:18,946 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138070270] [2021-06-05 23:22:18,946 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 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 23:22:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:18,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:18,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:19,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:19,005 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:19,014 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:19,015 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:19,015 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-06-05 23:22:19,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:19,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2021-06-05 23:22:19,065 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:19,076 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:19,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:19,077 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:51 [2021-06-05 23:22:19,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:19,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 23:22:19,135 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:19,142 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:19,142 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:19,143 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:48 [2021-06-05 23:22:19,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 23:22:19,171 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:19,175 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:19,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 23:22:19,176 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:19,178 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:19,178 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:19,178 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:7 [2021-06-05 23:22:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:19,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138070270] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:19,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:19,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 23:22:19,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822977853] [2021-06-05 23:22:19,194 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 23:22:19,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:19,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 23:22:19,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:19,194 INFO L87 Difference]: Start difference. First operand 13135 states and 47526 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:19,396 INFO L93 Difference]: Finished difference Result 13946 states and 50119 transitions. [2021-06-05 23:22:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 23:22:19,396 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:19,420 INFO L225 Difference]: With dead ends: 13946 [2021-06-05 23:22:19,421 INFO L226 Difference]: Without dead ends: 13912 [2021-06-05 23:22:19,421 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 189.3ms TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-06-05 23:22:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13912 states. [2021-06-05 23:22:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13912 to 13160. [2021-06-05 23:22:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13160 states, 13159 states have (on average 3.617828102439395) internal successors, (47607), 13159 states have internal predecessors, (47607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13160 states to 13160 states and 47607 transitions. [2021-06-05 23:22:19,609 INFO L78 Accepts]: Start accepts. Automaton has 13160 states and 47607 transitions. Word has length 30 [2021-06-05 23:22:19,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:19,610 INFO L482 AbstractCegarLoop]: Abstraction has 13160 states and 47607 transitions. [2021-06-05 23:22:19,610 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 13160 states and 47607 transitions. [2021-06-05 23:22:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:19,625 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:19,625 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:19,825 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:19,826 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:19,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1368944027, now seen corresponding path program 32 times [2021-06-05 23:22:19,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:19,826 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204894779] [2021-06-05 23:22:19,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:19,919 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:19,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204894779] [2021-06-05 23:22:19,919 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204894779] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:19,919 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42136022] [2021-06-05 23:22:19,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:22:19,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:22:19,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:19,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:19,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:19,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:19,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:19,990 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:19,991 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:19,991 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2021-06-05 23:22:20,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:20,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2021-06-05 23:22:20,041 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:20,053 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:20,054 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:20,054 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:54 [2021-06-05 23:22:20,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2021-06-05 23:22:20,122 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:20,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:20,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-06-05 23:22:20,131 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:20,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:20,137 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:20,137 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:24 [2021-06-05 23:22:20,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:22:20,158 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:20,159 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:20,160 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:20,160 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:5 [2021-06-05 23:22:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:20,184 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42136022] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:20,184 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:20,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 23:22:20,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849534557] [2021-06-05 23:22:20,185 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 23:22:20,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:20,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 23:22:20,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:20,185 INFO L87 Difference]: Start difference. First operand 13160 states and 47607 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:20,560 INFO L93 Difference]: Finished difference Result 14147 states and 50700 transitions. [2021-06-05 23:22:20,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 23:22:20,561 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:20,587 INFO L225 Difference]: With dead ends: 14147 [2021-06-05 23:22:20,587 INFO L226 Difference]: Without dead ends: 14098 [2021-06-05 23:22:20,587 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 201.0ms TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-06-05 23:22:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14098 states. [2021-06-05 23:22:20,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14098 to 13164. [2021-06-05 23:22:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 3.618400060776419) internal successors, (47629), 13163 states have internal predecessors, (47629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 47629 transitions. [2021-06-05 23:22:20,778 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 47629 transitions. Word has length 30 [2021-06-05 23:22:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:20,778 INFO L482 AbstractCegarLoop]: Abstraction has 13164 states and 47629 transitions. [2021-06-05 23:22:20,778 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 47629 transitions. [2021-06-05 23:22:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:20,794 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:20,794 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:20,994 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2021-06-05 23:22:20,994 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash 5796635, now seen corresponding path program 33 times [2021-06-05 23:22:20,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:20,995 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454073879] [2021-06-05 23:22:20,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:21,215 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:21,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454073879] [2021-06-05 23:22:21,215 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454073879] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:21,215 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013069574] [2021-06-05 23:22:21,215 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 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 23:22:21,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 23:22:21,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:21,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 41 conjunts are in the unsatisfiable core [2021-06-05 23:22:21,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:21,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:21,349 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:21,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:21,359 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:21,359 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2021-06-05 23:22:21,565 INFO L446 ElimStorePlain]: Different costs {0=[v_C_50], 2=[A, B]} [2021-06-05 23:22:21,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:22:21,569 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:21,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:21,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:21,592 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:21,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2021-06-05 23:22:21,593 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:22:21,606 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:21,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:21,612 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:21,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2021-06-05 23:22:21,618 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: and 2 xjuncts. [2021-06-05 23:22:21,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:21,632 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:21,632 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:64, output treesize:33 [2021-06-05 23:22:21,753 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:21,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2021-06-05 23:22:21,756 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:22:21,770 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:21,775 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:21,776 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:56 [2021-06-05 23:22:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:21,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013069574] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:21,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:21,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2021-06-05 23:22:21,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892179805] [2021-06-05 23:22:21,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:22:21,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:21,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:22:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:22:21,828 INFO L87 Difference]: Start difference. First operand 13164 states and 47629 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:24,064 INFO L93 Difference]: Finished difference Result 20521 states and 73160 transitions. [2021-06-05 23:22:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 23:22:24,064 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:24,100 INFO L225 Difference]: With dead ends: 20521 [2021-06-05 23:22:24,100 INFO L226 Difference]: Without dead ends: 20328 [2021-06-05 23:22:24,101 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 1729.6ms TimeCoverageRelationStatistics Valid=362, Invalid=2608, Unknown=0, NotChecked=0, Total=2970 [2021-06-05 23:22:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20328 states. [2021-06-05 23:22:24,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20328 to 13204. [2021-06-05 23:22:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13204 states, 13203 states have (on average 3.6177383927895175) internal successors, (47765), 13203 states have internal predecessors, (47765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13204 states to 13204 states and 47765 transitions. [2021-06-05 23:22:24,320 INFO L78 Accepts]: Start accepts. Automaton has 13204 states and 47765 transitions. Word has length 30 [2021-06-05 23:22:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:24,320 INFO L482 AbstractCegarLoop]: Abstraction has 13204 states and 47765 transitions. [2021-06-05 23:22:24,320 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 13204 states and 47765 transitions. [2021-06-05 23:22:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:24,335 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:24,335 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:24,536 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:24,536 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:24,536 INFO L82 PathProgramCache]: Analyzing trace with hash -2139066969, now seen corresponding path program 34 times [2021-06-05 23:22:24,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:24,536 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934334243] [2021-06-05 23:22:24,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:24,749 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:24,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934334243] [2021-06-05 23:22:24,749 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934334243] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:24,749 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051992368] [2021-06-05 23:22:24,750 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 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 23:22:24,776 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:22:24,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:24,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:24,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:24,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:24,822 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:24,831 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:24,832 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:24,832 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-06-05 23:22:24,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:22:24,909 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:24,921 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:24,922 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:24,922 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:48 [2021-06-05 23:22:24,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2021-06-05 23:22:24,961 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:24,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:24,967 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:24,967 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:29 [2021-06-05 23:22:24,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 23:22:24,997 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:25,002 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:25,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-06-05 23:22:25,005 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:25,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:25,007 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:25,007 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:5 [2021-06-05 23:22:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:25,025 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051992368] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:25,025 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:25,025 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2021-06-05 23:22:25,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065000628] [2021-06-05 23:22:25,026 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 23:22:25,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 23:22:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2021-06-05 23:22:25,026 INFO L87 Difference]: Start difference. First operand 13204 states and 47765 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:26,190 INFO L93 Difference]: Finished difference Result 21063 states and 75027 transitions. [2021-06-05 23:22:26,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 23:22:26,190 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:26,228 INFO L225 Difference]: With dead ends: 21063 [2021-06-05 23:22:26,228 INFO L226 Difference]: Without dead ends: 21002 [2021-06-05 23:22:26,228 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 906.8ms TimeCoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 23:22:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21002 states. [2021-06-05 23:22:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21002 to 13250. [2021-06-05 23:22:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13250 states, 13249 states have (on average 3.6160464940750243) internal successors, (47909), 13249 states have internal predecessors, (47909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13250 states to 13250 states and 47909 transitions. [2021-06-05 23:22:26,461 INFO L78 Accepts]: Start accepts. Automaton has 13250 states and 47909 transitions. Word has length 30 [2021-06-05 23:22:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:26,462 INFO L482 AbstractCegarLoop]: Abstraction has 13250 states and 47909 transitions. [2021-06-05 23:22:26,462 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 13250 states and 47909 transitions. [2021-06-05 23:22:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:26,477 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:26,477 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:26,678 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2021-06-05 23:22:26,678 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:26,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:26,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1037105035, now seen corresponding path program 35 times [2021-06-05 23:22:26,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:26,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569259323] [2021-06-05 23:22:26,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:26,887 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:26,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569259323] [2021-06-05 23:22:26,887 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569259323] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:26,887 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687613399] [2021-06-05 23:22:26,887 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 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 23:22:26,913 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 23:22:26,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:26,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 23:22:26,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:26,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:26,945 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:26,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:26,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:26,956 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:35 [2021-06-05 23:22:27,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:27,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2021-06-05 23:22:27,085 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:27,097 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:27,098 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:27,098 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:76 [2021-06-05 23:22:27,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:27,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2021-06-05 23:22:27,146 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:27,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:27,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:27,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-06-05 23:22:27,157 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:27,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:27,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:27,163 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:35 [2021-06-05 23:22:27,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:22:27,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:27,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:27,193 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:27,193 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2021-06-05 23:22:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:27,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687613399] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:27,229 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:27,229 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 23:22:27,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050171596] [2021-06-05 23:22:27,229 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:22:27,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:27,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:22:27,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:22:27,230 INFO L87 Difference]: Start difference. First operand 13250 states and 47909 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:28,509 INFO L93 Difference]: Finished difference Result 20851 states and 74309 transitions. [2021-06-05 23:22:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 23:22:28,510 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:28,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:28,548 INFO L225 Difference]: With dead ends: 20851 [2021-06-05 23:22:28,548 INFO L226 Difference]: Without dead ends: 20683 [2021-06-05 23:22:28,548 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 975.3ms TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2021-06-05 23:22:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20683 states. [2021-06-05 23:22:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20683 to 13238. [2021-06-05 23:22:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13238 states, 13237 states have (on average 3.616529425096321) internal successors, (47872), 13237 states have internal predecessors, (47872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13238 states to 13238 states and 47872 transitions. [2021-06-05 23:22:28,776 INFO L78 Accepts]: Start accepts. Automaton has 13238 states and 47872 transitions. Word has length 30 [2021-06-05 23:22:28,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:28,776 INFO L482 AbstractCegarLoop]: Abstraction has 13238 states and 47872 transitions. [2021-06-05 23:22:28,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 13238 states and 47872 transitions. [2021-06-05 23:22:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:28,792 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:28,792 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:28,992 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2021-06-05 23:22:28,993 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:28,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:28,993 INFO L82 PathProgramCache]: Analyzing trace with hash -354822415, now seen corresponding path program 36 times [2021-06-05 23:22:28,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:28,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739159578] [2021-06-05 23:22:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:29,236 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:29,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739159578] [2021-06-05 23:22:29,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739159578] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:29,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452512380] [2021-06-05 23:22:29,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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-06-05 23:22:29,360 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 23:22:29,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:29,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 23:22:29,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:29,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:29,391 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:29,400 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:29,401 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:29,401 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2021-06-05 23:22:29,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:22:29,550 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:29,562 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:29,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 23:22:29,565 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:29,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:29,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 23:22:29,578 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:29,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:29,585 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:29,585 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:53, output treesize:23 [2021-06-05 23:22:29,626 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:29,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2021-06-05 23:22:29,629 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:22:29,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:29,647 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:29,647 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:53 [2021-06-05 23:22:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:29,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452512380] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:29,695 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:29,695 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 23:22:29,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146821275] [2021-06-05 23:22:29,695 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 23:22:29,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:29,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 23:22:29,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2021-06-05 23:22:29,696 INFO L87 Difference]: Start difference. First operand 13238 states and 47872 transitions. Second operand has 20 states, 20 states have (on average 2.8) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:31,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:31,027 INFO L93 Difference]: Finished difference Result 20970 states and 74635 transitions. [2021-06-05 23:22:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 23:22:31,027 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:31,063 INFO L225 Difference]: With dead ends: 20970 [2021-06-05 23:22:31,063 INFO L226 Difference]: Without dead ends: 20815 [2021-06-05 23:22:31,063 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1017.5ms TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 23:22:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20815 states. [2021-06-05 23:22:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20815 to 13250. [2021-06-05 23:22:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13250 states, 13249 states have (on average 3.616574835836667) internal successors, (47916), 13249 states have internal predecessors, (47916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13250 states to 13250 states and 47916 transitions. [2021-06-05 23:22:31,286 INFO L78 Accepts]: Start accepts. Automaton has 13250 states and 47916 transitions. Word has length 30 [2021-06-05 23:22:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:31,286 INFO L482 AbstractCegarLoop]: Abstraction has 13250 states and 47916 transitions. [2021-06-05 23:22:31,286 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 13250 states and 47916 transitions. [2021-06-05 23:22:31,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:31,302 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:31,302 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:31,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:31,503 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:31,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:31,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1431415003, now seen corresponding path program 37 times [2021-06-05 23:22:31,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:31,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734100085] [2021-06-05 23:22:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:31,716 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:31,716 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734100085] [2021-06-05 23:22:31,716 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734100085] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:31,716 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788029469] [2021-06-05 23:22:31,716 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 23:22:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:31,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:31,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:31,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:31,780 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:31,788 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:31,789 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:31,789 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2021-06-05 23:22:31,907 INFO L446 ElimStorePlain]: Different costs {0=[A, B], 2=[v_C_58]} [2021-06-05 23:22:31,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2021-06-05 23:22:31,910 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:31,916 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:31,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-06-05 23:22:31,918 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:31,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:31,923 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:22:31,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-06-05 23:22:31,925 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:31,929 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:31,929 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:31,929 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:52, output treesize:24 [2021-06-05 23:22:31,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:22:31,959 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:31,961 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:31,961 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:31,961 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:5 [2021-06-05 23:22:31,976 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:31,976 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788029469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:31,976 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:31,976 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2021-06-05 23:22:31,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057215102] [2021-06-05 23:22:31,976 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 23:22:31,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:31,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 23:22:31,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2021-06-05 23:22:31,977 INFO L87 Difference]: Start difference. First operand 13250 states and 47916 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:32,931 INFO L93 Difference]: Finished difference Result 20480 states and 73212 transitions. [2021-06-05 23:22:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 23:22:32,932 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:32,967 INFO L225 Difference]: With dead ends: 20480 [2021-06-05 23:22:32,967 INFO L226 Difference]: Without dead ends: 20403 [2021-06-05 23:22:32,967 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 787.0ms TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 23:22:32,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20403 states. [2021-06-05 23:22:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20403 to 13288. [2021-06-05 23:22:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13288 states, 13287 states have (on average 3.616467223602017) internal successors, (48052), 13287 states have internal predecessors, (48052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13288 states to 13288 states and 48052 transitions. [2021-06-05 23:22:33,228 INFO L78 Accepts]: Start accepts. Automaton has 13288 states and 48052 transitions. Word has length 30 [2021-06-05 23:22:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:33,228 INFO L482 AbstractCegarLoop]: Abstraction has 13288 states and 48052 transitions. [2021-06-05 23:22:33,228 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 13288 states and 48052 transitions. [2021-06-05 23:22:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:33,243 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:33,244 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:33,444 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:33,444 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:33,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:33,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1143539301, now seen corresponding path program 38 times [2021-06-05 23:22:33,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:33,445 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420376319] [2021-06-05 23:22:33,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:33,630 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:33,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420376319] [2021-06-05 23:22:33,631 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420376319] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:33,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955941926] [2021-06-05 23:22:33,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:22:33,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:22:33,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:33,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 23:22:33,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:33,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:33,688 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:33,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:33,697 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:33,697 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-06-05 23:22:33,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22: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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2021-06-05 23:22:33,812 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:33,818 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:33,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:33,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-06-05 23:22:33,821 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:33,826 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:33,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:33,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2021-06-05 23:22:33,829 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:33,834 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:33,834 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:33,835 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:28 [2021-06-05 23:22:33,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:22:33,885 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:33,889 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:33,890 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:33,890 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2021-06-05 23:22:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:33,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955941926] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:33,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:33,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-06-05 23:22:33,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672139977] [2021-06-05 23:22:33,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 23:22:33,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 23:22:33,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2021-06-05 23:22:33,925 INFO L87 Difference]: Start difference. First operand 13288 states and 48052 transitions. Second operand has 20 states, 20 states have (on average 2.8) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:34,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:34,517 INFO L93 Difference]: Finished difference Result 20209 states and 72427 transitions. [2021-06-05 23:22:34,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 23:22:34,517 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:34,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:34,555 INFO L225 Difference]: With dead ends: 20209 [2021-06-05 23:22:34,555 INFO L226 Difference]: Without dead ends: 20182 [2021-06-05 23:22:34,555 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 445.8ms TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2021-06-05 23:22:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20182 states. [2021-06-05 23:22:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20182 to 13360. [2021-06-05 23:22:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13360 states, 13359 states have (on average 3.616138932554832) internal successors, (48308), 13359 states have internal predecessors, (48308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13360 states to 13360 states and 48308 transitions. [2021-06-05 23:22:34,799 INFO L78 Accepts]: Start accepts. Automaton has 13360 states and 48308 transitions. Word has length 30 [2021-06-05 23:22:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:34,799 INFO L482 AbstractCegarLoop]: Abstraction has 13360 states and 48308 transitions. [2021-06-05 23:22:34,799 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 2.8) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 13360 states and 48308 transitions. [2021-06-05 23:22:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:34,816 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:34,816 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:35,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:35,017 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:35,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:35,017 INFO L82 PathProgramCache]: Analyzing trace with hash 426491389, now seen corresponding path program 39 times [2021-06-05 23:22:35,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:35,017 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214267373] [2021-06-05 23:22:35,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:35,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:35,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214267373] [2021-06-05 23:22:35,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214267373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:35,174 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71791159] [2021-06-05 23:22:35,174 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 23:22:35,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-06-05 23:22:35,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:35,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 23:22:35,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:35,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:35,238 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:35,246 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:35,247 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:35,247 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-06-05 23:22:35,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:35,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:35,302 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:35,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:35,317 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:35,317 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:69 [2021-06-05 23:22:35,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:35,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:22:35,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 23:22:35,456 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:35,465 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:35,469 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:35,470 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:48 [2021-06-05 23:22:35,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 23:22:35,501 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:35,504 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:35,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 23:22:35,506 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:35,507 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:35,507 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:35,507 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:7 [2021-06-05 23:22:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:35,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71791159] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:35,524 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:35,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2021-06-05 23:22:35,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894153931] [2021-06-05 23:22:35,525 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 23:22:35,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:35,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 23:22:35,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-06-05 23:22:35,525 INFO L87 Difference]: Start difference. First operand 13360 states and 48308 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:36,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:36,039 INFO L93 Difference]: Finished difference Result 14509 states and 51925 transitions. [2021-06-05 23:22:36,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 23:22:36,040 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:36,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:36,067 INFO L225 Difference]: With dead ends: 14509 [2021-06-05 23:22:36,067 INFO L226 Difference]: Without dead ends: 14476 [2021-06-05 23:22:36,067 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 407.1ms TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-06-05 23:22:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14476 states. [2021-06-05 23:22:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14476 to 13399. [2021-06-05 23:22:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13399 states, 13398 states have (on average 3.6151664427526495) internal successors, (48436), 13398 states have internal predecessors, (48436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13399 states to 13399 states and 48436 transitions. [2021-06-05 23:22:36,267 INFO L78 Accepts]: Start accepts. Automaton has 13399 states and 48436 transitions. Word has length 30 [2021-06-05 23:22:36,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:36,267 INFO L482 AbstractCegarLoop]: Abstraction has 13399 states and 48436 transitions. [2021-06-05 23:22:36,267 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 13399 states and 48436 transitions. [2021-06-05 23:22:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:36,357 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:36,357 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:36,557 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:36,558 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:36,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:36,558 INFO L82 PathProgramCache]: Analyzing trace with hash -692303903, now seen corresponding path program 40 times [2021-06-05 23:22:36,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:36,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483498657] [2021-06-05 23:22:36,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:36,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:36,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483498657] [2021-06-05 23:22:36,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483498657] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:36,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078445839] [2021-06-05 23:22:36,706 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 23:22:36,734 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:22:36,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:36,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:36,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:36,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:36,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:36,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:36,785 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:36,785 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-06-05 23:22:36,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:36,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:36,841 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:36,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:36,852 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:36,853 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2021-06-05 23:22:37,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:37,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 65 [2021-06-05 23:22:37,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:37,029 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:37,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:37,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 52 [2021-06-05 23:22:37,032 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:37,037 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:37,037 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:37,037 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:158, output treesize:57 [2021-06-05 23:22:37,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:22:37,060 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:37,061 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:37,062 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:37,062 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:5 [2021-06-05 23:22:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:37,081 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078445839] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:37,081 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:37,081 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-06-05 23:22:37,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584699458] [2021-06-05 23:22:37,081 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 23:22:37,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:37,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 23:22:37,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-06-05 23:22:37,081 INFO L87 Difference]: Start difference. First operand 13399 states and 48436 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:37,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:37,434 INFO L93 Difference]: Finished difference Result 14052 states and 50450 transitions. [2021-06-05 23:22:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 23:22:37,434 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:37,460 INFO L225 Difference]: With dead ends: 14052 [2021-06-05 23:22:37,460 INFO L226 Difference]: Without dead ends: 13977 [2021-06-05 23:22:37,460 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 326.5ms TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2021-06-05 23:22:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13977 states. [2021-06-05 23:22:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13977 to 13399. [2021-06-05 23:22:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13399 states, 13398 states have (on average 3.615091804746977) internal successors, (48435), 13398 states have internal predecessors, (48435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13399 states to 13399 states and 48435 transitions. [2021-06-05 23:22:37,658 INFO L78 Accepts]: Start accepts. Automaton has 13399 states and 48435 transitions. Word has length 30 [2021-06-05 23:22:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:37,658 INFO L482 AbstractCegarLoop]: Abstraction has 13399 states and 48435 transitions. [2021-06-05 23:22:37,658 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 13399 states and 48435 transitions. [2021-06-05 23:22:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:37,674 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:37,674 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:37,875 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:37,875 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:37,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:37,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1652951515, now seen corresponding path program 41 times [2021-06-05 23:22:37,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:37,875 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13981328] [2021-06-05 23:22:37,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:38,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:38,029 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:38,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13981328] [2021-06-05 23:22:38,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13981328] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:38,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946776670] [2021-06-05 23:22:38,030 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 23:22:38,061 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 23:22:38,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:38,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 23:22:38,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:38,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:38,103 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:38,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:38,115 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:38,115 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:35 [2021-06-05 23:22:38,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:38,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:38,200 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:38,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:38,211 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:38,211 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2021-06-05 23:22:38,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:38,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2021-06-05 23:22:38,247 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:38,253 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:38,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:38,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-06-05 23:22:38,256 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:38,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:38,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:38,261 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:23 [2021-06-05 23:22:38,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:22:38,301 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:38,302 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:38,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:38,302 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:5 [2021-06-05 23:22:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:38,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946776670] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:38,321 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:38,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-06-05 23:22:38,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819319403] [2021-06-05 23:22:38,321 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 23:22:38,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:38,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 23:22:38,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2021-06-05 23:22:38,322 INFO L87 Difference]: Start difference. First operand 13399 states and 48435 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:38,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:38,680 INFO L93 Difference]: Finished difference Result 14056 states and 50400 transitions. [2021-06-05 23:22:38,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 23:22:38,680 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:38,705 INFO L225 Difference]: With dead ends: 14056 [2021-06-05 23:22:38,706 INFO L226 Difference]: Without dead ends: 14031 [2021-06-05 23:22:38,706 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 304.1ms TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2021-06-05 23:22:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14031 states. [2021-06-05 23:22:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14031 to 13418. [2021-06-05 23:22:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13418 states, 13417 states have (on average 3.6153387493478424) internal successors, (48507), 13417 states have internal predecessors, (48507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13418 states to 13418 states and 48507 transitions. [2021-06-05 23:22:38,902 INFO L78 Accepts]: Start accepts. Automaton has 13418 states and 48507 transitions. Word has length 30 [2021-06-05 23:22:38,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:38,902 INFO L482 AbstractCegarLoop]: Abstraction has 13418 states and 48507 transitions. [2021-06-05 23:22:38,902 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 13418 states and 48507 transitions. [2021-06-05 23:22:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:38,918 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:38,918 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:39,119 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:39,119 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:39,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:39,119 INFO L82 PathProgramCache]: Analyzing trace with hash -75764163, now seen corresponding path program 42 times [2021-06-05 23:22:39,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:39,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573813536] [2021-06-05 23:22:39,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:39,219 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:39,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573813536] [2021-06-05 23:22:39,219 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573813536] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:39,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159369132] [2021-06-05 23:22:39,220 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 23:22:39,250 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 23:22:39,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:39,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:39,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:39,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:39,283 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:39,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:39,293 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:39,293 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2021-06-05 23:22:39,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:39,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:39,326 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:39,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:39,337 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:39,337 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2021-06-05 23:22:39,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:39,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2021-06-05 23:22:39,400 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:39,406 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:39,407 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:39,407 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:30 [2021-06-05 23:22:39,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 23:22:39,465 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:39,469 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:39,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-06-05 23:22:39,471 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:39,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:39,472 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:39,472 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:7 [2021-06-05 23:22:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:39,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159369132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:39,491 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:39,491 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 23:22:39,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114379009] [2021-06-05 23:22:39,491 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 23:22:39,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:39,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 23:22:39,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:39,491 INFO L87 Difference]: Start difference. First operand 13418 states and 48507 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:39,836 INFO L93 Difference]: Finished difference Result 14584 states and 52315 transitions. [2021-06-05 23:22:39,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 23:22:39,837 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:39,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:39,865 INFO L225 Difference]: With dead ends: 14584 [2021-06-05 23:22:39,865 INFO L226 Difference]: Without dead ends: 14551 [2021-06-05 23:22:39,865 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 203.1ms TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14551 states. [2021-06-05 23:22:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14551 to 13496. [2021-06-05 23:22:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13496 states, 13495 states have (on average 3.615190811411634) internal successors, (48787), 13495 states have internal predecessors, (48787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13496 states to 13496 states and 48787 transitions. [2021-06-05 23:22:40,133 INFO L78 Accepts]: Start accepts. Automaton has 13496 states and 48787 transitions. Word has length 30 [2021-06-05 23:22:40,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:40,133 INFO L482 AbstractCegarLoop]: Abstraction has 13496 states and 48787 transitions. [2021-06-05 23:22:40,133 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 13496 states and 48787 transitions. [2021-06-05 23:22:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:40,150 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:40,150 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:40,350 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2021-06-05 23:22:40,350 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1496215775, now seen corresponding path program 43 times [2021-06-05 23:22:40,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:40,351 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604769223] [2021-06-05 23:22:40,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:40,456 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:40,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604769223] [2021-06-05 23:22:40,456 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604769223] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:40,456 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729226478] [2021-06-05 23:22:40,456 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 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 23:22:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:40,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:40,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:40,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:40,528 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:40,537 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:40,538 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:40,538 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-06-05 23:22:40,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:40,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:40,567 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:40,577 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:40,578 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:40,578 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2021-06-05 23:22:40,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:40,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 23:22:40,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:40,680 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:40,681 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:40,681 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:48 [2021-06-05 23:22:40,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 23:22:40,718 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:40,722 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:40,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-06-05 23:22:40,724 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:40,725 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:40,725 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:40,726 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:7 [2021-06-05 23:22:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:40,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729226478] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:40,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:40,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 23:22:40,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741849088] [2021-06-05 23:22:40,744 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 23:22:40,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:40,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 23:22:40,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:40,744 INFO L87 Difference]: Start difference. First operand 13496 states and 48787 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:41,076 INFO L93 Difference]: Finished difference Result 14511 states and 52095 transitions. [2021-06-05 23:22:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 23:22:41,077 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:41,105 INFO L225 Difference]: With dead ends: 14511 [2021-06-05 23:22:41,106 INFO L226 Difference]: Without dead ends: 14468 [2021-06-05 23:22:41,106 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 207.2ms TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14468 states. [2021-06-05 23:22:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14468 to 13571. [2021-06-05 23:22:41,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13571 states, 13570 states have (on average 3.6152542372881356) internal successors, (49059), 13570 states have internal predecessors, (49059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13571 states to 13571 states and 49059 transitions. [2021-06-05 23:22:41,334 INFO L78 Accepts]: Start accepts. Automaton has 13571 states and 49059 transitions. Word has length 30 [2021-06-05 23:22:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:41,334 INFO L482 AbstractCegarLoop]: Abstraction has 13571 states and 49059 transitions. [2021-06-05 23:22:41,334 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 14 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 13571 states and 49059 transitions. [2021-06-05 23:22:41,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:41,353 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:41,353 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:41,553 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2021-06-05 23:22:41,553 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1778933477, now seen corresponding path program 44 times [2021-06-05 23:22:41,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:41,554 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120560469] [2021-06-05 23:22:41,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:41,647 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:41,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120560469] [2021-06-05 23:22:41,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120560469] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:41,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571356487] [2021-06-05 23:22:41,647 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 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 23:22:41,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:22:41,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:41,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:41,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:41,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:41,705 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:41,714 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:41,715 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:41,715 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2021-06-05 23:22:41,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:41,741 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:41,742 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:41,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:41,752 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:41,752 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2021-06-05 23:22:41,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:41,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 23:22:41,846 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:41,854 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:41,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:41,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2021-06-05 23:22:41,859 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:41,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:41,865 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:41,865 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:32 [2021-06-05 23:22:41,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:22:41,890 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:41,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:41,892 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:41,892 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:5 [2021-06-05 23:22:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:41,912 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571356487] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:41,912 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:41,913 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 23:22:41,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140792538] [2021-06-05 23:22:41,913 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 23:22:41,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:41,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 23:22:41,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:41,913 INFO L87 Difference]: Start difference. First operand 13571 states and 49059 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:42,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:42,127 INFO L93 Difference]: Finished difference Result 14470 states and 51948 transitions. [2021-06-05 23:22:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 23:22:42,127 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:42,153 INFO L225 Difference]: With dead ends: 14470 [2021-06-05 23:22:42,154 INFO L226 Difference]: Without dead ends: 14437 [2021-06-05 23:22:42,154 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 194.7ms TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14437 states. [2021-06-05 23:22:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14437 to 13595. [2021-06-05 23:22:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13595 states, 13594 states have (on average 3.617257613653082) internal successors, (49173), 13594 states have internal predecessors, (49173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13595 states to 13595 states and 49173 transitions. [2021-06-05 23:22:42,357 INFO L78 Accepts]: Start accepts. Automaton has 13595 states and 49173 transitions. Word has length 30 [2021-06-05 23:22:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:42,357 INFO L482 AbstractCegarLoop]: Abstraction has 13595 states and 49173 transitions. [2021-06-05 23:22:42,357 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 13595 states and 49173 transitions. [2021-06-05 23:22:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:42,375 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:42,375 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:42,576 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2021-06-05 23:22:42,576 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1731377819, now seen corresponding path program 45 times [2021-06-05 23:22:42,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:42,576 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588656599] [2021-06-05 23:22:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:42,668 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:42,668 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:42,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588656599] [2021-06-05 23:22:42,668 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588656599] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:42,668 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761658440] [2021-06-05 23:22:42,668 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 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 23:22:42,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-06-05 23:22:42,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:42,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 23:22:42,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:42,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:22:42,724 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:42,733 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:42,734 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:42,734 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-06-05 23:22:42,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:42,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:42,768 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:42,779 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:42,780 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:42,780 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:49 [2021-06-05 23:22:42,918 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:42,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2021-06-05 23:22:42,920 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:42,934 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:42,941 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:42,942 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:129 [2021-06-05 23:22:43,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-06-05 23:22:43,071 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:43,075 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:43,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-06-05 23:22:43,077 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:43,078 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:43,078 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:43,079 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:7 [2021-06-05 23:22:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:43,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761658440] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:43,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:43,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2021-06-05 23:22:43,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849655602] [2021-06-05 23:22:43,097 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 23:22:43,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:43,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 23:22:43,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2021-06-05 23:22:43,098 INFO L87 Difference]: Start difference. First operand 13595 states and 49173 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:43,734 INFO L93 Difference]: Finished difference Result 14340 states and 51475 transitions. [2021-06-05 23:22:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 23:22:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:43,761 INFO L225 Difference]: With dead ends: 14340 [2021-06-05 23:22:43,761 INFO L226 Difference]: Without dead ends: 14307 [2021-06-05 23:22:43,761 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 523.5ms TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2021-06-05 23:22:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14307 states. [2021-06-05 23:22:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14307 to 13642. [2021-06-05 23:22:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13642 states, 13641 states have (on average 3.616963565720988) internal successors, (49339), 13641 states have internal predecessors, (49339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13642 states to 13642 states and 49339 transitions. [2021-06-05 23:22:43,962 INFO L78 Accepts]: Start accepts. Automaton has 13642 states and 49339 transitions. Word has length 30 [2021-06-05 23:22:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:43,962 INFO L482 AbstractCegarLoop]: Abstraction has 13642 states and 49339 transitions. [2021-06-05 23:22:43,962 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:43,962 INFO L276 IsEmpty]: Start isEmpty. Operand 13642 states and 49339 transitions. [2021-06-05 23:22:43,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:43,981 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:43,981 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:44,181 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:44,182 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:44,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:44,182 INFO L82 PathProgramCache]: Analyzing trace with hash 711559775, now seen corresponding path program 46 times [2021-06-05 23:22:44,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:44,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161681815] [2021-06-05 23:22:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:44,355 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:44,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161681815] [2021-06-05 23:22:44,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161681815] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:44,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356104272] [2021-06-05 23:22:44,355 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 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 23:22:44,380 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:22:44,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:44,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 23:22:44,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:44,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:44,424 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:44,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:44,434 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:44,434 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2021-06-05 23:22:44,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:44,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:44,463 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:44,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:44,474 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:44,474 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2021-06-05 23:22:44,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:44,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2021-06-05 23:22:44,563 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:44,569 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:44,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:44,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2021-06-05 23:22:44,573 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:44,577 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:44,578 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:44,578 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:32 [2021-06-05 23:22:44,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 23:22:44,599 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:44,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:44,600 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:44,600 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:5 [2021-06-05 23:22:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:44,620 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356104272] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:44,620 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:44,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-06-05 23:22:44,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166952428] [2021-06-05 23:22:44,621 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 23:22:44,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:44,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 23:22:44,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:44,621 INFO L87 Difference]: Start difference. First operand 13642 states and 49339 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:44,918 INFO L93 Difference]: Finished difference Result 14281 states and 51351 transitions. [2021-06-05 23:22:44,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 23:22:44,918 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:44,944 INFO L225 Difference]: With dead ends: 14281 [2021-06-05 23:22:44,944 INFO L226 Difference]: Without dead ends: 14189 [2021-06-05 23:22:44,944 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 264.4ms TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14189 states. [2021-06-05 23:22:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14189 to 13700. [2021-06-05 23:22:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13700 states, 13699 states have (on average 3.6152273888605007) internal successors, (49525), 13699 states have internal predecessors, (49525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13700 states to 13700 states and 49525 transitions. [2021-06-05 23:22:45,151 INFO L78 Accepts]: Start accepts. Automaton has 13700 states and 49525 transitions. Word has length 30 [2021-06-05 23:22:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:45,151 INFO L482 AbstractCegarLoop]: Abstraction has 13700 states and 49525 transitions. [2021-06-05 23:22:45,151 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 13700 states and 49525 transitions. [2021-06-05 23:22:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 23:22:45,171 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:45,171 INFO L554 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:45,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2021-06-05 23:22:45,371 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:45,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:45,372 INFO L82 PathProgramCache]: Analyzing trace with hash -11649061, now seen corresponding path program 47 times [2021-06-05 23:22:45,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:45,372 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660776022] [2021-06-05 23:22:45,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:45,465 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:45,465 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660776022] [2021-06-05 23:22:45,465 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660776022] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:45,465 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638980844] [2021-06-05 23:22:45,465 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 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 23:22:45,506 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 23:22:45,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:45,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 23:22:45,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:45,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:22:45,537 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:45,546 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:45,546 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:45,547 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:38 [2021-06-05 23:22:45,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:45,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:22:45,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:45,646 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:45,647 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:45,647 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:56 [2021-06-05 23:22:45,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-06-05 23:22:45,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:45,780 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:45,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 23:22:45,782 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:22:45,789 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:45,790 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:45,790 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:24 [2021-06-05 23:22:45,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:22:45,876 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:22:45,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 45 [2021-06-05 23:22:45,890 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2021-06-05 23:22:45,939 INFO L628 ElimStorePlain]: treesize reduction 50, result has 47.9 percent of original size [2021-06-05 23:22:45,945 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:22:45,946 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2021-06-05 23:22:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:45,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638980844] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:45,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:45,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2021-06-05 23:22:45,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845092477] [2021-06-05 23:22:45,998 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 23:22:45,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:45,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 23:22:45,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2021-06-05 23:22:45,998 INFO L87 Difference]: Start difference. First operand 13700 states and 49525 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:46,816 INFO L93 Difference]: Finished difference Result 14565 states and 52031 transitions. [2021-06-05 23:22:46,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 23:22:46,817 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 23:22:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:46,843 INFO L225 Difference]: With dead ends: 14565 [2021-06-05 23:22:46,843 INFO L226 Difference]: Without dead ends: 14523 [2021-06-05 23:22:46,843 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 643.4ms TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2021-06-05 23:22:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14523 states. [2021-06-05 23:22:47,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14523 to 13772. [2021-06-05 23:22:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13772 states, 13771 states have (on average 3.614044005518844) internal successors, (49769), 13771 states have internal predecessors, (49769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13772 states to 13772 states and 49769 transitions. [2021-06-05 23:22:47,067 INFO L78 Accepts]: Start accepts. Automaton has 13772 states and 49769 transitions. Word has length 30 [2021-06-05 23:22:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:47,067 INFO L482 AbstractCegarLoop]: Abstraction has 13772 states and 49769 transitions. [2021-06-05 23:22:47,067 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 13772 states and 49769 transitions. [2021-06-05 23:22:47,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:22:47,087 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:47,087 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:47,287 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:47,288 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:47,288 INFO L82 PathProgramCache]: Analyzing trace with hash -433229065, now seen corresponding path program 48 times [2021-06-05 23:22:47,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:47,288 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389092406] [2021-06-05 23:22:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:22:47,314 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:47,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389092406] [2021-06-05 23:22:47,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389092406] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:47,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426118823] [2021-06-05 23:22:47,315 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:22:47,341 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 23:22:47,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:47,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:22:47,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:22:47,387 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426118823] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:47,387 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:47,387 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 23:22:47,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672732207] [2021-06-05 23:22:47,387 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 23:22:47,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:47,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 23:22:47,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 23:22:47,388 INFO L87 Difference]: Start difference. First operand 13772 states and 49769 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:47,583 INFO L93 Difference]: Finished difference Result 24395 states and 85944 transitions. [2021-06-05 23:22:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 23:22:47,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:22:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:47,629 INFO L225 Difference]: With dead ends: 24395 [2021-06-05 23:22:47,630 INFO L226 Difference]: Without dead ends: 24014 [2021-06-05 23:22:47,630 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 55.0ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:22:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24014 states. [2021-06-05 23:22:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24014 to 14676. [2021-06-05 23:22:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14676 states, 14675 states have (on average 3.6072231686541736) internal successors, (52936), 14675 states have internal predecessors, (52936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14676 states to 14676 states and 52936 transitions. [2021-06-05 23:22:47,931 INFO L78 Accepts]: Start accepts. Automaton has 14676 states and 52936 transitions. Word has length 32 [2021-06-05 23:22:47,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:47,932 INFO L482 AbstractCegarLoop]: Abstraction has 14676 states and 52936 transitions. [2021-06-05 23:22:47,932 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 14676 states and 52936 transitions. [2021-06-05 23:22:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:22:47,952 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:47,952 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:48,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2021-06-05 23:22:48,157 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:48,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:48,157 INFO L82 PathProgramCache]: Analyzing trace with hash 220874481, now seen corresponding path program 49 times [2021-06-05 23:22:48,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:48,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490036162] [2021-06-05 23:22:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 23:22:48,180 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:48,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490036162] [2021-06-05 23:22:48,180 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490036162] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:48,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644186912] [2021-06-05 23:22:48,180 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 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 23:22:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:48,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:22:48,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:48,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644186912] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:48,343 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:48,343 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2021-06-05 23:22:48,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741237391] [2021-06-05 23:22:48,344 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 23:22:48,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:48,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 23:22:48,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 23:22:48,344 INFO L87 Difference]: Start difference. First operand 14676 states and 52936 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:49,205 INFO L93 Difference]: Finished difference Result 38041 states and 134285 transitions. [2021-06-05 23:22:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 23:22:49,205 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:22:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:49,295 INFO L225 Difference]: With dead ends: 38041 [2021-06-05 23:22:49,295 INFO L226 Difference]: Without dead ends: 37600 [2021-06-05 23:22:49,296 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 430.6ms TimeCoverageRelationStatistics Valid=720, Invalid=2586, Unknown=0, NotChecked=0, Total=3306 [2021-06-05 23:22:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37600 states. [2021-06-05 23:22:49,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37600 to 22618. [2021-06-05 23:22:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22618 states, 22617 states have (on average 3.6965999027280363) internal successors, (83606), 22617 states have internal predecessors, (83606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22618 states to 22618 states and 83606 transitions. [2021-06-05 23:22:49,783 INFO L78 Accepts]: Start accepts. Automaton has 22618 states and 83606 transitions. Word has length 32 [2021-06-05 23:22:49,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:49,783 INFO L482 AbstractCegarLoop]: Abstraction has 22618 states and 83606 transitions. [2021-06-05 23:22:49,783 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 22618 states and 83606 transitions. [2021-06-05 23:22:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:22:49,813 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:49,813 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:50,014 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable119 [2021-06-05 23:22:50,014 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:50,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1162824845, now seen corresponding path program 50 times [2021-06-05 23:22:50,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:50,014 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460180902] [2021-06-05 23:22:50,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:22:50,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:50,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460180902] [2021-06-05 23:22:50,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460180902] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:50,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632924363] [2021-06-05 23:22:50,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:22:50,075 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:22:50,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:50,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:22:50,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:50,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632924363] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:50,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:50,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-06-05 23:22:50,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192989287] [2021-06-05 23:22:50,127 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 23:22:50,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:50,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 23:22:50,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-06-05 23:22:50,128 INFO L87 Difference]: Start difference. First operand 22618 states and 83606 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:50,748 INFO L93 Difference]: Finished difference Result 37594 states and 131594 transitions. [2021-06-05 23:22:50,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 23:22:50,749 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:22:50,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:50,827 INFO L225 Difference]: With dead ends: 37594 [2021-06-05 23:22:50,827 INFO L226 Difference]: Without dead ends: 37314 [2021-06-05 23:22:50,827 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 195.5ms TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 23:22:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37314 states. [2021-06-05 23:22:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37314 to 26284. [2021-06-05 23:22:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26284 states, 26283 states have (on average 3.73811969714264) internal successors, (98249), 26283 states have internal predecessors, (98249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26284 states to 26284 states and 98249 transitions. [2021-06-05 23:22:51,623 INFO L78 Accepts]: Start accepts. Automaton has 26284 states and 98249 transitions. Word has length 32 [2021-06-05 23:22:51,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:51,623 INFO L482 AbstractCegarLoop]: Abstraction has 26284 states and 98249 transitions. [2021-06-05 23:22:51,623 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand 26284 states and 98249 transitions. [2021-06-05 23:22:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:22:51,657 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:51,657 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:51,858 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:22:51,858 INFO L430 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:51,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:51,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1268490291, now seen corresponding path program 51 times [2021-06-05 23:22:51,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:51,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917176959] [2021-06-05 23:22:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 23:22:51,889 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:51,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917176959] [2021-06-05 23:22:51,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917176959] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:51,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809901322] [2021-06-05 23:22:51,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:22:52,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-06-05 23:22:52,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:52,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:22:52,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:52,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809901322] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:52,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:52,132 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2021-06-05 23:22:52,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553931261] [2021-06-05 23:22:52,132 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 23:22:52,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:52,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 23:22:52,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 23:22:52,133 INFO L87 Difference]: Start difference. First operand 26284 states and 98249 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:53,180 INFO L93 Difference]: Finished difference Result 71719 states and 253646 transitions. [2021-06-05 23:22:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-06-05 23:22:53,180 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:22:53,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:53,339 INFO L225 Difference]: With dead ends: 71719 [2021-06-05 23:22:53,339 INFO L226 Difference]: Without dead ends: 70740 [2021-06-05 23:22:53,339 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 510.2ms TimeCoverageRelationStatistics Valid=1052, Invalid=3108, Unknown=0, NotChecked=0, Total=4160 [2021-06-05 23:22:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70740 states. [2021-06-05 23:22:54,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70740 to 43934. [2021-06-05 23:22:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43934 states, 43933 states have (on average 3.7027519176928503) internal successors, (162673), 43933 states have internal predecessors, (162673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43934 states to 43934 states and 162673 transitions. [2021-06-05 23:22:54,484 INFO L78 Accepts]: Start accepts. Automaton has 43934 states and 162673 transitions. Word has length 32 [2021-06-05 23:22:54,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:54,484 INFO L482 AbstractCegarLoop]: Abstraction has 43934 states and 162673 transitions. [2021-06-05 23:22:54,484 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:54,484 INFO L276 IsEmpty]: Start isEmpty. Operand 43934 states and 162673 transitions. [2021-06-05 23:22:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:22:54,534 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:54,534 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:54,734 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable121 [2021-06-05 23:22:54,735 INFO L430 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:54,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:54,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1584127903, now seen corresponding path program 52 times [2021-06-05 23:22:54,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:54,735 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171007969] [2021-06-05 23:22:54,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:22:54,765 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:54,765 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171007969] [2021-06-05 23:22:54,765 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171007969] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:54,765 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033446152] [2021-06-05 23:22:54,765 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 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 23:22:54,790 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:22:54,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:54,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:22:54,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:54,845 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033446152] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:54,845 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:54,845 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2021-06-05 23:22:54,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298182902] [2021-06-05 23:22:54,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 23:22:54,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:54,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 23:22:54,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 23:22:54,845 INFO L87 Difference]: Start difference. First operand 43934 states and 162673 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:22:56,003 INFO L93 Difference]: Finished difference Result 98581 states and 351453 transitions. [2021-06-05 23:22:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 23:22:56,004 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:22:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:22:56,265 INFO L225 Difference]: With dead ends: 98581 [2021-06-05 23:22:56,266 INFO L226 Difference]: Without dead ends: 97759 [2021-06-05 23:22:56,266 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 425.5ms TimeCoverageRelationStatistics Valid=459, Invalid=1433, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 23:22:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97759 states. [2021-06-05 23:22:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97759 to 63838. [2021-06-05 23:22:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63838 states, 63837 states have (on average 3.7566614972508106) internal successors, (239814), 63837 states have internal predecessors, (239814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63838 states to 63838 states and 239814 transitions. [2021-06-05 23:22:58,468 INFO L78 Accepts]: Start accepts. Automaton has 63838 states and 239814 transitions. Word has length 32 [2021-06-05 23:22:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:22:58,468 INFO L482 AbstractCegarLoop]: Abstraction has 63838 states and 239814 transitions. [2021-06-05 23:22:58,468 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:22:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 63838 states and 239814 transitions. [2021-06-05 23:22:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:22:58,537 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:22:58,537 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:22:58,737 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2021-06-05 23:22:58,737 INFO L430 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:22:58,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:22:58,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1338853791, now seen corresponding path program 53 times [2021-06-05 23:22:58,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:22:58,738 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728976019] [2021-06-05 23:22:58,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:22:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:22:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:22:58,926 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:22:58,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728976019] [2021-06-05 23:22:58,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728976019] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:58,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879788753] [2021-06-05 23:22:58,926 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 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 23:22:58,954 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 23:22:58,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:22:58,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:22:58,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:22:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:22:59,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879788753] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:22:59,008 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:22:59,008 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2021-06-05 23:22:59,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802312360] [2021-06-05 23:22:59,008 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 23:22:59,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:22:59,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 23:22:59,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-06-05 23:22:59,008 INFO L87 Difference]: Start difference. First operand 63838 states and 239814 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:00,457 INFO L93 Difference]: Finished difference Result 104100 states and 367281 transitions. [2021-06-05 23:23:00,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-06-05 23:23:00,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:23:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:00,864 INFO L225 Difference]: With dead ends: 104100 [2021-06-05 23:23:00,864 INFO L226 Difference]: Without dead ends: 104049 [2021-06-05 23:23:00,867 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2147 ImplicationChecksByTransitivity, 554.8ms TimeCoverageRelationStatistics Valid=1091, Invalid=4609, Unknown=0, NotChecked=0, Total=5700 [2021-06-05 23:23:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104049 states. [2021-06-05 23:23:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104049 to 57625. [2021-06-05 23:23:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57625 states, 57624 states have (on average 3.721019019852839) internal successors, (214420), 57624 states have internal predecessors, (214420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57625 states to 57625 states and 214420 transitions. [2021-06-05 23:23:02,378 INFO L78 Accepts]: Start accepts. Automaton has 57625 states and 214420 transitions. Word has length 32 [2021-06-05 23:23:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:02,379 INFO L482 AbstractCegarLoop]: Abstraction has 57625 states and 214420 transitions. [2021-06-05 23:23:02,379 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 57625 states and 214420 transitions. [2021-06-05 23:23:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:23:02,666 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:02,666 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:02,866 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2021-06-05 23:23:02,866 INFO L430 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:02,867 INFO L82 PathProgramCache]: Analyzing trace with hash -712196979, now seen corresponding path program 54 times [2021-06-05 23:23:02,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:02,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3977672] [2021-06-05 23:23:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 23:23:02,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:02,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3977672] [2021-06-05 23:23:02,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3977672] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:02,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31413944] [2021-06-05 23:23:02,907 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 23:23:02,936 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 23:23:02,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:02,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:02,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 23:23:02,977 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31413944] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:02,977 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:02,977 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2021-06-05 23:23:02,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770589383] [2021-06-05 23:23:02,977 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 23:23:02,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 23:23:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-05 23:23:02,977 INFO L87 Difference]: Start difference. First operand 57625 states and 214420 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:03,684 INFO L93 Difference]: Finished difference Result 67508 states and 247508 transitions. [2021-06-05 23:23:03,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 23:23:03,685 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:23:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:03,840 INFO L225 Difference]: With dead ends: 67508 [2021-06-05 23:23:03,840 INFO L226 Difference]: Without dead ends: 67415 [2021-06-05 23:23:03,841 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 113.7ms TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2021-06-05 23:23:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67415 states. [2021-06-05 23:23:04,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67415 to 61524. [2021-06-05 23:23:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61524 states, 61523 states have (on average 3.729710839848512) internal successors, (229463), 61523 states have internal predecessors, (229463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61524 states to 61524 states and 229463 transitions. [2021-06-05 23:23:05,301 INFO L78 Accepts]: Start accepts. Automaton has 61524 states and 229463 transitions. Word has length 32 [2021-06-05 23:23:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:05,301 INFO L482 AbstractCegarLoop]: Abstraction has 61524 states and 229463 transitions. [2021-06-05 23:23:05,301 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 61524 states and 229463 transitions. [2021-06-05 23:23:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:23:05,372 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:05,372 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:05,572 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2021-06-05 23:23:05,572 INFO L430 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:05,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:05,573 INFO L82 PathProgramCache]: Analyzing trace with hash 52350973, now seen corresponding path program 55 times [2021-06-05 23:23:05,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:05,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714031978] [2021-06-05 23:23:05,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:05,601 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:05,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714031978] [2021-06-05 23:23:05,601 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714031978] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:05,601 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889417443] [2021-06-05 23:23:05,601 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 23:23:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:05,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 23:23:05,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:05,673 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889417443] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:05,673 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:05,673 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2021-06-05 23:23:05,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510648548] [2021-06-05 23:23:05,673 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 23:23:05,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:05,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 23:23:05,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-06-05 23:23:05,674 INFO L87 Difference]: Start difference. First operand 61524 states and 229463 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:06,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:06,476 INFO L93 Difference]: Finished difference Result 86856 states and 315465 transitions. [2021-06-05 23:23:06,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 23:23:06,481 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:23:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:06,713 INFO L225 Difference]: With dead ends: 86856 [2021-06-05 23:23:06,713 INFO L226 Difference]: Without dead ends: 86161 [2021-06-05 23:23:06,713 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 75.6ms TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2021-06-05 23:23:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86161 states. [2021-06-05 23:23:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86161 to 38467. [2021-06-05 23:23:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38467 states, 38466 states have (on average 3.565486403577185) internal successors, (137150), 38466 states have internal predecessors, (137150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38467 states to 38467 states and 137150 transitions. [2021-06-05 23:23:07,797 INFO L78 Accepts]: Start accepts. Automaton has 38467 states and 137150 transitions. Word has length 32 [2021-06-05 23:23:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:07,797 INFO L482 AbstractCegarLoop]: Abstraction has 38467 states and 137150 transitions. [2021-06-05 23:23:07,797 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:07,797 INFO L276 IsEmpty]: Start isEmpty. Operand 38467 states and 137150 transitions. [2021-06-05 23:23:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:23:08,009 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:08,009 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:08,210 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2021-06-05 23:23:08,210 INFO L430 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:08,210 INFO L82 PathProgramCache]: Analyzing trace with hash 166970331, now seen corresponding path program 56 times [2021-06-05 23:23:08,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:08,210 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371784351] [2021-06-05 23:23:08,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:08,245 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:08,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371784351] [2021-06-05 23:23:08,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371784351] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:08,245 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483778620] [2021-06-05 23:23:08,245 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 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 23:23:08,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:23:08,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:08,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:08,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:08,354 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483778620] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:08,354 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:08,354 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2021-06-05 23:23:08,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174068860] [2021-06-05 23:23:08,355 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 23:23:08,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:08,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 23:23:08,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-06-05 23:23:08,356 INFO L87 Difference]: Start difference. First operand 38467 states and 137150 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:09,804 INFO L93 Difference]: Finished difference Result 62512 states and 209555 transitions. [2021-06-05 23:23:09,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-06-05 23:23:09,804 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:23:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:09,947 INFO L225 Difference]: With dead ends: 62512 [2021-06-05 23:23:09,947 INFO L226 Difference]: Without dead ends: 62362 [2021-06-05 23:23:09,947 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 651.2ms TimeCoverageRelationStatistics Valid=1342, Invalid=4978, Unknown=0, NotChecked=0, Total=6320 [2021-06-05 23:23:10,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62362 states. [2021-06-05 23:23:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62362 to 32903. [2021-06-05 23:23:10,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32903 states, 32902 states have (on average 3.5405446477417786) internal successors, (116491), 32902 states have internal predecessors, (116491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32903 states to 32903 states and 116491 transitions. [2021-06-05 23:23:10,883 INFO L78 Accepts]: Start accepts. Automaton has 32903 states and 116491 transitions. Word has length 32 [2021-06-05 23:23:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:10,884 INFO L482 AbstractCegarLoop]: Abstraction has 32903 states and 116491 transitions. [2021-06-05 23:23:10,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 32903 states and 116491 transitions. [2021-06-05 23:23:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:23:10,912 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:10,912 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:11,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2021-06-05 23:23:11,113 INFO L430 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:11,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:11,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1382004005, now seen corresponding path program 57 times [2021-06-05 23:23:11,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:11,117 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537269354] [2021-06-05 23:23:11,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:23:11,143 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:11,143 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537269354] [2021-06-05 23:23:11,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537269354] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:11,143 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85075746] [2021-06-05 23:23:11,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:23:11,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-06-05 23:23:11,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:11,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 23:23:11,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:11,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:23:11,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85075746] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:11,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:11,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2021-06-05 23:23:11,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269146154] [2021-06-05 23:23:11,227 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 23:23:11,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:11,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 23:23:11,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-06-05 23:23:11,227 INFO L87 Difference]: Start difference. First operand 32903 states and 116491 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:12,201 INFO L93 Difference]: Finished difference Result 66122 states and 229791 transitions. [2021-06-05 23:23:12,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 23:23:12,202 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:23:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:12,357 INFO L225 Difference]: With dead ends: 66122 [2021-06-05 23:23:12,357 INFO L226 Difference]: Without dead ends: 65932 [2021-06-05 23:23:12,358 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 311.4ms TimeCoverageRelationStatistics Valid=542, Invalid=1714, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 23:23:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65932 states. [2021-06-05 23:23:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65932 to 46285. [2021-06-05 23:23:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46285 states, 46284 states have (on average 3.584024716964826) internal successors, (165883), 46284 states have internal predecessors, (165883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46285 states to 46285 states and 165883 transitions. [2021-06-05 23:23:13,418 INFO L78 Accepts]: Start accepts. Automaton has 46285 states and 165883 transitions. Word has length 32 [2021-06-05 23:23:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:13,418 INFO L482 AbstractCegarLoop]: Abstraction has 46285 states and 165883 transitions. [2021-06-05 23:23:13,418 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 46285 states and 165883 transitions. [2021-06-05 23:23:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:23:13,466 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:13,466 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:13,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:23:13,668 INFO L430 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:13,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:13,672 INFO L82 PathProgramCache]: Analyzing trace with hash 181653621, now seen corresponding path program 58 times [2021-06-05 23:23:13,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:13,672 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243638821] [2021-06-05 23:23:13,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:23:13,689 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:13,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243638821] [2021-06-05 23:23:13,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243638821] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:13,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330165200] [2021-06-05 23:23:13,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 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 23:23:13,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:23:13,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:13,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:13,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:13,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330165200] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:13,751 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:13,751 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2021-06-05 23:23:13,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690074140] [2021-06-05 23:23:13,751 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 23:23:13,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:13,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 23:23:13,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 23:23:13,751 INFO L87 Difference]: Start difference. First operand 46285 states and 165883 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:14,305 INFO L93 Difference]: Finished difference Result 69367 states and 244742 transitions. [2021-06-05 23:23:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 23:23:14,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:23:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:14,486 INFO L225 Difference]: With dead ends: 69367 [2021-06-05 23:23:14,487 INFO L226 Difference]: Without dead ends: 69341 [2021-06-05 23:23:14,487 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 23.8ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-06-05 23:23:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69341 states. [2021-06-05 23:23:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69341 to 62799. [2021-06-05 23:23:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62799 states, 62798 states have (on average 3.5969776107519347) internal successors, (225883), 62798 states have internal predecessors, (225883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62799 states to 62799 states and 225883 transitions. [2021-06-05 23:23:15,991 INFO L78 Accepts]: Start accepts. Automaton has 62799 states and 225883 transitions. Word has length 32 [2021-06-05 23:23:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:15,991 INFO L482 AbstractCegarLoop]: Abstraction has 62799 states and 225883 transitions. [2021-06-05 23:23:15,991 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 62799 states and 225883 transitions. [2021-06-05 23:23:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-06-05 23:23:16,061 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:16,061 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:16,262 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2021-06-05 23:23:16,262 INFO L430 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:16,262 INFO L82 PathProgramCache]: Analyzing trace with hash 991552283, now seen corresponding path program 59 times [2021-06-05 23:23:16,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:16,262 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721314767] [2021-06-05 23:23:16,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:23:16,565 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:16,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721314767] [2021-06-05 23:23:16,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721314767] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:16,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594100218] [2021-06-05 23:23:16,566 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:23:16,625 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 23:23:16,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:16,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:16,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:16,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594100218] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:16,662 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:16,662 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 7 [2021-06-05 23:23:16,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942028944] [2021-06-05 23:23:16,662 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 23:23:16,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:16,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 23:23:16,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-06-05 23:23:16,662 INFO L87 Difference]: Start difference. First operand 62799 states and 225883 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:17,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:17,057 INFO L93 Difference]: Finished difference Result 67770 states and 240391 transitions. [2021-06-05 23:23:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 23:23:17,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-06-05 23:23:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:17,222 INFO L225 Difference]: With dead ends: 67770 [2021-06-05 23:23:17,222 INFO L226 Difference]: Without dead ends: 67754 [2021-06-05 23:23:17,222 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 81.0ms TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2021-06-05 23:23:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67754 states. [2021-06-05 23:23:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67754 to 62924. [2021-06-05 23:23:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62924 states, 62923 states have (on average 3.5905630691480064) internal successors, (225929), 62923 states have internal predecessors, (225929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62924 states to 62924 states and 225929 transitions. [2021-06-05 23:23:18,885 INFO L78 Accepts]: Start accepts. Automaton has 62924 states and 225929 transitions. Word has length 32 [2021-06-05 23:23:18,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:18,885 INFO L482 AbstractCegarLoop]: Abstraction has 62924 states and 225929 transitions. [2021-06-05 23:23:18,885 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 62924 states and 225929 transitions. [2021-06-05 23:23:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-06-05 23:23:18,956 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:18,956 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:19,157 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129,62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:23:19,157 INFO L430 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1602509483, now seen corresponding path program 60 times [2021-06-05 23:23:19,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:19,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7197273] [2021-06-05 23:23:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 23:23:19,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:19,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7197273] [2021-06-05 23:23:19,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7197273] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:19,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500296668] [2021-06-05 23:23:19,190 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 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 23:23:19,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-05 23:23:19,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:19,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:19,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:19,261 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 23:23:19,261 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500296668] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:19,261 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:19,261 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 23:23:19,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272388350] [2021-06-05 23:23:19,261 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 23:23:19,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:19,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 23:23:19,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 23:23:19,262 INFO L87 Difference]: Start difference. First operand 62924 states and 225929 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:19,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:19,900 INFO L93 Difference]: Finished difference Result 101393 states and 366566 transitions. [2021-06-05 23:23:19,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 23:23:19,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-06-05 23:23:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:20,208 INFO L225 Difference]: With dead ends: 101393 [2021-06-05 23:23:20,208 INFO L226 Difference]: Without dead ends: 100289 [2021-06-05 23:23:20,208 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 48.6ms TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-06-05 23:23:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100289 states. [2021-06-05 23:23:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100289 to 96675. [2021-06-05 23:23:22,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96675 states, 96674 states have (on average 3.5802801166808034) internal successors, (346120), 96674 states have internal predecessors, (346120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96675 states to 96675 states and 346120 transitions. [2021-06-05 23:23:22,814 INFO L78 Accepts]: Start accepts. Automaton has 96675 states and 346120 transitions. Word has length 33 [2021-06-05 23:23:22,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:22,815 INFO L482 AbstractCegarLoop]: Abstraction has 96675 states and 346120 transitions. [2021-06-05 23:23:22,815 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:22,815 INFO L276 IsEmpty]: Start isEmpty. Operand 96675 states and 346120 transitions. [2021-06-05 23:23:22,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-06-05 23:23:22,912 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:22,912 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:23,113 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:23:23,113 INFO L430 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:23,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:23,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1963622161, now seen corresponding path program 61 times [2021-06-05 23:23:23,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:23,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857413930] [2021-06-05 23:23:23,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:23:23,160 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:23,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857413930] [2021-06-05 23:23:23,160 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857413930] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:23,160 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440987393] [2021-06-05 23:23:23,160 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 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 23:23:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:23,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 23:23:23,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 23:23:23,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440987393] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:23,224 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:23,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2021-06-05 23:23:23,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107763899] [2021-06-05 23:23:23,224 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 23:23:23,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:23,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 23:23:23,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 23:23:23,224 INFO L87 Difference]: Start difference. First operand 96675 states and 346120 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:24,458 INFO L93 Difference]: Finished difference Result 158885 states and 567488 transitions. [2021-06-05 23:23:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 23:23:24,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-06-05 23:23:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:24,959 INFO L225 Difference]: With dead ends: 158885 [2021-06-05 23:23:24,959 INFO L226 Difference]: Without dead ends: 155743 [2021-06-05 23:23:24,959 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 47.6ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 23:23:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155743 states. [2021-06-05 23:23:28,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155743 to 151324. [2021-06-05 23:23:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151324 states, 151323 states have (on average 3.541411417960257) internal successors, (535897), 151323 states have internal predecessors, (535897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151324 states to 151324 states and 535897 transitions. [2021-06-05 23:23:28,679 INFO L78 Accepts]: Start accepts. Automaton has 151324 states and 535897 transitions. Word has length 33 [2021-06-05 23:23:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:28,679 INFO L482 AbstractCegarLoop]: Abstraction has 151324 states and 535897 transitions. [2021-06-05 23:23:28,679 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 151324 states and 535897 transitions. [2021-06-05 23:23:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-06-05 23:23:28,809 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:28,809 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:29,009 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:23:29,010 INFO L430 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:29,010 INFO L82 PathProgramCache]: Analyzing trace with hash -583238421, now seen corresponding path program 62 times [2021-06-05 23:23:29,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:29,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910445295] [2021-06-05 23:23:29,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:23:29,048 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:29,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910445295] [2021-06-05 23:23:29,048 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910445295] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:29,048 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440208367] [2021-06-05 23:23:29,048 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 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 23:23:29,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:23:29,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:29,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:29,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:29,144 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 23:23:29,145 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440208367] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:29,145 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:29,145 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2021-06-05 23:23:29,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807422744] [2021-06-05 23:23:29,145 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 23:23:29,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:29,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 23:23:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-06-05 23:23:29,145 INFO L87 Difference]: Start difference. First operand 151324 states and 535897 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:29,630 WARN L205 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2021-06-05 23:23:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:30,763 INFO L93 Difference]: Finished difference Result 73830 states and 259251 transitions. [2021-06-05 23:23:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-06-05 23:23:30,764 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-06-05 23:23:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:30,954 INFO L225 Difference]: With dead ends: 73830 [2021-06-05 23:23:30,954 INFO L226 Difference]: Without dead ends: 73783 [2021-06-05 23:23:30,955 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1391 ImplicationChecksByTransitivity, 1055.6ms TimeCoverageRelationStatistics Valid=918, Invalid=2988, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 23:23:31,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73783 states. [2021-06-05 23:23:32,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73783 to 50528. [2021-06-05 23:23:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50528 states, 50527 states have (on average 3.63951946484058) internal successors, (183894), 50527 states have internal predecessors, (183894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50528 states to 50528 states and 183894 transitions. [2021-06-05 23:23:32,654 INFO L78 Accepts]: Start accepts. Automaton has 50528 states and 183894 transitions. Word has length 33 [2021-06-05 23:23:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:32,654 INFO L482 AbstractCegarLoop]: Abstraction has 50528 states and 183894 transitions. [2021-06-05 23:23:32,654 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 50528 states and 183894 transitions. [2021-06-05 23:23:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-06-05 23:23:32,714 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:32,714 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:32,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:23:32,915 INFO L430 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:32,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:32,915 INFO L82 PathProgramCache]: Analyzing trace with hash 815112445, now seen corresponding path program 63 times [2021-06-05 23:23:32,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:32,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33232294] [2021-06-05 23:23:32,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 23:23:32,950 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:32,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33232294] [2021-06-05 23:23:32,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33232294] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:32,950 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982175480] [2021-06-05 23:23:32,950 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-06-05 23:23:32,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 23:23:32,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:23:32,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:32,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 23:23:33,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982175480] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:33,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:33,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2021-06-05 23:23:33,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323522586] [2021-06-05 23:23:33,026 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 23:23:33,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:33,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 23:23:33,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-05 23:23:33,027 INFO L87 Difference]: Start difference. First operand 50528 states and 183894 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:33,380 INFO L93 Difference]: Finished difference Result 67328 states and 238782 transitions. [2021-06-05 23:23:33,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 23:23:33,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-06-05 23:23:33,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:33,538 INFO L225 Difference]: With dead ends: 67328 [2021-06-05 23:23:33,538 INFO L226 Difference]: Without dead ends: 67317 [2021-06-05 23:23:33,538 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 35.7ms TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2021-06-05 23:23:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67317 states. [2021-06-05 23:23:34,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67317 to 50483. [2021-06-05 23:23:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50483 states, 50482 states have (on average 3.639277366189929) internal successors, (183718), 50482 states have internal predecessors, (183718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:34,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50483 states to 50483 states and 183718 transitions. [2021-06-05 23:23:34,831 INFO L78 Accepts]: Start accepts. Automaton has 50483 states and 183718 transitions. Word has length 34 [2021-06-05 23:23:34,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:34,831 INFO L482 AbstractCegarLoop]: Abstraction has 50483 states and 183718 transitions. [2021-06-05 23:23:34,831 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 50483 states and 183718 transitions. [2021-06-05 23:23:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-06-05 23:23:34,893 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:34,893 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:35,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2021-06-05 23:23:35,097 INFO L430 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:35,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1120487123, now seen corresponding path program 64 times [2021-06-05 23:23:35,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:35,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631608631] [2021-06-05 23:23:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:35,120 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:35,120 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:35,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631608631] [2021-06-05 23:23:35,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631608631] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:35,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967654641] [2021-06-05 23:23:35,120 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 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 23:23:35,146 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:23:35,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:35,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:35,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:35,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967654641] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:35,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:35,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2021-06-05 23:23:35,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377889506] [2021-06-05 23:23:35,185 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 23:23:35,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:35,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 23:23:35,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-06-05 23:23:35,186 INFO L87 Difference]: Start difference. First operand 50483 states and 183718 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:35,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:35,759 INFO L93 Difference]: Finished difference Result 60966 states and 217660 transitions. [2021-06-05 23:23:35,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 23:23:35,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-06-05 23:23:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:35,916 INFO L225 Difference]: With dead ends: 60966 [2021-06-05 23:23:35,916 INFO L226 Difference]: Without dead ends: 60900 [2021-06-05 23:23:35,917 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 41.2ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 23:23:35,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60900 states. [2021-06-05 23:23:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60900 to 56017. [2021-06-05 23:23:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56017 states, 56016 states have (on average 3.6197157954870036) internal successors, (202762), 56016 states have internal predecessors, (202762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56017 states to 56017 states and 202762 transitions. [2021-06-05 23:23:37,256 INFO L78 Accepts]: Start accepts. Automaton has 56017 states and 202762 transitions. Word has length 35 [2021-06-05 23:23:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:37,256 INFO L482 AbstractCegarLoop]: Abstraction has 56017 states and 202762 transitions. [2021-06-05 23:23:37,256 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 56017 states and 202762 transitions. [2021-06-05 23:23:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-06-05 23:23:37,316 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:37,317 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:37,518 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2021-06-05 23:23:37,519 INFO L430 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:37,519 INFO L82 PathProgramCache]: Analyzing trace with hash -78377335, now seen corresponding path program 65 times [2021-06-05 23:23:37,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:37,519 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003418402] [2021-06-05 23:23:37,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:37,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:37,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003418402] [2021-06-05 23:23:37,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003418402] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:37,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418987266] [2021-06-05 23:23:37,548 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 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 23:23:37,580 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-05 23:23:37,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:37,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:37,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 23:23:37,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418987266] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:37,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:37,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 9 [2021-06-05 23:23:37,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182360981] [2021-06-05 23:23:37,625 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 23:23:37,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:37,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 23:23:37,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 23:23:37,626 INFO L87 Difference]: Start difference. First operand 56017 states and 202762 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:38,817 INFO L93 Difference]: Finished difference Result 118073 states and 409632 transitions. [2021-06-05 23:23:38,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 23:23:38,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-06-05 23:23:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:39,156 INFO L225 Difference]: With dead ends: 118073 [2021-06-05 23:23:39,156 INFO L226 Difference]: Without dead ends: 117995 [2021-06-05 23:23:39,157 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 212.7ms TimeCoverageRelationStatistics Valid=346, Invalid=844, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 23:23:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117995 states. [2021-06-05 23:23:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117995 to 88498. [2021-06-05 23:23:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88498 states, 88497 states have (on average 3.63666564968304) internal successors, (321834), 88497 states have internal predecessors, (321834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88498 states to 88498 states and 321834 transitions. [2021-06-05 23:23:41,708 INFO L78 Accepts]: Start accepts. Automaton has 88498 states and 321834 transitions. Word has length 35 [2021-06-05 23:23:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:41,708 INFO L482 AbstractCegarLoop]: Abstraction has 88498 states and 321834 transitions. [2021-06-05 23:23:41,708 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 88498 states and 321834 transitions. [2021-06-05 23:23:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-06-05 23:23:41,787 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:41,787 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:41,988 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2021-06-05 23:23:41,988 INFO L430 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:41,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:41,988 INFO L82 PathProgramCache]: Analyzing trace with hash 555519681, now seen corresponding path program 66 times [2021-06-05 23:23:41,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:41,989 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427022020] [2021-06-05 23:23:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:42,027 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:42,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427022020] [2021-06-05 23:23:42,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427022020] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:42,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938096112] [2021-06-05 23:23:42,027 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 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 23:23:42,063 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 23:23:42,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:42,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:42,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:42,112 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938096112] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:42,112 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:42,112 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2021-06-05 23:23:42,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921304446] [2021-06-05 23:23:42,112 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 23:23:42,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:42,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 23:23:42,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-06-05 23:23:42,112 INFO L87 Difference]: Start difference. First operand 88498 states and 321834 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:43,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:43,516 INFO L93 Difference]: Finished difference Result 122190 states and 421034 transitions. [2021-06-05 23:23:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 23:23:43,516 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-06-05 23:23:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:43,860 INFO L225 Difference]: With dead ends: 122190 [2021-06-05 23:23:43,860 INFO L226 Difference]: Without dead ends: 122034 [2021-06-05 23:23:43,861 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 263.9ms TimeCoverageRelationStatistics Valid=481, Invalid=1159, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 23:23:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122034 states. [2021-06-05 23:23:45,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122034 to 77938. [2021-06-05 23:23:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77938 states, 77937 states have (on average 3.6076061434235345) internal successors, (281166), 77937 states have internal predecessors, (281166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77938 states to 77938 states and 281166 transitions. [2021-06-05 23:23:46,329 INFO L78 Accepts]: Start accepts. Automaton has 77938 states and 281166 transitions. Word has length 35 [2021-06-05 23:23:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:46,330 INFO L482 AbstractCegarLoop]: Abstraction has 77938 states and 281166 transitions. [2021-06-05 23:23:46,330 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 77938 states and 281166 transitions. [2021-06-05 23:23:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-06-05 23:23:46,396 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:46,396 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:46,596 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2021-06-05 23:23:46,596 INFO L430 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:46,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash 742728831, now seen corresponding path program 67 times [2021-06-05 23:23:46,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:46,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619877881] [2021-06-05 23:23:46,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:46,629 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:46,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619877881] [2021-06-05 23:23:46,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619877881] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:46,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891679680] [2021-06-05 23:23:46,629 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 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 23:23:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:46,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:46,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 23:23:46,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891679680] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:46,702 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:46,702 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2021-06-05 23:23:46,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258254438] [2021-06-05 23:23:46,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 23:23:46,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:46,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 23:23:46,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-06-05 23:23:46,703 INFO L87 Difference]: Start difference. First operand 77938 states and 281166 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:47,113 INFO L93 Difference]: Finished difference Result 80312 states and 287928 transitions. [2021-06-05 23:23:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 23:23:47,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-06-05 23:23:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:47,716 INFO L225 Difference]: With dead ends: 80312 [2021-06-05 23:23:47,716 INFO L226 Difference]: Without dead ends: 80041 [2021-06-05 23:23:47,716 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 36.6ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-06-05 23:23:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80041 states. [2021-06-05 23:23:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80041 to 75729. [2021-06-05 23:23:49,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75729 states, 75728 states have (on average 3.5912872385379253) internal successors, (271961), 75728 states have internal predecessors, (271961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75729 states to 75729 states and 271961 transitions. [2021-06-05 23:23:49,421 INFO L78 Accepts]: Start accepts. Automaton has 75729 states and 271961 transitions. Word has length 35 [2021-06-05 23:23:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:49,421 INFO L482 AbstractCegarLoop]: Abstraction has 75729 states and 271961 transitions. [2021-06-05 23:23:49,421 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 75729 states and 271961 transitions. [2021-06-05 23:23:49,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-06-05 23:23:49,487 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:49,487 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:49,687 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:23:49,688 INFO L430 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:49,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:49,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1005636645, now seen corresponding path program 68 times [2021-06-05 23:23:49,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:49,688 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793387582] [2021-06-05 23:23:49,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:49,729 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:49,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793387582] [2021-06-05 23:23:49,729 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793387582] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:49,729 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868890318] [2021-06-05 23:23:49,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:23:49,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:23:49,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:49,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:49,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:49,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868890318] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:49,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:49,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-06-05 23:23:49,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846079504] [2021-06-05 23:23:49,801 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 23:23:49,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 23:23:49,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-05 23:23:49,802 INFO L87 Difference]: Start difference. First operand 75729 states and 271961 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:50,267 INFO L93 Difference]: Finished difference Result 83624 states and 298075 transitions. [2021-06-05 23:23:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 23:23:50,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-06-05 23:23:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:50,933 INFO L225 Difference]: With dead ends: 83624 [2021-06-05 23:23:50,933 INFO L226 Difference]: Without dead ends: 83624 [2021-06-05 23:23:50,933 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 58.2ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-06-05 23:23:51,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83624 states. [2021-06-05 23:23:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83624 to 80321. [2021-06-05 23:23:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80321 states, 80320 states have (on average 3.585520418326693) internal successors, (287989), 80320 states have internal predecessors, (287989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:52,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80321 states to 80321 states and 287989 transitions. [2021-06-05 23:23:52,574 INFO L78 Accepts]: Start accepts. Automaton has 80321 states and 287989 transitions. Word has length 35 [2021-06-05 23:23:52,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:52,574 INFO L482 AbstractCegarLoop]: Abstraction has 80321 states and 287989 transitions. [2021-06-05 23:23:52,574 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 80321 states and 287989 transitions. [2021-06-05 23:23:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-06-05 23:23:52,635 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:52,635 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:52,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2021-06-05 23:23:52,835 INFO L430 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:52,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1649480959, now seen corresponding path program 69 times [2021-06-05 23:23:52,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:52,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696520492] [2021-06-05 23:23:52,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:52,855 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:52,855 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696520492] [2021-06-05 23:23:52,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696520492] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:52,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436808773] [2021-06-05 23:23:52,856 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 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 23:23:52,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 23:23:52,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:23:52,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2021-06-05 23:23:52,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 23:23:52,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436808773] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:52,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:52,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2021-06-05 23:23:52,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460451297] [2021-06-05 23:23:52,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 23:23:52,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:52,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 23:23:52,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-06-05 23:23:52,942 INFO L87 Difference]: Start difference. First operand 80321 states and 287989 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:23:54,580 INFO L93 Difference]: Finished difference Result 101331 states and 352560 transitions. [2021-06-05 23:23:54,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-05 23:23:54,580 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-06-05 23:23:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:23:54,863 INFO L225 Difference]: With dead ends: 101331 [2021-06-05 23:23:54,863 INFO L226 Difference]: Without dead ends: 101208 [2021-06-05 23:23:54,870 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1635 ImplicationChecksByTransitivity, 442.9ms TimeCoverageRelationStatistics Valid=897, Invalid=3659, Unknown=0, NotChecked=0, Total=4556 [2021-06-05 23:23:54,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101208 states. [2021-06-05 23:23:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101208 to 87809. [2021-06-05 23:23:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87809 states, 87808 states have (on average 3.5959252004373177) internal successors, (315751), 87808 states have internal predecessors, (315751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87809 states to 87809 states and 315751 transitions. [2021-06-05 23:23:58,035 INFO L78 Accepts]: Start accepts. Automaton has 87809 states and 315751 transitions. Word has length 35 [2021-06-05 23:23:58,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:23:58,036 INFO L482 AbstractCegarLoop]: Abstraction has 87809 states and 315751 transitions. [2021-06-05 23:23:58,036 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:23:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 87809 states and 315751 transitions. [2021-06-05 23:23:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:23:58,136 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:23:58,136 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:23:58,352 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2021-06-05 23:23:58,352 INFO L430 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:23:58,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:23:58,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1631568121, now seen corresponding path program 70 times [2021-06-05 23:23:58,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:23:58,352 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821273227] [2021-06-05 23:23:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:23:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:23:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:23:58,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:23:58,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821273227] [2021-06-05 23:23:58,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821273227] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:58,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917230641] [2021-06-05 23:23:58,709 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-06-05 23:23:58,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:23:58,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:23:58,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:23:58,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:23:58,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:23:58,890 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:23:58,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:23:58,910 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:23:58,910 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:47 [2021-06-05 23:23:59,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-06-05 23:23:59,007 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:23:59,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:23:59,020 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:23:59,021 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:68 [2021-06-05 23:23:59,120 INFO L446 ElimStorePlain]: Different costs {3=[v_C_81], 12=[A, B]} [2021-06-05 23:23:59,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2021-06-05 23:23:59,126 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:23:59,140 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:23:59,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:23:59,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:23:59,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 56 [2021-06-05 23:23:59,147 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:23:59,154 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:23:59,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,158 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:23:59,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:23:59,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:23:59,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2021-06-05 23:23:59,164 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:23:59,169 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:23:59,170 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:23:59,170 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:87, output treesize:35 [2021-06-05 23:23:59,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:23:59,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:23:59,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:23:59,237 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:23:59,237 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:23:59,255 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:23:59,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917230641] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:23:59,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:23:59,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-06-05 23:23:59,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969908291] [2021-06-05 23:23:59,255 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:23:59,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:23:59,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:23:59,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:23:59,256 INFO L87 Difference]: Start difference. First operand 87809 states and 315751 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:24:00,505 INFO L93 Difference]: Finished difference Result 88427 states and 317563 transitions. [2021-06-05 23:24:00,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 23:24:00,506 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:24:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:24:00,710 INFO L225 Difference]: With dead ends: 88427 [2021-06-05 23:24:00,711 INFO L226 Difference]: Without dead ends: 88378 [2021-06-05 23:24:00,711 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 586.4ms TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2021-06-05 23:24:00,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88378 states. [2021-06-05 23:24:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88378 to 87916. [2021-06-05 23:24:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87916 states, 87915 states have (on average 3.5953136552351705) internal successors, (316082), 87915 states have internal predecessors, (316082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87916 states to 87916 states and 316082 transitions. [2021-06-05 23:24:02,513 INFO L78 Accepts]: Start accepts. Automaton has 87916 states and 316082 transitions. Word has length 37 [2021-06-05 23:24:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:24:02,513 INFO L482 AbstractCegarLoop]: Abstraction has 87916 states and 316082 transitions. [2021-06-05 23:24:02,514 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 87916 states and 316082 transitions. [2021-06-05 23:24:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:24:02,621 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:24:02,621 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:24:02,821 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:24:02,822 INFO L430 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:24:02,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:24:02,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1480173021, now seen corresponding path program 71 times [2021-06-05 23:24:02,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:24:02,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930520599] [2021-06-05 23:24:02,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:24:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:03,040 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:24:03,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930520599] [2021-06-05 23:24:03,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930520599] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:03,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475375918] [2021-06-05 23:24:03,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 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 23:24:03,068 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 23:24:03,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:24:03,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:24:03,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:24:03,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:24:03,183 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:03,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:03,197 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 1 xjuncts. [2021-06-05 23:24:03,197 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:53 [2021-06-05 23:24:03,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:03,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2021-06-05 23:24:03,345 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:03,361 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:03,363 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 1 xjuncts. [2021-06-05 23:24:03,363 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:72 [2021-06-05 23:24:03,424 INFO L446 ElimStorePlain]: Different costs {3=[v_C_84], 12=[A, B]} [2021-06-05 23:24:03,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-06-05 23:24:03,431 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:03,451 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:03,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:03,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:03,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:03,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2021-06-05 23:24:03,459 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:03,471 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:03,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,474 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:03,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,475 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:03,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:03,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2021-06-05 23:24:03,478 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:03,486 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:03,487 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:24:03,487 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:84, output treesize:31 [2021-06-05 23:24:03,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:03,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:03,588 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:03,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2021-06-05 23:24:03,589 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:03,592 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:03,593 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:03,593 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:5 [2021-06-05 23:24:03,981 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:03,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475375918] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:03,981 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:24:03,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2021-06-05 23:24:03,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551750246] [2021-06-05 23:24:03,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:24:03,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:24:03,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:24:03,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:24:03,982 INFO L87 Difference]: Start difference. First operand 87916 states and 316082 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:24:05,245 INFO L93 Difference]: Finished difference Result 88493 states and 317776 transitions. [2021-06-05 23:24:05,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 23:24:05,245 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:24:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:24:05,478 INFO L225 Difference]: With dead ends: 88493 [2021-06-05 23:24:05,478 INFO L226 Difference]: Without dead ends: 88417 [2021-06-05 23:24:05,478 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 636.3ms TimeCoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2021-06-05 23:24:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88417 states. [2021-06-05 23:24:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88417 to 87893. [2021-06-05 23:24:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87893 states, 87892 states have (on average 3.5957538797615256) internal successors, (316038), 87892 states have internal predecessors, (316038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87893 states to 87893 states and 316038 transitions. [2021-06-05 23:24:07,578 INFO L78 Accepts]: Start accepts. Automaton has 87893 states and 316038 transitions. Word has length 37 [2021-06-05 23:24:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:24:07,578 INFO L482 AbstractCegarLoop]: Abstraction has 87893 states and 316038 transitions. [2021-06-05 23:24:07,578 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 87893 states and 316038 transitions. [2021-06-05 23:24:07,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:24:07,674 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:24:07,674 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:24:07,875 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:24:07,875 INFO L430 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:24:07,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:24:07,878 INFO L82 PathProgramCache]: Analyzing trace with hash 909842105, now seen corresponding path program 72 times [2021-06-05 23:24:07,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:24:07,878 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755341651] [2021-06-05 23:24:07,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:24:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:08,116 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:24:08,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755341651] [2021-06-05 23:24:08,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755341651] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:08,116 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085455432] [2021-06-05 23:24:08,116 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 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 23:24:08,145 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 23:24:08,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:24:08,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 23:24:08,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:24:08,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:24:08,310 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:08,322 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:08,323 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 1 xjuncts. [2021-06-05 23:24:08,323 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:59 [2021-06-05 23:24:08,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:08,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:24:08,385 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:08,401 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:08,404 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 1 xjuncts. [2021-06-05 23:24:08,404 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:76 [2021-06-05 23:24:08,626 INFO L446 ElimStorePlain]: Different costs {3=[v_C_87], 7=[A, B]} [2021-06-05 23:24:08,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:08,630 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:08,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2021-06-05 23:24:08,631 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:08,648 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:08,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:08,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:08,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:08,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:08,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:08,666 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:08,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2021-06-05 23:24:08,667 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:08,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:08,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:08,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:08,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:08,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:08,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:08,682 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:08,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2021-06-05 23:24:08,685 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:08,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:08,693 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:08,693 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:85, output treesize:27 [2021-06-05 23:24:08,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:24:08,732 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:08,734 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:08,734 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:08,734 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:24:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:08,753 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085455432] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:08,753 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:24:08,753 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2021-06-05 23:24:08,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186041251] [2021-06-05 23:24:08,753 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:24:08,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:24:08,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:24:08,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:24:08,753 INFO L87 Difference]: Start difference. First operand 87893 states and 316038 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:24:10,872 INFO L93 Difference]: Finished difference Result 88599 states and 318079 transitions. [2021-06-05 23:24:10,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 23:24:10,872 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:24:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:24:11,087 INFO L225 Difference]: With dead ends: 88599 [2021-06-05 23:24:11,087 INFO L226 Difference]: Without dead ends: 88523 [2021-06-05 23:24:11,087 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 931.9ms TimeCoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2021-06-05 23:24:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88523 states. [2021-06-05 23:24:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88523 to 87951. [2021-06-05 23:24:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87951 states, 87950 states have (on average 3.5954064809550883) internal successors, (316216), 87950 states have internal predecessors, (316216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87951 states to 87951 states and 316216 transitions. [2021-06-05 23:24:12,716 INFO L78 Accepts]: Start accepts. Automaton has 87951 states and 316216 transitions. Word has length 37 [2021-06-05 23:24:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:24:12,716 INFO L482 AbstractCegarLoop]: Abstraction has 87951 states and 316216 transitions. [2021-06-05 23:24:12,716 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 87951 states and 316216 transitions. [2021-06-05 23:24:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:24:12,806 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:24:12,806 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forcibly destroying the process [2021-06-05 23:24:13,136 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:24:13,136 INFO L430 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:24:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:24:13,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2093068259, now seen corresponding path program 73 times [2021-06-05 23:24:13,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:24:13,137 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088181222] [2021-06-05 23:24:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] The stream was forcibly closed: stdIn [2021-06-05 23:24:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:13,434 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:24:13,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088181222] [2021-06-05 23:24:13,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088181222] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:13,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749126735] [2021-06-05 23:24:13,434 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 23:24:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:13,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:24:13,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:24:13,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:24:13,557 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:13,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:13,567 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:13,567 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:47 [2021-06-05 23:24:13,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:13,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:24:13,603 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:13,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:13,615 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:13,615 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:64 [2021-06-05 23:24:13,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2021-06-05 23:24:13,691 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:13,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:13,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-06-05 23:24:13,699 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:13,703 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:13,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2021-06-05 23:24:13,705 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:13,709 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:13,709 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:13,709 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:67, output treesize:23 [2021-06-05 23:24:13,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:24:13,766 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:13,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:13,767 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:13,767 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:24:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:13,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749126735] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:13,785 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:24:13,785 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-06-05 23:24:13,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123898250] [2021-06-05 23:24:13,786 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:24:13,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:24:13,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:24:13,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:24:13,786 INFO L87 Difference]: Start difference. First operand 87951 states and 316216 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:24:14,929 INFO L93 Difference]: Finished difference Result 88564 states and 318014 transitions. [2021-06-05 23:24:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 23:24:14,930 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:24:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:24:15,153 INFO L225 Difference]: With dead ends: 88564 [2021-06-05 23:24:15,153 INFO L226 Difference]: Without dead ends: 88488 [2021-06-05 23:24:15,153 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 558.4ms TimeCoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2021-06-05 23:24:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88488 states. [2021-06-05 23:24:16,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88488 to 87933. [2021-06-05 23:24:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87933 states, 87932 states have (on average 3.5955965973706956) internal successors, (316168), 87932 states have internal predecessors, (316168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87933 states to 87933 states and 316168 transitions. [2021-06-05 23:24:17,038 INFO L78 Accepts]: Start accepts. Automaton has 87933 states and 316168 transitions. Word has length 37 [2021-06-05 23:24:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:24:17,038 INFO L482 AbstractCegarLoop]: Abstraction has 87933 states and 316168 transitions. [2021-06-05 23:24:17,038 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 87933 states and 316168 transitions. [2021-06-05 23:24:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:24:17,128 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:24:17,128 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:24:17,328 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:24:17,328 INFO L430 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:24:17,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:24:17,329 INFO L82 PathProgramCache]: Analyzing trace with hash 351064743, now seen corresponding path program 74 times [2021-06-05 23:24:17,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:24:17,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672262748] [2021-06-05 23:24:17,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:24:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:17,661 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:24:17,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672262748] [2021-06-05 23:24:17,661 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672262748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:17,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175475190] [2021-06-05 23:24:17,661 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 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 23:24:17,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:24:17,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:24:17,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:24:17,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:24:17,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:24:17,789 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:17,799 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:17,799 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:17,799 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:47 [2021-06-05 23:24:17,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:17,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:24:17,841 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:17,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:17,853 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:17,853 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:64 [2021-06-05 23:24:17,899 INFO L446 ElimStorePlain]: Different costs {3=[v_C_93], 12=[A, B]} [2021-06-05 23:24:17,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:17,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:17,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:17,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2021-06-05 23:24:17,905 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:17,917 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:17,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:17,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:17,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:17,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:17,921 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:17,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2021-06-05 23:24:17,923 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:17,929 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:17,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:17,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:17,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:17,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:17,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:17,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2021-06-05 23:24:17,936 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:17,940 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:17,941 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:17,941 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:25 [2021-06-05 23:24:18,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2021-06-05 23:24:18,023 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:18,025 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:18,025 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:18,026 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:11 [2021-06-05 23:24:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:18,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175475190] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:18,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:24:18,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2021-06-05 23:24:18,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798838401] [2021-06-05 23:24:18,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 23:24:18,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:24:18,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 23:24:18,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2021-06-05 23:24:18,047 INFO L87 Difference]: Start difference. First operand 87933 states and 316168 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:24:19,811 INFO L93 Difference]: Finished difference Result 88594 states and 318112 transitions. [2021-06-05 23:24:19,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 23:24:19,811 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:24:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:24:20,029 INFO L225 Difference]: With dead ends: 88594 [2021-06-05 23:24:20,029 INFO L226 Difference]: Without dead ends: 88567 [2021-06-05 23:24:20,029 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 707.5ms TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:24:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88567 states. [2021-06-05 23:24:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88567 to 88083. [2021-06-05 23:24:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88083 states, 88082 states have (on average 3.594832088281374) internal successors, (316640), 88082 states have internal predecessors, (316640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:22,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88083 states to 88083 states and 316640 transitions. [2021-06-05 23:24:22,065 INFO L78 Accepts]: Start accepts. Automaton has 88083 states and 316640 transitions. Word has length 37 [2021-06-05 23:24:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:24:22,065 INFO L482 AbstractCegarLoop]: Abstraction has 88083 states and 316640 transitions. [2021-06-05 23:24:22,065 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 88083 states and 316640 transitions. [2021-06-05 23:24:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:24:22,164 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:24:22,164 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:24:22,365 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable144 [2021-06-05 23:24:22,365 INFO L430 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:24:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:24:22,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1709357799, now seen corresponding path program 75 times [2021-06-05 23:24:22,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:24:22,365 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369582424] [2021-06-05 23:24:22,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:24:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:22,637 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:24:22,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369582424] [2021-06-05 23:24:22,637 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369582424] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:22,637 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735035447] [2021-06-05 23:24:22,637 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 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 23:24:22,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 23:24:22,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:24:22,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 50 conjunts are in the unsatisfiable core [2021-06-05 23:24:22,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:24:22,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:24:22,747 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:22,757 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:22,757 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:22,758 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:50 [2021-06-05 23:24:22,891 INFO L354 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2021-06-05 23:24:22,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2021-06-05 23:24:22,893 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:22,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:22,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:22,912 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:71 [2021-06-05 23:24:23,089 INFO L446 ElimStorePlain]: Different costs {6=[v_C_96], 7=[A, B]} [2021-06-05 23:24:23,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,106 INFO L354 Elim1Store]: treesize reduction 53, result has 8.6 percent of original size [2021-06-05 23:24:23,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 63 [2021-06-05 23:24:23,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:23,127 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:23,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,158 INFO L354 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2021-06-05 23:24:23,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 76 [2021-06-05 23:24:23,162 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:23,175 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:23,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,201 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:23,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 77 [2021-06-05 23:24:23,221 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2021-06-05 23:24:23,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:23,238 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:24:23,238 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:93, output treesize:50 [2021-06-05 23:24:23,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,586 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:23,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 25 [2021-06-05 23:24:23,589 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:23,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:23,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:23,594 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:23,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2021-06-05 23:24:23,596 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:23,609 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:23,610 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 23:24:23,611 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:28 [2021-06-05 23:24:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:23,666 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735035447] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:23,666 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:24:23,666 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 25 [2021-06-05 23:24:23,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074581157] [2021-06-05 23:24:23,666 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 23:24:23,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:24:23,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 23:24:23,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2021-06-05 23:24:23,666 INFO L87 Difference]: Start difference. First operand 88083 states and 316640 transitions. Second operand has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:25,064 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2021-06-05 23:24:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:24:26,623 INFO L93 Difference]: Finished difference Result 89029 states and 319258 transitions. [2021-06-05 23:24:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 23:24:26,624 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:24:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:24:26,855 INFO L225 Difference]: With dead ends: 89029 [2021-06-05 23:24:26,855 INFO L226 Difference]: Without dead ends: 88853 [2021-06-05 23:24:26,855 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 2184.5ms TimeCoverageRelationStatistics Valid=235, Invalid=2117, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 23:24:26,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88853 states. [2021-06-05 23:24:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88853 to 88137. [2021-06-05 23:24:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88137 states, 88136 states have (on average 3.594399564309703) internal successors, (316796), 88136 states have internal predecessors, (316796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88137 states to 88137 states and 316796 transitions. [2021-06-05 23:24:28,903 INFO L78 Accepts]: Start accepts. Automaton has 88137 states and 316796 transitions. Word has length 37 [2021-06-05 23:24:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:24:28,903 INFO L482 AbstractCegarLoop]: Abstraction has 88137 states and 316796 transitions. [2021-06-05 23:24:28,903 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 88137 states and 316796 transitions. [2021-06-05 23:24:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:24:28,993 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:24:28,993 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:24:29,193 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable145 [2021-06-05 23:24:29,194 INFO L430 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:24:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:24:29,194 INFO L82 PathProgramCache]: Analyzing trace with hash -526131645, now seen corresponding path program 76 times [2021-06-05 23:24:29,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:24:29,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657119948] [2021-06-05 23:24:29,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:24:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:29,452 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:24:29,452 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657119948] [2021-06-05 23:24:29,452 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657119948] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:29,452 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113137040] [2021-06-05 23:24:29,452 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 23:24:29,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:24:29,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:24:29,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:24:29,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:24:29,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:24:29,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:29,557 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:29,558 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:29,558 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2021-06-05 23:24:29,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:29,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2021-06-05 23:24:29,651 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:29,663 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:29,663 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:29,663 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2021-06-05 23:24:29,703 INFO L446 ElimStorePlain]: Different costs {3=[v_C_99], 12=[A, B]} [2021-06-05 23:24:29,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:29,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:29,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:29,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2021-06-05 23:24:29,708 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:29,720 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:29,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:29,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:29,724 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:29,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:29,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:29,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 51 [2021-06-05 23:24:29,726 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:29,733 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:29,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:29,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:29,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:29,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:29,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:29,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2021-06-05 23:24:29,738 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:29,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:29,743 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:29,743 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:25 [2021-06-05 23:24:29,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2021-06-05 23:24:29,793 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:29,794 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:29,795 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:29,795 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:5 [2021-06-05 23:24:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:29,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113137040] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:29,810 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:24:29,810 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-06-05 23:24:29,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647875047] [2021-06-05 23:24:29,810 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:24:29,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:24:29,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:24:29,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:24:29,811 INFO L87 Difference]: Start difference. First operand 88137 states and 316796 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:24:31,059 INFO L93 Difference]: Finished difference Result 88467 states and 317720 transitions. [2021-06-05 23:24:31,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 23:24:31,063 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:24:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:24:31,271 INFO L225 Difference]: With dead ends: 88467 [2021-06-05 23:24:31,272 INFO L226 Difference]: Without dead ends: 88326 [2021-06-05 23:24:31,272 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 445.2ms TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-06-05 23:24:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88326 states. [2021-06-05 23:24:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88326 to 88107. [2021-06-05 23:24:32,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88107 states, 88106 states have (on average 3.594670056522825) internal successors, (316712), 88106 states have internal predecessors, (316712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88107 states to 88107 states and 316712 transitions. [2021-06-05 23:24:32,876 INFO L78 Accepts]: Start accepts. Automaton has 88107 states and 316712 transitions. Word has length 37 [2021-06-05 23:24:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:24:32,876 INFO L482 AbstractCegarLoop]: Abstraction has 88107 states and 316712 transitions. [2021-06-05 23:24:32,876 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 88107 states and 316712 transitions. [2021-06-05 23:24:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:24:32,970 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:24:32,970 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:24:33,170 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 79 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable168 [2021-06-05 23:24:33,170 INFO L430 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:24:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:24:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1749520249, now seen corresponding path program 77 times [2021-06-05 23:24:33,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:24:33,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898286754] [2021-06-05 23:24:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:24:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:33,473 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:24:33,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898286754] [2021-06-05 23:24:33,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898286754] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:33,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73033368] [2021-06-05 23:24:33,473 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 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 23:24:33,501 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 23:24:33,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:24:33,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 23:24:33,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:24:33,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:24:33,561 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:33,573 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:33,573 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:33,573 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2021-06-05 23:24:33,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2021-06-05 23:24:33,661 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:33,674 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:33,675 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:33,675 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:67 [2021-06-05 23:24:33,785 INFO L446 ElimStorePlain]: Different costs {3=[v_C_102], 12=[A, B]} [2021-06-05 23:24:33,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2021-06-05 23:24:33,791 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:33,803 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:33,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,807 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:33,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,808 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:33,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 58 [2021-06-05 23:24:33,812 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:33,819 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:33,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,825 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:33,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:33,826 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:33,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2021-06-05 23:24:33,827 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:33,832 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:33,832 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:33,832 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:88, output treesize:26 [2021-06-05 23:24:33,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:24:33,862 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:33,863 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:33,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:33,863 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2021-06-05 23:24:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:33,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73033368] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:33,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:24:33,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-06-05 23:24:33,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471863649] [2021-06-05 23:24:33,879 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 23:24:33,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:24:33,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 23:24:33,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-06-05 23:24:33,880 INFO L87 Difference]: Start difference. First operand 88107 states and 316712 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:24:35,223 INFO L93 Difference]: Finished difference Result 88596 states and 318077 transitions. [2021-06-05 23:24:35,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 23:24:35,223 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:24:35,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:24:35,456 INFO L225 Difference]: With dead ends: 88596 [2021-06-05 23:24:35,456 INFO L226 Difference]: Without dead ends: 88422 [2021-06-05 23:24:35,456 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 613.5ms TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2021-06-05 23:24:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88422 states. [2021-06-05 23:24:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88422 to 88155. [2021-06-05 23:24:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88155 states, 88154 states have (on average 3.594346257685414) internal successors, (316856), 88154 states have internal predecessors, (316856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88155 states to 88155 states and 316856 transitions. [2021-06-05 23:24:37,513 INFO L78 Accepts]: Start accepts. Automaton has 88155 states and 316856 transitions. Word has length 37 [2021-06-05 23:24:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:24:37,513 INFO L482 AbstractCegarLoop]: Abstraction has 88155 states and 316856 transitions. [2021-06-05 23:24:37,513 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 88155 states and 316856 transitions. [2021-06-05 23:24:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:24:37,636 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:24:37,636 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:24:37,836 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable169 [2021-06-05 23:24:37,836 INFO L430 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:24:37,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:24:37,836 INFO L82 PathProgramCache]: Analyzing trace with hash -395343355, now seen corresponding path program 78 times [2021-06-05 23:24:37,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:24:37,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677045745] [2021-06-05 23:24:37,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:24:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:38,236 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:38,236 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:24:38,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677045745] [2021-06-05 23:24:38,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677045745] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:38,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969618822] [2021-06-05 23:24:38,236 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 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 23:24:38,265 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-05 23:24:38,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:24:38,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 23:24:38,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:24:38,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:24:38,339 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:38,350 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:38,350 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:38,350 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:58 [2021-06-05 23:24:38,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:38,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-06-05 23:24:38,422 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:38,437 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:38,438 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:38,438 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:72 [2021-06-05 23:24:38,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2021-06-05 23:24:38,603 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:38,618 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:38,619 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:38,619 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:81 [2021-06-05 23:24:38,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-06-05 23:24:38,680 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:38,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:38,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:38,689 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:54 [2021-06-05 23:24:38,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:24:38,738 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:38,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:38,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-06-05 23:24:38,747 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:38,750 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:38,751 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:38,751 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:12 [2021-06-05 23:24:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:38,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969618822] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:38,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:24:38,796 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2021-06-05 23:24:38,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118091822] [2021-06-05 23:24:38,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 23:24:38,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:24:38,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 23:24:38,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2021-06-05 23:24:38,797 INFO L87 Difference]: Start difference. First operand 88155 states and 316856 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:24:42,031 INFO L93 Difference]: Finished difference Result 135959 states and 484747 transitions. [2021-06-05 23:24:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 23:24:42,031 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:24:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:24:42,398 INFO L225 Difference]: With dead ends: 135959 [2021-06-05 23:24:42,398 INFO L226 Difference]: Without dead ends: 135910 [2021-06-05 23:24:42,399 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 2084.6ms TimeCoverageRelationStatistics Valid=380, Invalid=2376, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 23:24:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135910 states. [2021-06-05 23:24:44,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135910 to 88218. [2021-06-05 23:24:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88218 states, 88217 states have (on average 3.594057834657719) internal successors, (317057), 88217 states have internal predecessors, (317057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88218 states to 88218 states and 317057 transitions. [2021-06-05 23:24:44,560 INFO L78 Accepts]: Start accepts. Automaton has 88218 states and 317057 transitions. Word has length 37 [2021-06-05 23:24:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:24:44,560 INFO L482 AbstractCegarLoop]: Abstraction has 88218 states and 317057 transitions. [2021-06-05 23:24:44,560 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 88218 states and 317057 transitions. [2021-06-05 23:24:44,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:24:44,649 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:24:44,649 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:24:44,852 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170,81 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:24:44,853 INFO L430 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:24:44,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:24:44,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1514138647, now seen corresponding path program 79 times [2021-06-05 23:24:44,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:24:44,853 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369533170] [2021-06-05 23:24:44,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:24:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:45,217 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:24:45,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369533170] [2021-06-05 23:24:45,217 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369533170] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:45,217 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99773511] [2021-06-05 23:24:45,217 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 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 23:24:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:45,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:24:45,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:24:45,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:24:45,333 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:45,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:45,344 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:45,344 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:52 [2021-06-05 23:24:45,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:45,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2021-06-05 23:24:45,417 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:45,430 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:45,431 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:45,431 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:87 [2021-06-05 23:24:45,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:45,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:45,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:45,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2021-06-05 23:24:45,519 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:45,533 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:45,534 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:45,534 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:114 [2021-06-05 23:24:45,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2021-06-05 23:24:45,589 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:45,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:45,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2021-06-05 23:24:45,597 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:45,601 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:45,602 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:45,602 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:22 [2021-06-05 23:24:45,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:24:45,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:45,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:45,631 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:45,631 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2021-06-05 23:24:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:45,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99773511] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:45,653 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:24:45,653 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:24:45,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114302921] [2021-06-05 23:24:45,653 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:24:45,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:24:45,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:24:45,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:24:45,653 INFO L87 Difference]: Start difference. First operand 88218 states and 317057 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:24:48,503 INFO L93 Difference]: Finished difference Result 137039 states and 488238 transitions. [2021-06-05 23:24:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 23:24:48,503 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:24:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:24:49,175 INFO L225 Difference]: With dead ends: 137039 [2021-06-05 23:24:49,175 INFO L226 Difference]: Without dead ends: 136886 [2021-06-05 23:24:49,175 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1662.9ms TimeCoverageRelationStatistics Valid=407, Invalid=2043, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 23:24:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136886 states. [2021-06-05 23:24:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136886 to 88221. [2021-06-05 23:24:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88221 states, 88220 states have (on average 3.593901609612333) internal successors, (317054), 88220 states have internal predecessors, (317054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88221 states to 88221 states and 317054 transitions. [2021-06-05 23:24:51,001 INFO L78 Accepts]: Start accepts. Automaton has 88221 states and 317054 transitions. Word has length 37 [2021-06-05 23:24:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:24:51,001 INFO L482 AbstractCegarLoop]: Abstraction has 88221 states and 317054 transitions. [2021-06-05 23:24:51,001 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 88221 states and 317054 transitions. [2021-06-05 23:24:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:24:51,096 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:24:51,096 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:24:51,304 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171,82 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:24:51,305 INFO L430 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:24:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:24:51,305 INFO L82 PathProgramCache]: Analyzing trace with hash -759209629, now seen corresponding path program 80 times [2021-06-05 23:24:51,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:24:51,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684480230] [2021-06-05 23:24:51,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:24:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:51,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:24:51,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684480230] [2021-06-05 23:24:51,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684480230] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:51,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718363979] [2021-06-05 23:24:51,576 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 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 23:24:51,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:24:51,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:24:51,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 23:24:51,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:24:51,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:24:51,691 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:51,703 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:51,703 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:51,703 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2021-06-05 23:24:51,776 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:24:51,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:51,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2021-06-05 23:24:51,778 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:51,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:51,794 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:51,794 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:78 [2021-06-05 23:24:52,353 INFO L446 ElimStorePlain]: Different costs {0=[v_C_111], 3=[A, B]} [2021-06-05 23:24:52,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2021-06-05 23:24:52,356 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:52,371 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:52,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:52,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:52,380 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:52,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 52 [2021-06-05 23:24:52,381 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:52,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:52,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:52,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:52,402 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:52,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2021-06-05 23:24:52,405 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: and 2 xjuncts. [2021-06-05 23:24:52,413 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:52,415 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:52,415 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:80, output treesize:34 [2021-06-05 23:24:52,490 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:52,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2021-06-05 23:24:52,494 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:24:52,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:52,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:52,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:24:52,498 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:52,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:52,514 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 23:24:52,514 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:29 [2021-06-05 23:24:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:52,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718363979] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:52,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:24:52,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2021-06-05 23:24:52,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575468317] [2021-06-05 23:24:52,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:24:52,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:24:52,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:24:52,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:24:52,568 INFO L87 Difference]: Start difference. First operand 88221 states and 317054 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:24:54,301 INFO L93 Difference]: Finished difference Result 89369 states and 320372 transitions. [2021-06-05 23:24:54,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 23:24:54,302 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:24:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:24:54,508 INFO L225 Difference]: With dead ends: 89369 [2021-06-05 23:24:54,508 INFO L226 Difference]: Without dead ends: 89195 [2021-06-05 23:24:54,509 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1458.0ms TimeCoverageRelationStatistics Valid=146, Invalid=1186, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 23:24:54,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89195 states. [2021-06-05 23:24:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89195 to 88245. [2021-06-05 23:24:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88245 states, 88244 states have (on average 3.593672091020353) internal successors, (317120), 88244 states have internal predecessors, (317120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88245 states to 88245 states and 317120 transitions. [2021-06-05 23:24:56,402 INFO L78 Accepts]: Start accepts. Automaton has 88245 states and 317120 transitions. Word has length 37 [2021-06-05 23:24:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:24:56,402 INFO L482 AbstractCegarLoop]: Abstraction has 88245 states and 317120 transitions. [2021-06-05 23:24:56,402 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:24:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 88245 states and 317120 transitions. [2021-06-05 23:24:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:24:56,496 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:24:56,496 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:24:56,700 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable172 [2021-06-05 23:24:56,701 INFO L430 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:24:56,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:24:56,701 INFO L82 PathProgramCache]: Analyzing trace with hash 960803363, now seen corresponding path program 81 times [2021-06-05 23:24:56,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:24:56,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604341055] [2021-06-05 23:24:56,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:24:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:24:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:57,027 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:24:57,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604341055] [2021-06-05 23:24:57,027 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604341055] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:57,027 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907400225] [2021-06-05 23:24:57,027 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 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 23:24:57,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 23:24:57,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:24:57,063 WARN L261 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 23:24:57,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:24:57,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:24:57,142 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:57,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:57,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:57,153 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:50 [2021-06-05 23:24:57,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:24:57,217 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:57,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:57,228 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:57,228 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:56 [2021-06-05 23:24:57,411 INFO L446 ElimStorePlain]: Different costs {0=[v_C_114], 3=[A, B]} [2021-06-05 23:24:57,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2021-06-05 23:24:57,415 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:57,432 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:57,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:57,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:57,440 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:57,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 49 [2021-06-05 23:24:57,442 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:24:57,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:57,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:57,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:57,463 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:57,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 34 [2021-06-05 23:24:57,465 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2021-06-05 23:24:57,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:57,476 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:57,476 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:31 [2021-06-05 23:24:57,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:57,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:24:57,640 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:24:57,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 59 [2021-06-05 23:24:57,663 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2021-06-05 23:24:57,697 INFO L628 ElimStorePlain]: treesize reduction 81, result has 23.6 percent of original size [2021-06-05 23:24:57,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:24:57,700 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:37 [2021-06-05 23:24:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:24:57,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907400225] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:24:57,762 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:24:57,762 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 26 [2021-06-05 23:24:57,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605441659] [2021-06-05 23:24:57,762 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 23:24:57,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:24:57,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 23:24:57,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2021-06-05 23:24:57,762 INFO L87 Difference]: Start difference. First operand 88245 states and 317120 transitions. Second operand has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:25:00,040 INFO L93 Difference]: Finished difference Result 88833 states and 318722 transitions. [2021-06-05 23:25:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 23:25:00,040 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:25:00,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:25:00,271 INFO L225 Difference]: With dead ends: 88833 [2021-06-05 23:25:00,272 INFO L226 Difference]: Without dead ends: 88590 [2021-06-05 23:25:00,272 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1328.9ms TimeCoverageRelationStatistics Valid=144, Invalid=1578, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 23:25:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88590 states. [2021-06-05 23:25:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88590 to 88221. [2021-06-05 23:25:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88221 states, 88220 states have (on average 3.593901609612333) internal successors, (317054), 88220 states have internal predecessors, (317054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88221 states to 88221 states and 317054 transitions. [2021-06-05 23:25:02,227 INFO L78 Accepts]: Start accepts. Automaton has 88221 states and 317054 transitions. Word has length 37 [2021-06-05 23:25:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:25:02,227 INFO L482 AbstractCegarLoop]: Abstraction has 88221 states and 317054 transitions. [2021-06-05 23:25:02,227 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:02,227 INFO L276 IsEmpty]: Start isEmpty. Operand 88221 states and 317054 transitions. [2021-06-05 23:25:02,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:25:02,329 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:25:02,329 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:25:02,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182,84 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:25:02,531 INFO L430 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:25:02,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:25:02,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1764133243, now seen corresponding path program 82 times [2021-06-05 23:25:02,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:25:02,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202446061] [2021-06-05 23:25:02,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:25:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:25:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:02,889 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:25:02,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202446061] [2021-06-05 23:25:02,889 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202446061] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:02,889 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007928768] [2021-06-05 23:25:02,889 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 23:25:02,916 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:25:02,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:25:02,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:25:02,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:25:02,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:25:03,000 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:03,010 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:03,010 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:03,010 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:68 [2021-06-05 23:25:03,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:03,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2021-06-05 23:25:03,087 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:03,108 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:03,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:03,109 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:90, output treesize:94 [2021-06-05 23:25:03,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:03,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:03,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:03,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2021-06-05 23:25:03,163 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:03,177 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:03,178 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:03,178 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:102 [2021-06-05 23:25:03,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:03,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:03,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:03,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2021-06-05 23:25:03,297 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:03,305 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:03,305 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:03,306 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:105, output treesize:68 [2021-06-05 23:25:03,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:25:03,357 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:03,360 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:03,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-06-05 23:25:03,362 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:03,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:03,364 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:03,364 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:25:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:03,394 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007928768] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:03,394 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:25:03,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:25:03,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863975352] [2021-06-05 23:25:03,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:25:03,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:25:03,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:25:03,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:25:03,395 INFO L87 Difference]: Start difference. First operand 88221 states and 317054 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:06,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:25:06,683 INFO L93 Difference]: Finished difference Result 135851 states and 484413 transitions. [2021-06-05 23:25:06,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 23:25:06,684 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:25:06,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:25:07,083 INFO L225 Difference]: With dead ends: 135851 [2021-06-05 23:25:07,083 INFO L226 Difference]: Without dead ends: 135799 [2021-06-05 23:25:07,083 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1818.9ms TimeCoverageRelationStatistics Valid=311, Invalid=2139, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 23:25:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135799 states. [2021-06-05 23:25:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135799 to 88287. [2021-06-05 23:25:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88287 states, 88286 states have (on average 3.593559567768389) internal successors, (317261), 88286 states have internal predecessors, (317261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88287 states to 88287 states and 317261 transitions. [2021-06-05 23:25:09,285 INFO L78 Accepts]: Start accepts. Automaton has 88287 states and 317261 transitions. Word has length 37 [2021-06-05 23:25:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:25:09,285 INFO L482 AbstractCegarLoop]: Abstraction has 88287 states and 317261 transitions. [2021-06-05 23:25:09,285 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 88287 states and 317261 transitions. [2021-06-05 23:25:09,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:25:09,383 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:25:09,383 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:25:09,583 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable198 [2021-06-05 23:25:09,583 INFO L430 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:25:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:25:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1412038761, now seen corresponding path program 83 times [2021-06-05 23:25:09,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:25:09,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246773037] [2021-06-05 23:25:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:25:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:25:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:10,037 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:25:10,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246773037] [2021-06-05 23:25:10,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246773037] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:10,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425138692] [2021-06-05 23:25:10,037 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 23:25:10,069 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-06-05 23:25:10,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:25:10,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 51 conjunts are in the unsatisfiable core [2021-06-05 23:25:10,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:25:10,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:25:10,158 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:10,168 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:10,169 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:10,169 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:52 [2021-06-05 23:25:10,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,279 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-06-05 23:25:10,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 52 [2021-06-05 23:25:10,280 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:10,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:10,296 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:10,296 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:91, output treesize:90 [2021-06-05 23:25:10,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,442 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-06-05 23:25:10,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 66 [2021-06-05 23:25:10,443 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:10,459 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:10,460 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:10,460 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:99, output treesize:98 [2021-06-05 23:25:10,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2021-06-05 23:25:10,578 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:10,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:10,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-06-05 23:25:10,589 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:10,887 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-06-05 23:25:10,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:10,888 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:10,888 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:34 [2021-06-05 23:25:10,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:10,969 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:10,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 69 [2021-06-05 23:25:11,006 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:25:11,012 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:11,014 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:11,014 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:21 [2021-06-05 23:25:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:11,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425138692] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:11,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:25:11,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2021-06-05 23:25:11,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255945476] [2021-06-05 23:25:11,070 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:25:11,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:25:11,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:25:11,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:25:11,070 INFO L87 Difference]: Start difference. First operand 88287 states and 317261 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:13,244 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 62 [2021-06-05 23:25:15,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:25:15,655 INFO L93 Difference]: Finished difference Result 136799 states and 487203 transitions. [2021-06-05 23:25:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 23:25:15,655 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:25:15,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:25:16,057 INFO L225 Difference]: With dead ends: 136799 [2021-06-05 23:25:16,057 INFO L226 Difference]: Without dead ends: 136619 [2021-06-05 23:25:16,057 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 3170.8ms TimeCoverageRelationStatistics Valid=623, Invalid=3409, Unknown=0, NotChecked=0, Total=4032 [2021-06-05 23:25:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136619 states. [2021-06-05 23:25:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136619 to 88272. [2021-06-05 23:25:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88272 states, 88271 states have (on average 3.593762390819182) internal successors, (317225), 88271 states have internal predecessors, (317225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88272 states to 88272 states and 317225 transitions. [2021-06-05 23:25:18,444 INFO L78 Accepts]: Start accepts. Automaton has 88272 states and 317225 transitions. Word has length 37 [2021-06-05 23:25:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:25:18,444 INFO L482 AbstractCegarLoop]: Abstraction has 88272 states and 317225 transitions. [2021-06-05 23:25:18,445 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:18,445 INFO L276 IsEmpty]: Start isEmpty. Operand 88272 states and 317225 transitions. [2021-06-05 23:25:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:25:18,544 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:25:18,545 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:25:18,745 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable199 [2021-06-05 23:25:18,745 INFO L430 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:25:18,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:25:18,745 INFO L82 PathProgramCache]: Analyzing trace with hash -537673117, now seen corresponding path program 84 times [2021-06-05 23:25:18,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:25:18,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296343561] [2021-06-05 23:25:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:25:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:25:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:19,185 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:25:19,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296343561] [2021-06-05 23:25:19,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296343561] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:19,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587428892] [2021-06-05 23:25:19,185 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 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 23:25:19,214 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 23:25:19,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:25:19,216 WARN L261 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 23:25:19,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:25:19,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:25:19,279 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:19,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:19,290 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:19,290 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:50 [2021-06-05 23:25:19,357 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:19,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:19,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2021-06-05 23:25:19,359 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:19,373 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:19,374 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:19,374 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:70 [2021-06-05 23:25:19,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:19,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:19,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:19,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2021-06-05 23:25:19,496 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:19,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:19,511 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:19,511 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:78 [2021-06-05 23:25:19,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:19,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:19,565 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:19,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:19,566 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:19,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2021-06-05 23:25:19,569 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:19,578 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:19,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:19,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:19,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:19,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:19,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:19,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2021-06-05 23:25:19,597 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:19,604 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:19,605 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:19,605 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:33 [2021-06-05 23:25:19,684 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:19,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2021-06-05 23:25:19,688 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:25:19,700 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:19,702 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:19,702 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:24 [2021-06-05 23:25:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:19,798 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587428892] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:19,798 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:25:19,799 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2021-06-05 23:25:19,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836930103] [2021-06-05 23:25:19,799 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 23:25:19,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:25:19,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 23:25:19,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2021-06-05 23:25:19,799 INFO L87 Difference]: Start difference. First operand 88272 states and 317225 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:20,864 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2021-06-05 23:25:21,760 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 59 [2021-06-05 23:25:23,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:25:23,921 INFO L93 Difference]: Finished difference Result 136510 states and 486320 transitions. [2021-06-05 23:25:23,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 23:25:23,922 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:25:23,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:25:24,315 INFO L225 Difference]: With dead ends: 136510 [2021-06-05 23:25:24,315 INFO L226 Difference]: Without dead ends: 136258 [2021-06-05 23:25:24,315 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 2920.6ms TimeCoverageRelationStatistics Valid=494, Invalid=2812, Unknown=0, NotChecked=0, Total=3306 [2021-06-05 23:25:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136258 states. [2021-06-05 23:25:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136258 to 88339. [2021-06-05 23:25:25,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88339 states, 88338 states have (on average 3.593278090968779) internal successors, (317423), 88338 states have internal predecessors, (317423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88339 states to 88339 states and 317423 transitions. [2021-06-05 23:25:26,292 INFO L78 Accepts]: Start accepts. Automaton has 88339 states and 317423 transitions. Word has length 37 [2021-06-05 23:25:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:25:26,292 INFO L482 AbstractCegarLoop]: Abstraction has 88339 states and 317423 transitions. [2021-06-05 23:25:26,292 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 88339 states and 317423 transitions. [2021-06-05 23:25:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:25:26,807 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:25:26,807 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:25:27,023 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable216 [2021-06-05 23:25:27,023 INFO L430 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:25:27,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:25:27,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1445860719, now seen corresponding path program 85 times [2021-06-05 23:25:27,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:25:27,024 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244486034] [2021-06-05 23:25:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:25:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:25:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:27,279 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:25:27,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244486034] [2021-06-05 23:25:27,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244486034] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:27,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138199042] [2021-06-05 23:25:27,279 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 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 23:25:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:25:27,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:25:27,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:25:27,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:25:27,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:27,383 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:27,384 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:27,384 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:50 [2021-06-05 23:25:27,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:27,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:27,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2021-06-05 23:25:27,479 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:27,491 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:27,492 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:27,492 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:78 [2021-06-05 23:25:27,573 INFO L446 ElimStorePlain]: Different costs {0=[A, B], 3=[v_C_126]} [2021-06-05 23:25:27,575 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 47 [2021-06-05 23:25:27,576 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:27,582 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:27,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2021-06-05 23:25:27,585 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:27,589 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:27,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:27,591 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:27,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2021-06-05 23:25:27,592 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:27,597 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:27,597 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:27,597 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:76, output treesize:24 [2021-06-05 23:25:27,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:25:27,626 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:27,627 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:27,628 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:27,628 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2021-06-05 23:25:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:27,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138199042] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:27,645 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:25:27,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-06-05 23:25:27,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648465613] [2021-06-05 23:25:27,645 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:25:27,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:25:27,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:25:27,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:25:27,645 INFO L87 Difference]: Start difference. First operand 88339 states and 317423 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:25:28,667 INFO L93 Difference]: Finished difference Result 88738 states and 318546 transitions. [2021-06-05 23:25:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 23:25:28,668 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:25:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:25:28,919 INFO L225 Difference]: With dead ends: 88738 [2021-06-05 23:25:28,919 INFO L226 Difference]: Without dead ends: 88653 [2021-06-05 23:25:28,920 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 471.0ms TimeCoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-06-05 23:25:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88653 states. [2021-06-05 23:25:30,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88653 to 88413. [2021-06-05 23:25:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88413 states, 88412 states have (on average 3.592623173324888) internal successors, (317631), 88412 states have internal predecessors, (317631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88413 states to 88413 states and 317631 transitions. [2021-06-05 23:25:31,239 INFO L78 Accepts]: Start accepts. Automaton has 88413 states and 317631 transitions. Word has length 37 [2021-06-05 23:25:31,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:25:31,239 INFO L482 AbstractCegarLoop]: Abstraction has 88413 states and 317631 transitions. [2021-06-05 23:25:31,239 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:31,239 INFO L276 IsEmpty]: Start isEmpty. Operand 88413 states and 317631 transitions. [2021-06-05 23:25:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:25:31,331 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:25:31,331 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:25:31,531 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable221 [2021-06-05 23:25:31,532 INFO L430 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:25:31,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:25:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1665880423, now seen corresponding path program 86 times [2021-06-05 23:25:31,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:25:31,532 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236806517] [2021-06-05 23:25:31,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:25:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:25:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:31,781 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:25:31,781 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236806517] [2021-06-05 23:25:31,781 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236806517] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:31,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638211454] [2021-06-05 23:25:31,782 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 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 23:25:31,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:25:31,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:25:31,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 23:25:31,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:25:31,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:25:31,895 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:31,907 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:31,908 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:31,908 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2021-06-05 23:25:32,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:32,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-06-05 23:25:32,011 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:32,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:32,025 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:32,025 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:71 [2021-06-05 23:25:32,069 INFO L446 ElimStorePlain]: Different costs {3=[v_C_129], 12=[A, B]} [2021-06-05 23:25:32,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:32,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:32,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:32,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2021-06-05 23:25:32,074 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:32,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:32,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:32,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:32,093 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:32,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:32,094 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:32,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2021-06-05 23:25:32,096 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:32,103 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:32,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:32,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:32,106 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:32,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:32,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:32,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2021-06-05 23:25:32,108 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:32,113 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:32,113 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:32,114 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:28 [2021-06-05 23:25:32,191 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:32,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2021-06-05 23:25:32,196 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2021-06-05 23:25:32,214 INFO L628 ElimStorePlain]: treesize reduction 39, result has 36.1 percent of original size [2021-06-05 23:25:32,216 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:32,216 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2021-06-05 23:25:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:32,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638211454] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:32,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:25:32,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2021-06-05 23:25:32,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193557505] [2021-06-05 23:25:32,256 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:25:32,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:25:32,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:25:32,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:25:32,256 INFO L87 Difference]: Start difference. First operand 88413 states and 317631 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:25:33,702 INFO L93 Difference]: Finished difference Result 89892 states and 321912 transitions. [2021-06-05 23:25:33,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 23:25:33,702 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:25:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:25:33,927 INFO L225 Difference]: With dead ends: 89892 [2021-06-05 23:25:33,927 INFO L226 Difference]: Without dead ends: 89614 [2021-06-05 23:25:33,927 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 660.9ms TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2021-06-05 23:25:34,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89614 states. [2021-06-05 23:25:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89614 to 88392. [2021-06-05 23:25:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88392 states, 88391 states have (on average 3.592763969182383) internal successors, (317568), 88391 states have internal predecessors, (317568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88392 states to 88392 states and 317568 transitions. [2021-06-05 23:25:36,099 INFO L78 Accepts]: Start accepts. Automaton has 88392 states and 317568 transitions. Word has length 37 [2021-06-05 23:25:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:25:36,099 INFO L482 AbstractCegarLoop]: Abstraction has 88392 states and 317568 transitions. [2021-06-05 23:25:36,100 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 88392 states and 317568 transitions. [2021-06-05 23:25:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:25:36,224 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:25:36,225 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:25:36,436 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222,89 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:25:36,437 INFO L430 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:25:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:25:36,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1598291623, now seen corresponding path program 87 times [2021-06-05 23:25:36,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:25:36,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510636794] [2021-06-05 23:25:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:25:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:25:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:36,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:25:36,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510636794] [2021-06-05 23:25:36,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510636794] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:36,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108961018] [2021-06-05 23:25:36,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 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 23:25:36,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 23:25:36,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:25:36,737 WARN L261 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 23:25:36,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:25:36,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:25:36,825 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:36,837 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:36,838 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:36,838 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:50 [2021-06-05 23:25:36,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:36,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:25:36,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:36,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:36,997 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 1 xjuncts. [2021-06-05 23:25:36,997 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:72 [2021-06-05 23:25:37,218 INFO L446 ElimStorePlain]: Different costs {0=[v_C_132], 3=[A, B]} [2021-06-05 23:25:37,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2021-06-05 23:25:37,222 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:37,241 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:37,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:37,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:37,249 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:37,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 52 [2021-06-05 23:25:37,251 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:37,264 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:37,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:37,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:37,272 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:37,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2021-06-05 23:25:37,274 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2021-06-05 23:25:37,285 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:37,287 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:37,287 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:85, output treesize:40 [2021-06-05 23:25:37,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:25:37,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:37,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:25:37,380 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:37,395 INFO L628 ElimStorePlain]: treesize reduction 3, result has 87.0 percent of original size [2021-06-05 23:25:37,396 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 23:25:37,396 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:20 [2021-06-05 23:25:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:37,446 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108961018] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:37,446 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:25:37,446 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 25 [2021-06-05 23:25:37,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195250778] [2021-06-05 23:25:37,446 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 23:25:37,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:25:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 23:25:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2021-06-05 23:25:37,447 INFO L87 Difference]: Start difference. First operand 88392 states and 317568 transitions. Second operand has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:39,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:25:39,543 INFO L93 Difference]: Finished difference Result 88970 states and 319148 transitions. [2021-06-05 23:25:39,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 23:25:39,544 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:25:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:25:39,767 INFO L225 Difference]: With dead ends: 88970 [2021-06-05 23:25:39,767 INFO L226 Difference]: Without dead ends: 88806 [2021-06-05 23:25:39,768 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1124.9ms TimeCoverageRelationStatistics Valid=113, Invalid=1219, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 23:25:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88806 states. [2021-06-05 23:25:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88806 to 88450. [2021-06-05 23:25:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88450 states, 88449 states have (on average 3.5923074314011463) internal successors, (317736), 88449 states have internal predecessors, (317736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88450 states to 88450 states and 317736 transitions. [2021-06-05 23:25:41,396 INFO L78 Accepts]: Start accepts. Automaton has 88450 states and 317736 transitions. Word has length 37 [2021-06-05 23:25:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:25:41,396 INFO L482 AbstractCegarLoop]: Abstraction has 88450 states and 317736 transitions. [2021-06-05 23:25:41,396 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:41,396 INFO L276 IsEmpty]: Start isEmpty. Operand 88450 states and 317736 transitions. [2021-06-05 23:25:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:25:41,491 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:25:41,492 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:25:41,692 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227,90 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:25:41,692 INFO L430 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:25:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:25:41,692 INFO L82 PathProgramCache]: Analyzing trace with hash -415065469, now seen corresponding path program 88 times [2021-06-05 23:25:41,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:25:41,692 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030623894] [2021-06-05 23:25:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:25:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:25:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:41,938 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:25:41,938 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030623894] [2021-06-05 23:25:41,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030623894] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:41,938 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211182456] [2021-06-05 23:25:41,938 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 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 23:25:41,965 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:25:41,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:25:41,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:25:41,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:25:42,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:25:42,044 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:42,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:42,054 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:42,054 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2021-06-05 23:25:42,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:42,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:25:42,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:42,131 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:42,132 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:42,132 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:64 [2021-06-05 23:25:42,504 INFO L446 ElimStorePlain]: Different costs {3=[v_C_135], 12=[A, B]} [2021-06-05 23:25:42,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:42,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:42,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:42,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2021-06-05 23:25:42,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:42,519 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:42,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:42,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:42,522 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:42,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:42,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:42,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2021-06-05 23:25:42,524 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:42,530 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:42,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:42,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:42,532 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:42,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:42,533 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:25:42,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2021-06-05 23:25:42,534 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:42,538 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:42,538 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:42,538 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:25 [2021-06-05 23:25:42,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2021-06-05 23:25:42,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:42,598 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:42,599 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:42,599 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:5 [2021-06-05 23:25:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:42,616 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211182456] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:42,616 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:25:42,616 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-06-05 23:25:42,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968748792] [2021-06-05 23:25:42,616 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:25:42,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:25:42,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:25:42,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:25:42,616 INFO L87 Difference]: Start difference. First operand 88450 states and 317736 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:25:43,588 INFO L93 Difference]: Finished difference Result 88887 states and 318958 transitions. [2021-06-05 23:25:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 23:25:43,588 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:25:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:25:43,794 INFO L225 Difference]: With dead ends: 88887 [2021-06-05 23:25:43,794 INFO L226 Difference]: Without dead ends: 88760 [2021-06-05 23:25:43,794 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 760.1ms TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2021-06-05 23:25:43,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88760 states. [2021-06-05 23:25:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88760 to 88432. [2021-06-05 23:25:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88432 states, 88431 states have (on average 3.592427994707738) internal successors, (317682), 88431 states have internal predecessors, (317682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88432 states to 88432 states and 317682 transitions. [2021-06-05 23:25:45,844 INFO L78 Accepts]: Start accepts. Automaton has 88432 states and 317682 transitions. Word has length 37 [2021-06-05 23:25:45,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:25:45,844 INFO L482 AbstractCegarLoop]: Abstraction has 88432 states and 317682 transitions. [2021-06-05 23:25:45,844 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 88432 states and 317682 transitions. [2021-06-05 23:25:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:25:45,936 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:25:45,936 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:25:46,146 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable232 [2021-06-05 23:25:46,146 INFO L430 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:25:46,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:25:46,146 INFO L82 PathProgramCache]: Analyzing trace with hash 2137898311, now seen corresponding path program 89 times [2021-06-05 23:25:46,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:25:46,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190097607] [2021-06-05 23:25:46,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:25:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:25:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:46,350 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:25:46,350 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190097607] [2021-06-05 23:25:46,350 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190097607] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:46,350 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017752778] [2021-06-05 23:25:46,350 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 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 23:25:46,378 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-05 23:25:46,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:25:46,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 23:25:46,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:25:46,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:25:46,467 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:46,495 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:46,495 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:46,496 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:55 [2021-06-05 23:25:46,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:46,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:25:46,613 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:46,624 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:46,625 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:46,625 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:74 [2021-06-05 23:25:46,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:46,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:46,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:46,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 44 [2021-06-05 23:25:46,676 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:46,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:46,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:46,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:46,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:46,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2021-06-05 23:25:46,688 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:46,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:46,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:46,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:46,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:46,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2021-06-05 23:25:46,696 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:46,700 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:46,701 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:46,701 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:87, output treesize:28 [2021-06-05 23:25:46,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:25:46,787 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:46,788 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:46,789 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:25:46,789 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:25:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:46,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017752778] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:46,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:25:46,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2021-06-05 23:25:46,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707866332] [2021-06-05 23:25:46,806 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:25:46,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:25:46,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:25:46,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:25:46,807 INFO L87 Difference]: Start difference. First operand 88432 states and 317682 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:25:48,015 INFO L93 Difference]: Finished difference Result 88979 states and 319231 transitions. [2021-06-05 23:25:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 23:25:48,029 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:25:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:25:48,267 INFO L225 Difference]: With dead ends: 88979 [2021-06-05 23:25:48,267 INFO L226 Difference]: Without dead ends: 88954 [2021-06-05 23:25:48,267 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 496.3ms TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:25:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88954 states. [2021-06-05 23:25:49,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88954 to 88462. [2021-06-05 23:25:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88462 states, 88461 states have (on average 3.5924079537875446) internal successors, (317788), 88461 states have internal predecessors, (317788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:49,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88462 states to 88462 states and 317788 transitions. [2021-06-05 23:25:49,940 INFO L78 Accepts]: Start accepts. Automaton has 88462 states and 317788 transitions. Word has length 37 [2021-06-05 23:25:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:25:49,941 INFO L482 AbstractCegarLoop]: Abstraction has 88462 states and 317788 transitions. [2021-06-05 23:25:49,941 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 22 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:25:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 88462 states and 317788 transitions. [2021-06-05 23:25:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:25:50,033 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:25:50,034 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:25:50,234 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable233 [2021-06-05 23:25:50,234 INFO L430 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:25:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:25:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2229561, now seen corresponding path program 90 times [2021-06-05 23:25:50,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:25:50,234 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647715722] [2021-06-05 23:25:50,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:25:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:25:50,538 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:25:50,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:25:50,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647715722] [2021-06-05 23:25:50,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647715722] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:25:50,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929507704] [2021-06-05 23:25:50,538 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 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 23:25:50,568 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 23:25:50,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:25:50,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 51 conjunts are in the unsatisfiable core [2021-06-05 23:25:50,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:25:50,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:25:50,647 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:50,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:50,661 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 1 xjuncts. [2021-06-05 23:25:50,661 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:55 [2021-06-05 23:25:50,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:25:50,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:25:50,705 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:50,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:50,719 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 1 xjuncts. [2021-06-05 23:25:50,719 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:61 [2021-06-05 23:25:51,039 INFO L446 ElimStorePlain]: Different costs {2=[v_C_141], 9=[A, B]} [2021-06-05 23:25:51,061 INFO L354 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2021-06-05 23:25:51,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 45 [2021-06-05 23:25:51,062 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:51,086 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:25:51,430 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2021-06-05 23:25:51,430 INFO L354 Elim1Store]: treesize reduction 16, result has 78.1 percent of original size [2021-06-05 23:25:51,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 62 treesize of output 102 [2021-06-05 23:25:51,461 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:25:51,694 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 101 [2021-06-05 23:25:51,694 INFO L628 ElimStorePlain]: treesize reduction 251, result has 56.3 percent of original size [2021-06-05 23:25:51,768 INFO L354 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2021-06-05 23:25:51,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 291 treesize of output 307 [2021-06-05 23:25:52,999 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 784 DAG size of output: 737 [2021-06-05 23:25:53,179 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 784 DAG size of output: 737 [2021-06-05 23:25:53,354 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 784 DAG size of output: 737 [2021-06-05 23:25:53,511 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 732 DAG size of output: 734 [2021-06-05 23:25:53,517 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2021-06-05 23:26:31,970 WARN L205 SmtUtils]: Spent 38.45 s on a formula simplification. DAG size of input: 748 DAG size of output: 115 [2021-06-05 23:26:31,971 INFO L628 ElimStorePlain]: treesize reduction 8300, result has 4.1 percent of original size [2021-06-05 23:26:32,374 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:26:32,374 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:92, output treesize:419 [2021-06-05 23:26:33,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:26:33,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:33,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:33,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:26:33,410 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:33,418 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:33,419 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:33,419 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:17 [2021-06-05 23:26:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:26:33,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929507704] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:26:33,474 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:26:33,474 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2021-06-05 23:26:33,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454339608] [2021-06-05 23:26:33,474 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 23:26:33,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:26:33,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 23:26:33,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2021-06-05 23:26:33,474 INFO L87 Difference]: Start difference. First operand 88462 states and 317788 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:36,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:26:36,534 INFO L93 Difference]: Finished difference Result 89473 states and 320728 transitions. [2021-06-05 23:26:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 23:26:36,535 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:26:36,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:26:36,774 INFO L225 Difference]: With dead ends: 89473 [2021-06-05 23:26:36,775 INFO L226 Difference]: Without dead ends: 89252 [2021-06-05 23:26:36,775 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2197.0ms TimeCoverageRelationStatistics Valid=177, Invalid=1715, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 23:26:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89252 states. [2021-06-05 23:26:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89252 to 88528. [2021-06-05 23:26:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88528 states, 88527 states have (on average 3.5922261005117084) internal successors, (318009), 88527 states have internal predecessors, (318009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88528 states to 88528 states and 318009 transitions. [2021-06-05 23:26:38,499 INFO L78 Accepts]: Start accepts. Automaton has 88528 states and 318009 transitions. Word has length 37 [2021-06-05 23:26:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:26:38,500 INFO L482 AbstractCegarLoop]: Abstraction has 88528 states and 318009 transitions. [2021-06-05 23:26:38,500 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 88528 states and 318009 transitions. [2021-06-05 23:26:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:26:38,600 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:26:38,600 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:26:38,817 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 93 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable234 [2021-06-05 23:26:38,817 INFO L430 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:26:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:26:38,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2142634043, now seen corresponding path program 91 times [2021-06-05 23:26:38,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:26:38,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215720676] [2021-06-05 23:26:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:26:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:26:39,282 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:26:39,282 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:26:39,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215720676] [2021-06-05 23:26:39,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215720676] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:26:39,282 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125673770] [2021-06-05 23:26:39,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 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 23:26:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:26:39,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:26:39,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:26:39,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:26:39,382 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:39,394 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:39,395 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:39,395 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2021-06-05 23:26:39,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:39,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:26:39,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:39,450 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:39,450 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:39,450 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:61 [2021-06-05 23:26:39,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2021-06-05 23:26:39,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:39,588 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:39,588 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:39,589 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:70 [2021-06-05 23:26:39,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-06-05 23:26:39,649 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:39,656 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:39,656 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:39,657 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:43 [2021-06-05 23:26:39,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:26:39,996 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:40,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:40,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-06-05 23:26:40,003 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:40,004 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:40,004 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:40,005 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:26:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:26:40,028 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125673770] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:26:40,028 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:26:40,028 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2021-06-05 23:26:40,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374640384] [2021-06-05 23:26:40,029 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:26:40,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:26:40,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:26:40,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:26:40,029 INFO L87 Difference]: Start difference. First operand 88528 states and 318009 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:26:42,711 INFO L93 Difference]: Finished difference Result 135604 states and 483456 transitions. [2021-06-05 23:26:42,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 23:26:42,712 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:26:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:26:43,037 INFO L225 Difference]: With dead ends: 135604 [2021-06-05 23:26:43,037 INFO L226 Difference]: Without dead ends: 135552 [2021-06-05 23:26:43,037 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1924.0ms TimeCoverageRelationStatistics Valid=285, Invalid=1877, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 23:26:43,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135552 states. [2021-06-05 23:26:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135552 to 88567. [2021-06-05 23:26:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88567 states, 88566 states have (on average 3.5919653140031165) internal successors, (318126), 88566 states have internal predecessors, (318126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88567 states to 88567 states and 318126 transitions. [2021-06-05 23:26:44,868 INFO L78 Accepts]: Start accepts. Automaton has 88567 states and 318126 transitions. Word has length 37 [2021-06-05 23:26:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:26:44,868 INFO L482 AbstractCegarLoop]: Abstraction has 88567 states and 318126 transitions. [2021-06-05 23:26:44,868 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 88567 states and 318126 transitions. [2021-06-05 23:26:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:26:44,968 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:26:44,968 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:26:45,169 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable446 [2021-06-05 23:26:45,169 INFO L430 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:26:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:26:45,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1033537961, now seen corresponding path program 92 times [2021-06-05 23:26:45,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:26:45,169 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280879411] [2021-06-05 23:26:45,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:26:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:26:45,814 WARN L205 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2021-06-05 23:26:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:26:45,942 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:26:45,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280879411] [2021-06-05 23:26:45,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280879411] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:26:45,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185800304] [2021-06-05 23:26:45,942 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 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 23:26:45,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:26:45,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:26:45,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:26:45,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:26:46,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:26:46,060 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:46,071 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:46,072 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:46,072 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:68 [2021-06-05 23:26:46,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:46,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-06-05 23:26:46,114 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:46,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:46,129 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:46,129 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:83 [2021-06-05 23:26:46,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:46,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:46,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:46,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2021-06-05 23:26:46,263 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:46,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:46,279 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:46,279 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:114 [2021-06-05 23:26:46,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:46,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:46,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:46,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 67 [2021-06-05 23:26:46,340 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:46,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:46,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:46,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:46,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:46,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2021-06-05 23:26:46,352 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:46,356 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:46,357 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:46,357 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:117, output treesize:31 [2021-06-05 23:26:46,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:26:46,389 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:46,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:46,391 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:46,391 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:26:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:26:46,414 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185800304] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:26:46,414 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:26:46,414 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:26:46,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410402715] [2021-06-05 23:26:46,415 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:26:46,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:26:46,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:26:46,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:26:46,415 INFO L87 Difference]: Start difference. First operand 88567 states and 318126 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:26:49,270 INFO L93 Difference]: Finished difference Result 136625 states and 486583 transitions. [2021-06-05 23:26:49,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 23:26:49,271 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:26:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:26:49,668 INFO L225 Difference]: With dead ends: 136625 [2021-06-05 23:26:49,669 INFO L226 Difference]: Without dead ends: 136440 [2021-06-05 23:26:49,669 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1937.8ms TimeCoverageRelationStatistics Valid=316, Invalid=1754, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 23:26:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136440 states. [2021-06-05 23:26:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136440 to 88540. [2021-06-05 23:26:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88540 states, 88539 states have (on average 3.592145834039237) internal successors, (318045), 88539 states have internal predecessors, (318045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88540 states to 88540 states and 318045 transitions. [2021-06-05 23:26:52,017 INFO L78 Accepts]: Start accepts. Automaton has 88540 states and 318045 transitions. Word has length 37 [2021-06-05 23:26:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:26:52,017 INFO L482 AbstractCegarLoop]: Abstraction has 88540 states and 318045 transitions. [2021-06-05 23:26:52,017 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 88540 states and 318045 transitions. [2021-06-05 23:26:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:26:52,138 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:26:52,138 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:26:52,342 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447,95 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:26:52,343 INFO L430 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:26:52,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:26:52,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1788466979, now seen corresponding path program 93 times [2021-06-05 23:26:52,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:26:52,343 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113279755] [2021-06-05 23:26:52,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:26:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:26:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:26:52,619 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:26:52,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113279755] [2021-06-05 23:26:52,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113279755] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:26:52,619 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111073582] [2021-06-05 23:26:52,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 23:26:52,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-06-05 23:26:52,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:26:52,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 51 conjunts are in the unsatisfiable core [2021-06-05 23:26:52,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:26:52,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:26:52,729 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:52,738 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:52,738 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:52,738 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2021-06-05 23:26:52,781 INFO L354 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2021-06-05 23:26:52,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:26:52,782 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:52,794 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:52,794 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:26:52,794 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:56 [2021-06-05 23:26:53,117 INFO L446 ElimStorePlain]: Different costs {6=[v_C_150], 9=[A, B]} [2021-06-05 23:26:53,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,147 INFO L354 Elim1Store]: treesize reduction 62, result has 23.5 percent of original size [2021-06-05 23:26:53,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 64 [2021-06-05 23:26:53,149 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:53,178 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:53,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,213 INFO L354 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2021-06-05 23:26:53,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 64 [2021-06-05 23:26:53,216 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:26:53,266 INFO L628 ElimStorePlain]: treesize reduction 27, result has 76.3 percent of original size [2021-06-05 23:26:53,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,292 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:53,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 78 [2021-06-05 23:26:53,320 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 5 xjuncts. [2021-06-05 23:26:53,369 INFO L628 ElimStorePlain]: treesize reduction 82, result has 44.2 percent of original size [2021-06-05 23:26:53,379 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:26:53,379 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:98, output treesize:63 [2021-06-05 23:26:53,549 INFO L446 ElimStorePlain]: Different costs {0=[C], 7=[v_prenex_2]} [2021-06-05 23:26:53,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:26:53,552 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:53,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:53,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:26:53,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:26:53,571 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:26:53,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2021-06-05 23:26:53,572 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:26:53,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:26:53,583 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 23:26:53,583 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:20 [2021-06-05 23:26:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:26:53,634 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111073582] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:26:53,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:26:53,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 26 [2021-06-05 23:26:53,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536160917] [2021-06-05 23:26:53,634 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 23:26:53,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:26:53,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 23:26:53,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2021-06-05 23:26:53,635 INFO L87 Difference]: Start difference. First operand 88540 states and 318045 transitions. Second operand has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:26:57,384 INFO L93 Difference]: Finished difference Result 89935 states and 322061 transitions. [2021-06-05 23:26:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 23:26:57,384 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:26:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:26:57,596 INFO L225 Difference]: With dead ends: 89935 [2021-06-05 23:26:57,596 INFO L226 Difference]: Without dead ends: 89629 [2021-06-05 23:26:57,596 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1975.5ms TimeCoverageRelationStatistics Valid=214, Invalid=2138, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 23:26:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89629 states. [2021-06-05 23:26:58,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89629 to 88622. [2021-06-05 23:26:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88622 states, 88621 states have (on average 3.591631780277812) internal successors, (318294), 88621 states have internal predecessors, (318294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88622 states to 88622 states and 318294 transitions. [2021-06-05 23:26:59,539 INFO L78 Accepts]: Start accepts. Automaton has 88622 states and 318294 transitions. Word has length 37 [2021-06-05 23:26:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:26:59,539 INFO L482 AbstractCegarLoop]: Abstraction has 88622 states and 318294 transitions. [2021-06-05 23:26:59,539 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:26:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 88622 states and 318294 transitions. [2021-06-05 23:26:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:26:59,632 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:26:59,632 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:26:59,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable448 [2021-06-05 23:26:59,833 INFO L430 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:26:59,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:26:59,833 INFO L82 PathProgramCache]: Analyzing trace with hash -786487325, now seen corresponding path program 94 times [2021-06-05 23:26:59,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:26:59,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85376164] [2021-06-05 23:26:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:26:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:27:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:00,140 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:27:00,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85376164] [2021-06-05 23:27:00,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85376164] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:00,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131920222] [2021-06-05 23:27:00,140 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 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 23:27:00,171 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:27:00,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:27:00,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:27:00,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:27:00,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:27:00,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:00,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:00,251 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:00,251 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2021-06-05 23:27:00,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:00,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:27:00,291 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:00,304 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:00,305 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:00,305 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:61 [2021-06-05 23:27:00,415 INFO L446 ElimStorePlain]: Different costs {3=[v_C_153], 12=[A, B]} [2021-06-05 23:27:00,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:00,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:00,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:00,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2021-06-05 23:27:00,421 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:00,433 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:00,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:00,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:00,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:27:00,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:00,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:27:00,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2021-06-05 23:27:00,438 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:00,445 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:00,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:00,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:00,447 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:27:00,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:00,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:27:00,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2021-06-05 23:27:00,449 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:00,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:00,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:00,454 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:25 [2021-06-05 23:27:00,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2021-06-05 23:27:00,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:00,509 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:00,509 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:00,509 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:5 [2021-06-05 23:27:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:00,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131920222] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:00,526 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:27:00,526 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-06-05 23:27:00,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147735770] [2021-06-05 23:27:00,526 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:27:00,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:27:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:27:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:27:00,526 INFO L87 Difference]: Start difference. First operand 88622 states and 318294 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:27:01,877 INFO L93 Difference]: Finished difference Result 89197 states and 319956 transitions. [2021-06-05 23:27:01,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 23:27:01,878 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:27:01,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:27:02,088 INFO L225 Difference]: With dead ends: 89197 [2021-06-05 23:27:02,088 INFO L226 Difference]: Without dead ends: 89068 [2021-06-05 23:27:02,088 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 529.0ms TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2021-06-05 23:27:02,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89068 states. [2021-06-05 23:27:03,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89068 to 88604. [2021-06-05 23:27:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88604 states, 88603 states have (on average 3.5918196900782142) internal successors, (318246), 88603 states have internal predecessors, (318246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88604 states to 88604 states and 318246 transitions. [2021-06-05 23:27:03,671 INFO L78 Accepts]: Start accepts. Automaton has 88604 states and 318246 transitions. Word has length 37 [2021-06-05 23:27:03,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:27:03,671 INFO L482 AbstractCegarLoop]: Abstraction has 88604 states and 318246 transitions. [2021-06-05 23:27:03,671 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:03,671 INFO L276 IsEmpty]: Start isEmpty. Operand 88604 states and 318246 transitions. [2021-06-05 23:27:03,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:27:03,762 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:27:03,762 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:27:03,963 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable480 [2021-06-05 23:27:03,963 INFO L430 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:27:03,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:27:03,964 INFO L82 PathProgramCache]: Analyzing trace with hash 783543365, now seen corresponding path program 95 times [2021-06-05 23:27:03,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:27:03,964 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159958955] [2021-06-05 23:27:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:27:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:27:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:04,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:27:04,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159958955] [2021-06-05 23:27:04,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159958955] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:04,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835913440] [2021-06-05 23:27:04,347 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 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 23:27:04,376 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-06-05 23:27:04,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:27:04,377 WARN L261 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 23:27:04,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:27:04,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:27:04,465 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:04,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:04,478 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:04,478 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:61 [2021-06-05 23:27:04,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:04,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:27:04,569 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:04,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:04,585 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:04,585 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:72 [2021-06-05 23:27:05,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:05,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:05,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:05,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2021-06-05 23:27:05,110 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:05,142 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:05,143 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:05,143 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:105 [2021-06-05 23:27:05,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:05,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:05,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:05,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2021-06-05 23:27:05,272 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:05,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:05,282 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:05,283 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:76 [2021-06-05 23:27:05,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:27:05,372 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:05,376 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:05,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-06-05 23:27:05,377 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:05,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:05,379 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:05,379 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:27:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:05,400 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835913440] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:05,400 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:27:05,400 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2021-06-05 23:27:05,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497879664] [2021-06-05 23:27:05,401 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:27:05,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:27:05,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:27:05,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:27:05,401 INFO L87 Difference]: Start difference. First operand 88604 states and 318246 transitions. Second operand has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:27:08,357 INFO L93 Difference]: Finished difference Result 135984 states and 484720 transitions. [2021-06-05 23:27:08,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 23:27:08,357 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:27:08,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:27:08,719 INFO L225 Difference]: With dead ends: 135984 [2021-06-05 23:27:08,719 INFO L226 Difference]: Without dead ends: 135932 [2021-06-05 23:27:08,719 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 1789.3ms TimeCoverageRelationStatistics Valid=275, Invalid=2077, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 23:27:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135932 states. [2021-06-05 23:27:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135932 to 88658. [2021-06-05 23:27:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88658 states, 88657 states have (on average 3.5914592192381876) internal successors, (318408), 88657 states have internal predecessors, (318408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88658 states to 88658 states and 318408 transitions. [2021-06-05 23:27:10,986 INFO L78 Accepts]: Start accepts. Automaton has 88658 states and 318408 transitions. Word has length 37 [2021-06-05 23:27:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:27:10,986 INFO L482 AbstractCegarLoop]: Abstraction has 88658 states and 318408 transitions. [2021-06-05 23:27:10,986 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 88658 states and 318408 transitions. [2021-06-05 23:27:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:27:11,116 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:27:11,116 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:27:11,316 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481,98 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:27:11,316 INFO L430 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:27:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:27:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash -335251927, now seen corresponding path program 96 times [2021-06-05 23:27:11,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:27:11,317 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101639928] [2021-06-05 23:27:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:27:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:27:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:11,785 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:27:11,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101639928] [2021-06-05 23:27:11,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101639928] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:11,785 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112327818] [2021-06-05 23:27:11,785 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 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 23:27:11,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-05 23:27:11,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:27:11,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 50 conjunts are in the unsatisfiable core [2021-06-05 23:27:11,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:27:11,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:27:11,903 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:11,914 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:11,914 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:11,914 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2021-06-05 23:27:11,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:11,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:27:11,953 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:11,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:11,967 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:11,967 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:61 [2021-06-05 23:27:12,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:12,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:12,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2021-06-05 23:27:12,090 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:12,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:12,111 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 1 xjuncts. [2021-06-05 23:27:12,111 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:74 [2021-06-05 23:27:12,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:12,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:12,318 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:12,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 58 [2021-06-05 23:27:12,319 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:12,343 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:12,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:12,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:12,360 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:12,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 94 [2021-06-05 23:27:12,374 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:27:12,438 INFO L628 ElimStorePlain]: treesize reduction 68, result has 66.3 percent of original size [2021-06-05 23:27:12,478 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:27:12,478 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:86, output treesize:215 [2021-06-05 23:27:12,768 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:12,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 23:27:12,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:27:12,789 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:12,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 23:27:12,791 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:27:12,808 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:12,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2021-06-05 23:27:12,811 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:12,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:12,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:12,835 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:12,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2021-06-05 23:27:12,838 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2021-06-05 23:27:12,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:12,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:12,870 INFO L354 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2021-06-05 23:27:12,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 35 [2021-06-05 23:27:12,872 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:12,891 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:12,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2021-06-05 23:27:12,892 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:12,909 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:12,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2021-06-05 23:27:12,910 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:12,913 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 23:27:12,914 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:12,917 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 23:27:12,918 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:12,921 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 23:27:12,921 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:13,192 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2021-06-05 23:27:13,192 INFO L628 ElimStorePlain]: treesize reduction 91, result has 70.3 percent of original size [2021-06-05 23:27:13,199 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2021-06-05 23:27:13,200 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:452, output treesize:224 [2021-06-05 23:27:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:13,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112327818] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:13,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:27:13,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2021-06-05 23:27:13,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850370305] [2021-06-05 23:27:13,508 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:27:13,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:27:13,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:27:13,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:27:13,508 INFO L87 Difference]: Start difference. First operand 88658 states and 318408 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:27:20,268 INFO L93 Difference]: Finished difference Result 138458 states and 492183 transitions. [2021-06-05 23:27:20,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-06-05 23:27:20,268 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:27:20,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:27:20,664 INFO L225 Difference]: With dead ends: 138458 [2021-06-05 23:27:20,664 INFO L226 Difference]: Without dead ends: 138226 [2021-06-05 23:27:20,664 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1555 ImplicationChecksByTransitivity, 4121.4ms TimeCoverageRelationStatistics Valid=948, Invalid=5058, Unknown=0, NotChecked=0, Total=6006 [2021-06-05 23:27:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138226 states. [2021-06-05 23:27:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138226 to 88685. [2021-06-05 23:27:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88685 states, 88684 states have (on average 3.5912791484371476) internal successors, (318489), 88684 states have internal predecessors, (318489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88685 states to 88685 states and 318489 transitions. [2021-06-05 23:27:22,933 INFO L78 Accepts]: Start accepts. Automaton has 88685 states and 318489 transitions. Word has length 37 [2021-06-05 23:27:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:27:22,933 INFO L482 AbstractCegarLoop]: Abstraction has 88685 states and 318489 transitions. [2021-06-05 23:27:22,933 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:22,933 INFO L276 IsEmpty]: Start isEmpty. Operand 88685 states and 318489 transitions. [2021-06-05 23:27:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:27:23,026 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:27:23,026 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:27:23,226 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable482,99 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:27:23,227 INFO L430 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:27:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:27:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2010003491, now seen corresponding path program 97 times [2021-06-05 23:27:23,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:27:23,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063843763] [2021-06-05 23:27:23,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:27:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:27:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:23,703 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:27:23,703 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063843763] [2021-06-05 23:27:23,703 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063843763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:23,704 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530856805] [2021-06-05 23:27:23,704 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 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 23:27:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:27:23,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:27:23,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:27:23,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:27:23,798 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:23,809 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:23,809 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:23,809 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:50 [2021-06-05 23:27:23,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:23,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:27:23,848 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:23,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:23,861 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:23,861 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:61 [2021-06-05 23:27:23,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2021-06-05 23:27:23,939 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:23,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:23,953 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:23,953 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:63 [2021-06-05 23:27:24,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2021-06-05 23:27:24,003 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:24,009 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:24,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-06-05 23:27:24,018 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:24,023 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:24,023 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:24,023 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:23 [2021-06-05 23:27:24,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:27:24,079 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:24,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:24,081 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:24,081 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:27:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:24,104 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530856805] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:24,104 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:27:24,104 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2021-06-05 23:27:24,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396305727] [2021-06-05 23:27:24,104 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:27:24,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:27:24,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:27:24,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:27:24,104 INFO L87 Difference]: Start difference. First operand 88685 states and 318489 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:25,125 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2021-06-05 23:27:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:27:27,203 INFO L93 Difference]: Finished difference Result 136820 states and 487334 transitions. [2021-06-05 23:27:27,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 23:27:27,204 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:27:27,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:27:27,883 INFO L225 Difference]: With dead ends: 136820 [2021-06-05 23:27:27,883 INFO L226 Difference]: Without dead ends: 136614 [2021-06-05 23:27:27,883 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1998.2ms TimeCoverageRelationStatistics Valid=286, Invalid=1784, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 23:27:28,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136614 states. [2021-06-05 23:27:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136614 to 88703. [2021-06-05 23:27:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88703 states, 88702 states have (on average 3.5911704358413563) internal successors, (318544), 88702 states have internal predecessors, (318544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88703 states to 88703 states and 318544 transitions. [2021-06-05 23:27:29,744 INFO L78 Accepts]: Start accepts. Automaton has 88703 states and 318544 transitions. Word has length 37 [2021-06-05 23:27:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:27:29,744 INFO L482 AbstractCegarLoop]: Abstraction has 88703 states and 318544 transitions. [2021-06-05 23:27:29,744 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 88703 states and 318544 transitions. [2021-06-05 23:27:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:27:29,846 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:27:29,846 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:27:30,048 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable521 [2021-06-05 23:27:30,049 INFO L430 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:27:30,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:27:30,049 INFO L82 PathProgramCache]: Analyzing trace with hash -278214679, now seen corresponding path program 98 times [2021-06-05 23:27:30,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:27:30,049 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598060225] [2021-06-05 23:27:30,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:27:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:27:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:30,309 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:27:30,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598060225] [2021-06-05 23:27:30,310 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598060225] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:30,310 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091026753] [2021-06-05 23:27:30,310 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 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 23:27:30,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:27:30,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:27:30,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 49 conjunts are in the unsatisfiable core [2021-06-05 23:27:30,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:27:30,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:27:30,430 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:30,442 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:30,443 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:30,443 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:61 [2021-06-05 23:27:30,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:30,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:27:30,486 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:30,501 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:30,501 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:30,501 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:72 [2021-06-05 23:27:30,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2021-06-05 23:27:30,662 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:30,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:30,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-06-05 23:27:30,672 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:30,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:30,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2021-06-05 23:27:30,679 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:30,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:30,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:30,685 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:30 [2021-06-05 23:27:30,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2021-06-05 23:27:30,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:30,730 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:30,730 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:30,730 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:12 [2021-06-05 23:27:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:30,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091026753] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:30,769 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:27:30,769 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2021-06-05 23:27:30,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297237314] [2021-06-05 23:27:30,770 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:27:30,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:27:30,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:27:30,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:27:30,770 INFO L87 Difference]: Start difference. First operand 88703 states and 318544 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:32,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:27:32,419 INFO L93 Difference]: Finished difference Result 89417 states and 320556 transitions. [2021-06-05 23:27:32,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 23:27:32,419 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:27:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:27:32,631 INFO L225 Difference]: With dead ends: 89417 [2021-06-05 23:27:32,631 INFO L226 Difference]: Without dead ends: 89247 [2021-06-05 23:27:32,632 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 557.5ms TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:27:32,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89247 states. [2021-06-05 23:27:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89247 to 88757. [2021-06-05 23:27:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88757 states, 88756 states have (on average 3.5907431610257334) internal successors, (318700), 88756 states have internal predecessors, (318700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88757 states to 88757 states and 318700 transitions. [2021-06-05 23:27:34,741 INFO L78 Accepts]: Start accepts. Automaton has 88757 states and 318700 transitions. Word has length 37 [2021-06-05 23:27:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:27:34,741 INFO L482 AbstractCegarLoop]: Abstraction has 88757 states and 318700 transitions. [2021-06-05 23:27:34,741 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 88757 states and 318700 transitions. [2021-06-05 23:27:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:27:34,840 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:27:34,840 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:27:35,040 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable522,101 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:27:35,040 INFO L430 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:27:35,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:27:35,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1441798313, now seen corresponding path program 99 times [2021-06-05 23:27:35,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:27:35,040 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719572586] [2021-06-05 23:27:35,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:27:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:27:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:35,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:27:35,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719572586] [2021-06-05 23:27:35,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719572586] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:35,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351510722] [2021-06-05 23:27:35,307 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 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 23:27:35,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 23:27:35,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:27:35,337 WARN L261 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 23:27:35,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:27:35,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:27:35,425 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:35,435 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:35,435 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:35,435 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2021-06-05 23:27:35,480 INFO L354 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2021-06-05 23:27:35,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:27:35,481 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:35,492 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:35,493 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:35,493 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:56 [2021-06-05 23:27:35,744 INFO L446 ElimStorePlain]: Different costs {3=[v_C_168], 14=[A, B]} [2021-06-05 23:27:35,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:35,758 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-06-05 23:27:35,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 55 [2021-06-05 23:27:35,761 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:35,785 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:35,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:35,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:35,795 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:27:35,837 INFO L354 Elim1Store]: treesize reduction 22, result has 67.2 percent of original size [2021-06-05 23:27:35,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 86 [2021-06-05 23:27:35,850 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:27:36,001 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 61 [2021-06-05 23:27:36,002 INFO L628 ElimStorePlain]: treesize reduction 247, result has 35.7 percent of original size [2021-06-05 23:27:36,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:36,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:36,012 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:27:36,040 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:36,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 148 [2021-06-05 23:27:36,666 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2021-06-05 23:27:37,029 WARN L205 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 336 DAG size of output: 57 [2021-06-05 23:27:37,029 INFO L628 ElimStorePlain]: treesize reduction 2210, result has 5.5 percent of original size [2021-06-05 23:27:37,041 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:27:37,042 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:100, output treesize:168 [2021-06-05 23:27:37,703 INFO L446 ElimStorePlain]: Different costs {0=[C], 7=[v_prenex_6]} [2021-06-05 23:27:37,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:27:37,706 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:37,730 INFO L628 ElimStorePlain]: treesize reduction 5, result has 90.2 percent of original size [2021-06-05 23:27:37,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:37,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:37,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:27:37,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:37,734 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:27:37,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2021-06-05 23:27:37,735 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:37,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:37,745 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 23:27:37,745 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:20 [2021-06-05 23:27:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:37,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351510722] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:37,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:27:37,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 27 [2021-06-05 23:27:37,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298753288] [2021-06-05 23:27:37,803 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:27:37,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:27:37,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:27:37,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:27:37,803 INFO L87 Difference]: Start difference. First operand 88757 states and 318700 transitions. Second operand has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:40,320 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2021-06-05 23:27:41,187 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 105 [2021-06-05 23:27:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:27:41,848 INFO L93 Difference]: Finished difference Result 90270 states and 322896 transitions. [2021-06-05 23:27:41,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 23:27:41,849 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:27:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:27:42,061 INFO L225 Difference]: With dead ends: 90270 [2021-06-05 23:27:42,061 INFO L226 Difference]: Without dead ends: 89941 [2021-06-05 23:27:42,061 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 2492.4ms TimeCoverageRelationStatistics Valid=184, Invalid=2072, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 23:27:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89941 states. [2021-06-05 23:27:43,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89941 to 88767. [2021-06-05 23:27:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88767 states, 88766 states have (on average 3.5908343284590947) internal successors, (318744), 88766 states have internal predecessors, (318744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88767 states to 88767 states and 318744 transitions. [2021-06-05 23:27:43,871 INFO L78 Accepts]: Start accepts. Automaton has 88767 states and 318744 transitions. Word has length 37 [2021-06-05 23:27:43,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:27:43,871 INFO L482 AbstractCegarLoop]: Abstraction has 88767 states and 318744 transitions. [2021-06-05 23:27:43,871 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 27 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 88767 states and 318744 transitions. [2021-06-05 23:27:43,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:27:43,961 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:27:43,961 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:27:44,162 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable523 [2021-06-05 23:27:44,162 INFO L430 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:27:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:27:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1763816007, now seen corresponding path program 100 times [2021-06-05 23:27:44,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:27:44,163 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058410468] [2021-06-05 23:27:44,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:27:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:27:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:44,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:27:44,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058410468] [2021-06-05 23:27:44,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058410468] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:44,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706866949] [2021-06-05 23:27:44,347 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 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 23:27:44,374 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:27:44,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:27:44,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:27:44,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:27:44,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:27:44,460 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:44,471 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:44,472 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:44,472 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:68 [2021-06-05 23:27:44,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:44,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-06-05 23:27:44,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:44,525 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:44,525 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:44,525 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:83 [2021-06-05 23:27:44,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:44,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:44,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:44,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 44 [2021-06-05 23:27:44,621 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:44,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:44,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:44,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:44,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:44,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2021-06-05 23:27:44,633 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:44,639 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:44,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:44,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:44,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:44,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2021-06-05 23:27:44,644 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:44,648 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:44,649 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:44,649 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:87, output treesize:28 [2021-06-05 23:27:44,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:27:44,734 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:44,735 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:44,735 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:44,735 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:27:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:44,752 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706866949] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:44,752 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:27:44,752 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 23:27:44,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087905783] [2021-06-05 23:27:44,752 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:27:44,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:27:44,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:27:44,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:27:44,753 INFO L87 Difference]: Start difference. First operand 88767 states and 318744 transitions. Second operand has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:45,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:27:45,960 INFO L93 Difference]: Finished difference Result 89408 states and 320584 transitions. [2021-06-05 23:27:45,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-05 23:27:45,961 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:27:45,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:27:46,179 INFO L225 Difference]: With dead ends: 89408 [2021-06-05 23:27:46,180 INFO L226 Difference]: Without dead ends: 89383 [2021-06-05 23:27:46,180 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 385.8ms TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:27:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89383 states. [2021-06-05 23:27:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89383 to 88737. [2021-06-05 23:27:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88737 states, 88736 states have (on average 3.5911016949152543) internal successors, (318660), 88736 states have internal predecessors, (318660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88737 states to 88737 states and 318660 transitions. [2021-06-05 23:27:47,974 INFO L78 Accepts]: Start accepts. Automaton has 88737 states and 318660 transitions. Word has length 37 [2021-06-05 23:27:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:27:47,974 INFO L482 AbstractCegarLoop]: Abstraction has 88737 states and 318660 transitions. [2021-06-05 23:27:47,974 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 88737 states and 318660 transitions. [2021-06-05 23:27:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:27:48,067 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:27:48,067 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:27:48,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable606,103 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:27:48,267 INFO L430 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:27:48,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:27:48,268 INFO L82 PathProgramCache]: Analyzing trace with hash 509494781, now seen corresponding path program 101 times [2021-06-05 23:27:48,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:27:48,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083505448] [2021-06-05 23:27:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:27:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:27:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:48,618 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:27:48,618 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083505448] [2021-06-05 23:27:48,618 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083505448] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:48,618 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838855763] [2021-06-05 23:27:48,618 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 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 23:27:48,651 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-06-05 23:27:48,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:27:48,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 23:27:48,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:27:48,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:27:48,735 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:48,746 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:48,746 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:48,746 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:48 [2021-06-05 23:27:48,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-06-05 23:27:48,818 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:48,831 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:48,832 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:48,832 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2021-06-05 23:27:48,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2021-06-05 23:27:48,913 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:49,272 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-06-05 23:27:49,272 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:49,273 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:49,273 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:64 [2021-06-05 23:27:49,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:49,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:49,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:49,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:49,494 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:49,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 102 [2021-06-05 23:27:49,584 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2021-06-05 23:27:49,794 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 67 [2021-06-05 23:27:49,794 INFO L628 ElimStorePlain]: treesize reduction 1011, result has 13.4 percent of original size [2021-06-05 23:27:49,825 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:49,825 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:85, output treesize:212 [2021-06-05 23:27:49,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:27:49,916 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:49,920 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:49,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-06-05 23:27:49,921 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:49,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:49,923 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:49,923 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:27:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:49,943 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838855763] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:49,943 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:27:49,943 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-06-05 23:27:49,943 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230137830] [2021-06-05 23:27:49,943 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 23:27:49,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:27:49,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 23:27:49,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2021-06-05 23:27:49,944 INFO L87 Difference]: Start difference. First operand 88737 states and 318660 transitions. Second operand has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:52,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:27:52,841 INFO L93 Difference]: Finished difference Result 135060 states and 481754 transitions. [2021-06-05 23:27:52,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 23:27:52,842 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:27:52,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:27:53,207 INFO L225 Difference]: With dead ends: 135060 [2021-06-05 23:27:53,207 INFO L226 Difference]: Without dead ends: 135027 [2021-06-05 23:27:53,207 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1793.7ms TimeCoverageRelationStatistics Valid=292, Invalid=2158, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 23:27:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135027 states. [2021-06-05 23:27:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135027 to 88809. [2021-06-05 23:27:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88809 states, 88808 states have (on average 3.5906224664444646) internal successors, (318876), 88808 states have internal predecessors, (318876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88809 states to 88809 states and 318876 transitions. [2021-06-05 23:27:55,511 INFO L78 Accepts]: Start accepts. Automaton has 88809 states and 318876 transitions. Word has length 37 [2021-06-05 23:27:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:27:55,511 INFO L482 AbstractCegarLoop]: Abstraction has 88809 states and 318876 transitions. [2021-06-05 23:27:55,511 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:27:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 88809 states and 318876 transitions. [2021-06-05 23:27:55,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:27:55,604 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:27:55,604 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:27:55,805 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable607,104 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:27:55,805 INFO L430 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:27:55,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:27:55,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1034247721, now seen corresponding path program 102 times [2021-06-05 23:27:55,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:27:55,805 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881698006] [2021-06-05 23:27:55,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:27:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:27:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:56,161 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:27:56,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881698006] [2021-06-05 23:27:56,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881698006] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:56,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279686859] [2021-06-05 23:27:56,161 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 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 23:27:56,193 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-05 23:27:56,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:27:56,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 50 conjunts are in the unsatisfiable core [2021-06-05 23:27:56,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:27:56,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:27:56,318 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:56,330 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:56,330 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:56,330 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:62 [2021-06-05 23:27:56,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:56,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:27:56,375 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:56,388 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:56,389 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:27:56,389 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2021-06-05 23:27:56,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:56,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:56,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:56,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2021-06-05 23:27:56,479 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:56,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:56,500 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 1 xjuncts. [2021-06-05 23:27:56,500 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:86 [2021-06-05 23:27:56,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:56,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:56,773 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:56,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 58 [2021-06-05 23:27:56,775 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:56,798 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:56,822 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:27:56,823 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:127 [2021-06-05 23:27:57,027 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:57,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2021-06-05 23:27:57,030 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:27:57,047 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:57,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2021-06-05 23:27:57,050 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:27:57,068 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:57,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2021-06-05 23:27:57,070 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:57,089 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:57,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2021-06-05 23:27:57,091 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:57,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:57,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:57,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:57,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2021-06-05 23:27:57,115 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 3 xjuncts. [2021-06-05 23:27:57,276 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2021-06-05 23:27:57,277 INFO L628 ElimStorePlain]: treesize reduction 53, result has 84.2 percent of original size [2021-06-05 23:27:57,293 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:57,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 71 [2021-06-05 23:27:57,315 INFO L550 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: and 3 xjuncts. [2021-06-05 23:27:57,343 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:57,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 70 [2021-06-05 23:27:57,348 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2021-06-05 23:27:57,373 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:57,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2021-06-05 23:27:57,375 INFO L550 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:57,407 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:57,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2021-06-05 23:27:57,410 INFO L550 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-06-05 23:27:57,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:57,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:27:57,436 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:27:57,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 43 [2021-06-05 23:27:57,441 INFO L550 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 3 xjuncts. [2021-06-05 23:27:57,640 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 58 [2021-06-05 23:27:57,641 INFO L628 ElimStorePlain]: treesize reduction 168, result has 46.2 percent of original size [2021-06-05 23:27:57,648 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2021-06-05 23:27:57,648 INFO L247 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:264, output treesize:194 [2021-06-05 23:27:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:27:57,778 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279686859] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:27:57,778 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:27:57,778 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2021-06-05 23:27:57,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189105541] [2021-06-05 23:27:57,779 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 23:27:57,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:27:57,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 23:27:57,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2021-06-05 23:27:57,779 INFO L87 Difference]: Start difference. First operand 88809 states and 318876 transitions. Second operand has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:28:01,639 INFO L93 Difference]: Finished difference Result 161911 states and 576190 transitions. [2021-06-05 23:28:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 23:28:01,639 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:28:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:28:02,094 INFO L225 Difference]: With dead ends: 161911 [2021-06-05 23:28:02,094 INFO L226 Difference]: Without dead ends: 161845 [2021-06-05 23:28:02,094 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 777 ImplicationChecksByTransitivity, 2504.2ms TimeCoverageRelationStatistics Valid=530, Invalid=2776, Unknown=0, NotChecked=0, Total=3306 [2021-06-05 23:28:02,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161845 states. [2021-06-05 23:28:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161845 to 88852. [2021-06-05 23:28:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88852 states, 88851 states have (on average 3.5904379241651756) internal successors, (319014), 88851 states have internal predecessors, (319014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:04,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88852 states to 88852 states and 319014 transitions. [2021-06-05 23:28:04,613 INFO L78 Accepts]: Start accepts. Automaton has 88852 states and 319014 transitions. Word has length 37 [2021-06-05 23:28:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:28:04,614 INFO L482 AbstractCegarLoop]: Abstraction has 88852 states and 319014 transitions. [2021-06-05 23:28:04,614 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:04,614 INFO L276 IsEmpty]: Start isEmpty. Operand 88852 states and 319014 transitions. [2021-06-05 23:28:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:28:04,718 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:28:04,718 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:28:04,932 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 105 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable640 [2021-06-05 23:28:04,933 INFO L430 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:28:04,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:28:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash -609300511, now seen corresponding path program 103 times [2021-06-05 23:28:04,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:28:04,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139772101] [2021-06-05 23:28:04,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:28:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:28:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:05,266 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:28:05,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139772101] [2021-06-05 23:28:05,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139772101] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:05,266 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244498358] [2021-06-05 23:28:05,266 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 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 23:28:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:28:05,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:28:05,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:28:05,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:28:05,385 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:05,396 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:05,396 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:05,396 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:58 [2021-06-05 23:28:05,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:05,436 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-06-05 23:28:05,437 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:05,451 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:05,452 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:05,452 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:75 [2021-06-05 23:28:05,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:05,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:05,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:05,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2021-06-05 23:28:05,498 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:05,513 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:05,514 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:05,514 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:81 [2021-06-05 23:28:05,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:05,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:05,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:05,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2021-06-05 23:28:05,671 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:05,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:05,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:05,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:05,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:05,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2021-06-05 23:28:05,683 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:05,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:05,688 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:05,688 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:42 [2021-06-05 23:28:05,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:28:05,722 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:05,723 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:05,723 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:05,723 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:28:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:05,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244498358] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:05,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:28:05,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:28:05,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570076094] [2021-06-05 23:28:05,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:28:05,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:28:05,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:28:05,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:28:05,748 INFO L87 Difference]: Start difference. First operand 88852 states and 319014 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:07,246 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2021-06-05 23:28:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:28:08,409 INFO L93 Difference]: Finished difference Result 135786 states and 484053 transitions. [2021-06-05 23:28:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 23:28:08,410 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:28:08,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:28:08,800 INFO L225 Difference]: With dead ends: 135786 [2021-06-05 23:28:08,801 INFO L226 Difference]: Without dead ends: 135683 [2021-06-05 23:28:08,801 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1583.0ms TimeCoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 23:28:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135683 states. [2021-06-05 23:28:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135683 to 88831. [2021-06-05 23:28:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88831 states, 88830 states have (on average 3.590554992682652) internal successors, (318949), 88830 states have internal predecessors, (318949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88831 states to 88831 states and 318949 transitions. [2021-06-05 23:28:11,092 INFO L78 Accepts]: Start accepts. Automaton has 88831 states and 318949 transitions. Word has length 37 [2021-06-05 23:28:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:28:11,092 INFO L482 AbstractCegarLoop]: Abstraction has 88831 states and 318949 transitions. [2021-06-05 23:28:11,092 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 88831 states and 318949 transitions. [2021-06-05 23:28:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:28:11,192 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:28:11,192 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:28:11,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680,106 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:28:11,392 INFO L430 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:28:11,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:28:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1735954907, now seen corresponding path program 104 times [2021-06-05 23:28:11,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:28:11,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984443598] [2021-06-05 23:28:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:28:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:28:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:11,742 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:28:11,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984443598] [2021-06-05 23:28:11,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984443598] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:11,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131450893] [2021-06-05 23:28:11,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 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 23:28:11,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:28:11,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:28:11,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:28:11,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:28:11,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:28:11,857 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:11,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:11,868 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:11,868 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2021-06-05 23:28:11,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:11,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:28:11,907 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:11,919 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:11,920 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:11,920 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:63 [2021-06-05 23:28:11,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2021-06-05 23:28:11,962 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:11,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:11,976 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:11,976 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:65 [2021-06-05 23:28:12,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2021-06-05 23:28:12,067 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:12,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:12,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-06-05 23:28:12,076 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:12,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:12,080 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:12,081 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:23 [2021-06-05 23:28:12,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:28:12,139 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:12,140 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:12,141 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:12,141 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:28:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:12,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131450893] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:12,163 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:28:12,164 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:28:12,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561440155] [2021-06-05 23:28:12,164 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:28:12,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:28:12,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:28:12,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:28:12,164 INFO L87 Difference]: Start difference. First operand 88831 states and 318949 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:13,038 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-06-05 23:28:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:28:14,623 INFO L93 Difference]: Finished difference Result 135492 states and 483164 transitions. [2021-06-05 23:28:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 23:28:14,623 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:28:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:28:14,973 INFO L225 Difference]: With dead ends: 135492 [2021-06-05 23:28:14,973 INFO L226 Difference]: Without dead ends: 135379 [2021-06-05 23:28:14,973 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1460.2ms TimeCoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 23:28:15,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135379 states. [2021-06-05 23:28:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135379 to 88833. [2021-06-05 23:28:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88833 states, 88832 states have (on average 3.5906092399135447) internal successors, (318961), 88832 states have internal predecessors, (318961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88833 states to 88833 states and 318961 transitions. [2021-06-05 23:28:17,203 INFO L78 Accepts]: Start accepts. Automaton has 88833 states and 318961 transitions. Word has length 37 [2021-06-05 23:28:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:28:17,203 INFO L482 AbstractCegarLoop]: Abstraction has 88833 states and 318961 transitions. [2021-06-05 23:28:17,204 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 88833 states and 318961 transitions. [2021-06-05 23:28:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:28:17,303 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:28:17,303 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:28:17,512 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable681,107 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:28:17,513 INFO L430 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:28:17,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:28:17,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1287858783, now seen corresponding path program 105 times [2021-06-05 23:28:17,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:28:17,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674104246] [2021-06-05 23:28:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:28:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:28:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:17,896 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:28:17,896 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674104246] [2021-06-05 23:28:17,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674104246] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:17,896 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484306003] [2021-06-05 23:28:17,896 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 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 23:28:17,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-06-05 23:28:17,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:28:17,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 50 conjunts are in the unsatisfiable core [2021-06-05 23:28:17,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:28:18,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:28:18,056 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:18,069 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:18,070 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:18,070 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:55 [2021-06-05 23:28:18,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:28:18,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:18,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:18,129 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:18,129 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2021-06-05 23:28:18,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,238 INFO L354 Elim1Store]: treesize reduction 46, result has 22.0 percent of original size [2021-06-05 23:28:18,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 46 [2021-06-05 23:28:18,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:18,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:18,261 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 1 xjuncts. [2021-06-05 23:28:18,261 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:86 [2021-06-05 23:28:18,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,418 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:18,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 47 [2021-06-05 23:28:18,419 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:28:18,437 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:18,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:18,447 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:18,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2021-06-05 23:28:18,449 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:28:18,463 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:18,469 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:28:18,469 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2021-06-05 23:28:19,061 INFO L446 ElimStorePlain]: Different costs {2=[C], 5=[v_prenex_7]} [2021-06-05 23:28:19,073 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:19,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2021-06-05 23:28:19,075 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:19,095 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:19,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:19,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:19,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:19,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2021-06-05 23:28:19,114 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:28:19,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:19,136 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 23:28:19,136 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:45 [2021-06-05 23:28:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:19,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484306003] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:19,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:28:19,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2021-06-05 23:28:19,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650214779] [2021-06-05 23:28:19,235 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 23:28:19,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:28:19,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 23:28:19,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2021-06-05 23:28:19,235 INFO L87 Difference]: Start difference. First operand 88833 states and 318961 transitions. Second operand has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:24,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:28:24,322 INFO L93 Difference]: Finished difference Result 135881 states and 484094 transitions. [2021-06-05 23:28:24,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 23:28:24,323 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:28:24,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:28:24,701 INFO L225 Difference]: With dead ends: 135881 [2021-06-05 23:28:24,701 INFO L226 Difference]: Without dead ends: 135833 [2021-06-05 23:28:24,702 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2191.1ms TimeCoverageRelationStatistics Valid=329, Invalid=1833, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 23:28:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135833 states. [2021-06-05 23:28:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135833 to 88863. [2021-06-05 23:28:26,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88863 states, 88862 states have (on average 3.590747451103959) internal successors, (319081), 88862 states have internal predecessors, (319081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88863 states to 88863 states and 319081 transitions. [2021-06-05 23:28:26,751 INFO L78 Accepts]: Start accepts. Automaton has 88863 states and 319081 transitions. Word has length 37 [2021-06-05 23:28:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:28:26,751 INFO L482 AbstractCegarLoop]: Abstraction has 88863 states and 319081 transitions. [2021-06-05 23:28:26,751 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 88863 states and 319081 transitions. [2021-06-05 23:28:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:28:27,285 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:28:27,285 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:28:27,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable682,108 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:28:27,501 INFO L430 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:28:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:28:27,501 INFO L82 PathProgramCache]: Analyzing trace with hash -82371281, now seen corresponding path program 106 times [2021-06-05 23:28:27,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:28:27,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969034163] [2021-06-05 23:28:27,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:28:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:28:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:27,897 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:28:27,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969034163] [2021-06-05 23:28:27,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969034163] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:27,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128634020] [2021-06-05 23:28:27,897 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 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 23:28:27,925 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:28:27,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:28:27,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:28:27,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:28:28,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:28:28,011 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:28,022 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:28,022 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:28,022 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:58 [2021-06-05 23:28:28,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:28,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:28:28,063 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:28,076 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:28,077 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:28,077 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:69 [2021-06-05 23:28:28,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:28,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:28,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:28,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2021-06-05 23:28:28,161 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:28,176 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:28,176 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:28,177 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:97 [2021-06-05 23:28:28,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:28,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:28,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:28,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 45 [2021-06-05 23:28:28,284 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:28,291 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:28,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:28,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:28,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:28,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2021-06-05 23:28:28,295 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:28,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:28,301 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:28,301 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:42 [2021-06-05 23:28:28,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:28:28,333 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:28,335 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:28,335 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:28,335 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:28:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:28,361 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128634020] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:28,361 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:28:28,361 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:28:28,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081841292] [2021-06-05 23:28:28,361 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:28:28,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:28:28,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:28:28,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:28:28,362 INFO L87 Difference]: Start difference. First operand 88863 states and 319081 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:31,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:28:31,573 INFO L93 Difference]: Finished difference Result 140988 states and 500508 transitions. [2021-06-05 23:28:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 23:28:31,574 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:28:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:28:31,960 INFO L225 Difference]: With dead ends: 140988 [2021-06-05 23:28:31,960 INFO L226 Difference]: Without dead ends: 140779 [2021-06-05 23:28:31,960 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 2054.7ms TimeCoverageRelationStatistics Valid=412, Invalid=2240, Unknown=0, NotChecked=0, Total=2652 [2021-06-05 23:28:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140779 states. [2021-06-05 23:28:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140779 to 89456. [2021-06-05 23:28:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89456 states, 89455 states have (on average 3.591023419596445) internal successors, (321235), 89455 states have internal predecessors, (321235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89456 states to 89456 states and 321235 transitions. [2021-06-05 23:28:34,300 INFO L78 Accepts]: Start accepts. Automaton has 89456 states and 321235 transitions. Word has length 37 [2021-06-05 23:28:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:28:34,301 INFO L482 AbstractCegarLoop]: Abstraction has 89456 states and 321235 transitions. [2021-06-05 23:28:34,301 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 89456 states and 321235 transitions. [2021-06-05 23:28:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:28:34,407 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:28:34,407 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:28:34,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable695,109 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:28:34,608 INFO L430 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:28:34,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:28:34,608 INFO L82 PathProgramCache]: Analyzing trace with hash -781367075, now seen corresponding path program 107 times [2021-06-05 23:28:34,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:28:34,608 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528707072] [2021-06-05 23:28:34,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:28:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:28:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:34,961 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:28:34,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528707072] [2021-06-05 23:28:34,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528707072] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:34,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451645986] [2021-06-05 23:28:34,962 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:28:34,992 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 23:28:34,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:28:34,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 51 conjunts are in the unsatisfiable core [2021-06-05 23:28:34,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:28:35,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:28:35,080 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:35,089 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:35,090 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:35,090 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:55 [2021-06-05 23:28:35,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-06-05 23:28:35,172 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:35,188 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:35,189 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:35,189 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:75 [2021-06-05 23:28:35,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2021-06-05 23:28:35,272 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:35,296 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:35,297 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 1 xjuncts. [2021-06-05 23:28:35,298 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:95, output treesize:94 [2021-06-05 23:28:35,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,757 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:35,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 109 [2021-06-05 23:28:35,769 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:28:35,832 INFO L628 ElimStorePlain]: treesize reduction 228, result has 29.2 percent of original size [2021-06-05 23:28:35,837 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:28:35,837 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:121, output treesize:91 [2021-06-05 23:28:35,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:28:35,943 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:35,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:28:35,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:28:35,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,949 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:28:35,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2021-06-05 23:28:35,950 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:35,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:35,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:28:35,978 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:35,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:28:35,983 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:28:35,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:35,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:28:35,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2021-06-05 23:28:35,985 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:36,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:36,007 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 23:28:36,007 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:26 [2021-06-05 23:28:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:36,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451645986] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:36,078 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:28:36,078 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2021-06-05 23:28:36,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149375055] [2021-06-05 23:28:36,079 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:28:36,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:28:36,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:28:36,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=671, Unknown=3, NotChecked=0, Total=756 [2021-06-05 23:28:36,079 INFO L87 Difference]: Start difference. First operand 89456 states and 321235 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:36,811 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2021-06-05 23:28:38,959 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 80 [2021-06-05 23:28:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:28:40,938 INFO L93 Difference]: Finished difference Result 162035 states and 577050 transitions. [2021-06-05 23:28:40,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 23:28:40,938 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:28:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:28:41,400 INFO L225 Difference]: With dead ends: 162035 [2021-06-05 23:28:41,400 INFO L226 Difference]: Without dead ends: 161987 [2021-06-05 23:28:41,400 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 3246.0ms TimeCoverageRelationStatistics Valid=332, Invalid=2524, Unknown=6, NotChecked=0, Total=2862 [2021-06-05 23:28:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161987 states. [2021-06-05 23:28:43,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161987 to 89481. [2021-06-05 23:28:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89481 states, 89480 states have (on average 3.590925346446133) internal successors, (321316), 89480 states have internal predecessors, (321316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89481 states to 89481 states and 321316 transitions. [2021-06-05 23:28:43,912 INFO L78 Accepts]: Start accepts. Automaton has 89481 states and 321316 transitions. Word has length 37 [2021-06-05 23:28:43,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:28:43,912 INFO L482 AbstractCegarLoop]: Abstraction has 89481 states and 321316 transitions. [2021-06-05 23:28:43,912 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 89481 states and 321316 transitions. [2021-06-05 23:28:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:28:44,010 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:28:44,010 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:28:44,212 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable696 [2021-06-05 23:28:44,212 INFO L430 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:28:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:28:44,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1034978137, now seen corresponding path program 108 times [2021-06-05 23:28:44,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:28:44,213 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670483991] [2021-06-05 23:28:44,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:28:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:28:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:44,589 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:28:44,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670483991] [2021-06-05 23:28:44,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670483991] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:44,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676419672] [2021-06-05 23:28:44,589 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 23:28:44,619 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 23:28:44,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:28:44,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 49 conjunts are in the unsatisfiable core [2021-06-05 23:28:44,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:28:44,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:28:44,712 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:44,724 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:44,724 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:44,725 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:58 [2021-06-05 23:28:44,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:44,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-06-05 23:28:44,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:44,785 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:44,786 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:44,786 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:69 [2021-06-05 23:28:44,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:44,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:44,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:44,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2021-06-05 23:28:44,873 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:44,890 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:44,891 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:44,891 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:87, output treesize:86 [2021-06-05 23:28:44,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:44,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:44,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:44,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2021-06-05 23:28:44,949 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:44,957 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:44,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:44,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:44,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:44,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2021-06-05 23:28:44,962 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:44,968 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:44,968 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:44,968 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:33 [2021-06-05 23:28:45,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:28:45,071 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:45,075 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:45,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:45,076 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:12 [2021-06-05 23:28:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:45,127 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676419672] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:45,127 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:28:45,127 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2021-06-05 23:28:45,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675598778] [2021-06-05 23:28:45,127 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 23:28:45,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:28:45,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 23:28:45,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2021-06-05 23:28:45,128 INFO L87 Difference]: Start difference. First operand 89481 states and 321316 transitions. Second operand has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:28:47,409 INFO L93 Difference]: Finished difference Result 136272 states and 485934 transitions. [2021-06-05 23:28:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 23:28:47,410 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:28:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:28:47,807 INFO L225 Difference]: With dead ends: 136272 [2021-06-05 23:28:47,808 INFO L226 Difference]: Without dead ends: 136239 [2021-06-05 23:28:47,808 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1116.1ms TimeCoverageRelationStatistics Valid=186, Invalid=1146, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 23:28:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136239 states. [2021-06-05 23:28:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136239 to 89480. [2021-06-05 23:28:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89480 states, 89479 states have (on average 3.5911331150325774) internal successors, (321331), 89479 states have internal predecessors, (321331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89480 states to 89480 states and 321331 transitions. [2021-06-05 23:28:50,105 INFO L78 Accepts]: Start accepts. Automaton has 89480 states and 321331 transitions. Word has length 37 [2021-06-05 23:28:50,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:28:50,105 INFO L482 AbstractCegarLoop]: Abstraction has 89480 states and 321331 transitions. [2021-06-05 23:28:50,105 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 89480 states and 321331 transitions. [2021-06-05 23:28:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:28:50,200 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:28:50,200 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:28:50,401 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable713,111 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:28:50,401 INFO L430 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:28:50,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:28:50,401 INFO L82 PathProgramCache]: Analyzing trace with hash 783570721, now seen corresponding path program 109 times [2021-06-05 23:28:50,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:28:50,401 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578392462] [2021-06-05 23:28:50,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:28:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:28:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:50,694 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:28:50,694 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578392462] [2021-06-05 23:28:50,694 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578392462] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:50,694 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643755524] [2021-06-05 23:28:50,694 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 23:28:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:28:50,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:28:50,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:28:50,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:28:50,801 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:50,812 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:50,813 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:50,813 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:48 [2021-06-05 23:28:50,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2021-06-05 23:28:50,850 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:50,863 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:50,863 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:50,863 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2021-06-05 23:28:50,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2021-06-05 23:28:50,904 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:50,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:50,919 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:50,919 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:61 [2021-06-05 23:28:51,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2021-06-05 23:28:51,053 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:51,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:51,060 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:51,060 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:43 [2021-06-05 23:28:51,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:28:51,097 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:51,100 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:51,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-06-05 23:28:51,102 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:51,103 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:51,103 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:51,103 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:28:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:51,126 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643755524] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:51,126 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:28:51,126 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2021-06-05 23:28:51,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115930698] [2021-06-05 23:28:51,126 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:28:51,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:28:51,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:28:51,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:28:51,127 INFO L87 Difference]: Start difference. First operand 89480 states and 321331 transitions. Second operand has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 22 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:28:53,810 INFO L93 Difference]: Finished difference Result 161746 states and 576431 transitions. [2021-06-05 23:28:53,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 23:28:53,810 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 22 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:28:53,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:28:54,279 INFO L225 Difference]: With dead ends: 161746 [2021-06-05 23:28:54,280 INFO L226 Difference]: Without dead ends: 161713 [2021-06-05 23:28:54,280 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1250.3ms TimeCoverageRelationStatistics Valid=251, Invalid=1641, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 23:28:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161713 states. [2021-06-05 23:28:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161713 to 89423. [2021-06-05 23:28:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89423 states, 89422 states have (on average 3.5913645411643667) internal successors, (321147), 89422 states have internal predecessors, (321147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:56,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89423 states to 89423 states and 321147 transitions. [2021-06-05 23:28:56,720 INFO L78 Accepts]: Start accepts. Automaton has 89423 states and 321147 transitions. Word has length 37 [2021-06-05 23:28:56,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:28:56,723 INFO L482 AbstractCegarLoop]: Abstraction has 89423 states and 321147 transitions. [2021-06-05 23:28:56,723 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.869565217391304) internal successors, (66), 22 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 89423 states and 321147 transitions. [2021-06-05 23:28:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:28:56,825 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:28:56,825 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:28:57,025 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable714 [2021-06-05 23:28:57,026 INFO L430 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:28:57,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:28:57,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1387674659, now seen corresponding path program 110 times [2021-06-05 23:28:57,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:28:57,026 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130410787] [2021-06-05 23:28:57,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:28:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:28:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:57,301 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:28:57,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130410787] [2021-06-05 23:28:57,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130410787] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:57,301 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119607269] [2021-06-05 23:28:57,301 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 23:28:57,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:28:57,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:28:57,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 23:28:57,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:28:57,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:28:57,394 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:57,405 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:57,405 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:57,405 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:56 [2021-06-05 23:28:57,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:28:57,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2021-06-05 23:28:57,585 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:57,600 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:57,600 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:57,600 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:92, output treesize:90 [2021-06-05 23:28:57,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2021-06-05 23:28:57,702 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:57,709 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:58,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-06-05 23:28:58,018 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:58,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:58,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2021-06-05 23:28:58,027 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:28:58,032 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:58,033 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:58,033 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:25 [2021-06-05 23:28:58,120 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:58,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2021-06-05 23:28:58,123 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:28:58,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:28:58,131 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:28:58,131 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:21 [2021-06-05 23:28:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:28:58,181 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119607269] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:28:58,181 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:28:58,181 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2021-06-05 23:28:58,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850082968] [2021-06-05 23:28:58,181 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 23:28:58,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:28:58,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 23:28:58,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-06-05 23:28:58,181 INFO L87 Difference]: Start difference. First operand 89423 states and 321147 transitions. Second operand has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:28:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:28:59,782 INFO L93 Difference]: Finished difference Result 90310 states and 323684 transitions. [2021-06-05 23:28:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 23:28:59,783 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:28:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:29:00,018 INFO L225 Difference]: With dead ends: 90310 [2021-06-05 23:29:00,018 INFO L226 Difference]: Without dead ends: 90211 [2021-06-05 23:29:00,019 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 977.1ms TimeCoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 23:29:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90211 states. [2021-06-05 23:29:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90211 to 89467. [2021-06-05 23:29:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89467 states, 89466 states have (on average 3.5910066393937363) internal successors, (321273), 89466 states have internal predecessors, (321273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89467 states to 89467 states and 321273 transitions. [2021-06-05 23:29:02,069 INFO L78 Accepts]: Start accepts. Automaton has 89467 states and 321273 transitions. Word has length 37 [2021-06-05 23:29:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:29:02,070 INFO L482 AbstractCegarLoop]: Abstraction has 89467 states and 321273 transitions. [2021-06-05 23:29:02,070 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:02,070 INFO L276 IsEmpty]: Start isEmpty. Operand 89467 states and 321273 transitions. [2021-06-05 23:29:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:29:02,161 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:29:02,161 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:29:02,361 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable715,113 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:29:02,361 INFO L430 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:29:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:29:02,362 INFO L82 PathProgramCache]: Analyzing trace with hash -204448505, now seen corresponding path program 111 times [2021-06-05 23:29:02,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:29:02,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787228539] [2021-06-05 23:29:02,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:29:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:29:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:02,591 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:29:02,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787228539] [2021-06-05 23:29:02,591 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787228539] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:02,591 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375904669] [2021-06-05 23:29:02,591 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 23:29:02,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-06-05 23:29:02,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:29:02,623 WARN L261 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 23:29:02,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:29:02,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:29:02,679 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:02,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:02,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:02,689 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:53 [2021-06-05 23:29:02,883 INFO L354 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2021-06-05 23:29:02,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2021-06-05 23:29:02,884 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:02,896 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:02,897 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:02,897 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:64 [2021-06-05 23:29:02,988 INFO L446 ElimStorePlain]: Different costs {3=[v_C_204], 7=[A, B]} [2021-06-05 23:29:02,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:03,002 INFO L354 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2021-06-05 23:29:03,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 49 [2021-06-05 23:29:03,003 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:03,023 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:03,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:03,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:03,056 INFO L354 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2021-06-05 23:29:03,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 71 [2021-06-05 23:29:03,059 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:03,095 INFO L628 ElimStorePlain]: treesize reduction 54, result has 53.0 percent of original size [2021-06-05 23:29:03,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:03,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:03,118 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:03,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 72 [2021-06-05 23:29:03,147 INFO L550 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: and 4 xjuncts. [2021-06-05 23:29:03,172 INFO L628 ElimStorePlain]: treesize reduction 75, result has 34.2 percent of original size [2021-06-05 23:29:03,175 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:29:03,175 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:84, output treesize:39 [2021-06-05 23:29:03,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:03,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:03,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:03,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:03,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:03,387 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:03,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 63 [2021-06-05 23:29:03,399 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2021-06-05 23:29:03,434 INFO L628 ElimStorePlain]: treesize reduction 63, result has 34.4 percent of original size [2021-06-05 23:29:03,437 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:03,437 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:28 [2021-06-05 23:29:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:03,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375904669] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:03,487 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:29:03,487 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 27 [2021-06-05 23:29:03,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772736418] [2021-06-05 23:29:03,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:29:03,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:29:03,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:29:03,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:29:03,488 INFO L87 Difference]: Start difference. First operand 89467 states and 321273 transitions. Second operand has 28 states, 28 states have (on average 2.5) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:04,520 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-06-05 23:29:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:29:07,113 INFO L93 Difference]: Finished difference Result 90858 states and 325205 transitions. [2021-06-05 23:29:07,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-06-05 23:29:07,114 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:29:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:29:07,341 INFO L225 Difference]: With dead ends: 90858 [2021-06-05 23:29:07,342 INFO L226 Difference]: Without dead ends: 90504 [2021-06-05 23:29:07,342 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 2285.5ms TimeCoverageRelationStatistics Valid=349, Invalid=3191, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 23:29:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90504 states. [2021-06-05 23:29:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90504 to 89427. [2021-06-05 23:29:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89427 states, 89426 states have (on average 3.5913380895936307) internal successors, (321159), 89426 states have internal predecessors, (321159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:09,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89427 states to 89427 states and 321159 transitions. [2021-06-05 23:29:09,160 INFO L78 Accepts]: Start accepts. Automaton has 89427 states and 321159 transitions. Word has length 37 [2021-06-05 23:29:09,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:29:09,160 INFO L482 AbstractCegarLoop]: Abstraction has 89427 states and 321159 transitions. [2021-06-05 23:29:09,160 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.5) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 89427 states and 321159 transitions. [2021-06-05 23:29:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:29:09,256 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:29:09,256 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:29:09,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 114 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable720 [2021-06-05 23:29:09,456 INFO L430 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:29:09,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:29:09,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2071203389, now seen corresponding path program 112 times [2021-06-05 23:29:09,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:29:09,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901988496] [2021-06-05 23:29:09,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:29:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:29:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:09,734 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:29:09,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901988496] [2021-06-05 23:29:09,734 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901988496] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:09,734 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201541591] [2021-06-05 23:29:09,734 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 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 23:29:09,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:29:09,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:29:09,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:29:09,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:29:09,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:29:09,811 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:09,820 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:09,821 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:09,821 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2021-06-05 23:29:09,896 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:29:09,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:09,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2021-06-05 23:29:09,898 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:09,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:09,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:09,912 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:69 [2021-06-05 23:29:10,022 INFO L446 ElimStorePlain]: Different costs {0=[A, B], 5=[v_C_207]} [2021-06-05 23:29:10,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-06-05 23:29:10,025 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:10,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:10,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2021-06-05 23:29:10,035 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:10,040 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:10,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:29:10,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:10,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:10,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2021-06-05 23:29:10,043 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:10,048 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:10,048 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:10,048 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:31 [2021-06-05 23:29:10,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2021-06-05 23:29:10,078 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:10,079 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:10,080 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:10,080 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:5 [2021-06-05 23:29:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:10,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201541591] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:10,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:29:10,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2021-06-05 23:29:10,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814826032] [2021-06-05 23:29:10,095 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 23:29:10,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:29:10,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 23:29:10,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-06-05 23:29:10,095 INFO L87 Difference]: Start difference. First operand 89427 states and 321159 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:11,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:29:11,190 INFO L93 Difference]: Finished difference Result 89808 states and 322200 transitions. [2021-06-05 23:29:11,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 23:29:11,191 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:29:11,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:29:11,415 INFO L225 Difference]: With dead ends: 89808 [2021-06-05 23:29:11,416 INFO L226 Difference]: Without dead ends: 89634 [2021-06-05 23:29:11,416 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 557.8ms TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-06-05 23:29:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89634 states. [2021-06-05 23:29:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89634 to 89479. [2021-06-05 23:29:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89479 states, 89478 states have (on average 3.590994434386106) internal successors, (321315), 89478 states have internal predecessors, (321315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89479 states to 89479 states and 321315 transitions. [2021-06-05 23:29:13,105 INFO L78 Accepts]: Start accepts. Automaton has 89479 states and 321315 transitions. Word has length 37 [2021-06-05 23:29:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:29:13,105 INFO L482 AbstractCegarLoop]: Abstraction has 89479 states and 321315 transitions. [2021-06-05 23:29:13,106 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:13,106 INFO L276 IsEmpty]: Start isEmpty. Operand 89479 states and 321315 transitions. [2021-06-05 23:29:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:29:13,208 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:29:13,208 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:29:13,408 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable742,115 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:29:13,408 INFO L430 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:29:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:29:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash -73660215, now seen corresponding path program 113 times [2021-06-05 23:29:13,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:29:13,409 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513524510] [2021-06-05 23:29:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:29:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:29:14,042 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2021-06-05 23:29:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:14,140 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:29:14,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513524510] [2021-06-05 23:29:14,140 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513524510] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:14,140 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929560575] [2021-06-05 23:29:14,141 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 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 23:29:14,169 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 23:29:14,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:29:14,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 23:29:14,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:29:14,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:29:14,224 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:14,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:14,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:14,236 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:45 [2021-06-05 23:29:14,392 INFO L354 Elim1Store]: treesize reduction 76, result has 14.6 percent of original size [2021-06-05 23:29:14,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 132 [2021-06-05 23:29:14,393 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:14,410 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:14,411 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:14,411 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:184, output treesize:183 [2021-06-05 23:29:16,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:16,818 INFO L354 Elim1Store]: treesize reduction 200, result has 7.8 percent of original size [2021-06-05 23:29:16,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 303 treesize of output 209 [2021-06-05 23:29:16,820 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:16,841 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:16,842 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:16,843 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:308, output treesize:123 [2021-06-05 23:29:16,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:16,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:16,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:16,940 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:16,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 91 [2021-06-05 23:29:16,942 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:16,969 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:16,980 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:16,980 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:121, output treesize:390 [2021-06-05 23:29:17,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:29:17,097 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:17,101 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:17,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-06-05 23:29:17,102 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:17,104 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:17,104 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:17,104 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:29:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:17,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929560575] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:17,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:29:17,125 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2021-06-05 23:29:17,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635593246] [2021-06-05 23:29:17,125 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:29:17,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:29:17,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:29:17,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=662, Unknown=1, NotChecked=0, Total=756 [2021-06-05 23:29:17,126 INFO L87 Difference]: Start difference. First operand 89479 states and 321315 transitions. Second operand has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:29:27,260 INFO L93 Difference]: Finished difference Result 136082 states and 485354 transitions. [2021-06-05 23:29:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 23:29:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:29:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:29:27,710 INFO L225 Difference]: With dead ends: 136082 [2021-06-05 23:29:27,711 INFO L226 Difference]: Without dead ends: 136031 [2021-06-05 23:29:27,711 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 5019.8ms TimeCoverageRelationStatistics Valid=366, Invalid=2825, Unknown=1, NotChecked=0, Total=3192 [2021-06-05 23:29:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136031 states. [2021-06-05 23:29:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136031 to 89503. [2021-06-05 23:29:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89503 states, 89502 states have (on average 3.590791267234252) internal successors, (321383), 89502 states have internal predecessors, (321383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89503 states to 89503 states and 321383 transitions. [2021-06-05 23:29:29,789 INFO L78 Accepts]: Start accepts. Automaton has 89503 states and 321383 transitions. Word has length 37 [2021-06-05 23:29:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:29:29,789 INFO L482 AbstractCegarLoop]: Abstraction has 89503 states and 321383 transitions. [2021-06-05 23:29:29,790 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 89503 states and 321383 transitions. [2021-06-05 23:29:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:29:29,887 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:29:29,887 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:29:30,088 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable743 [2021-06-05 23:29:30,088 INFO L430 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:29:30,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:29:30,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1617402717, now seen corresponding path program 114 times [2021-06-05 23:29:30,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:29:30,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288082617] [2021-06-05 23:29:30,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:29:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:29:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:30,927 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:29:30,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288082617] [2021-06-05 23:29:30,927 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288082617] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:30,927 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850566362] [2021-06-05 23:29:30,927 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 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 23:29:30,956 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 23:29:30,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:29:30,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 49 conjunts are in the unsatisfiable core [2021-06-05 23:29:30,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:29:31,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:29:31,015 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:31,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:31,027 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:31,027 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:56 [2021-06-05 23:29:31,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:31,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2021-06-05 23:29:31,136 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:31,154 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:31,154 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:31,154 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:93, output treesize:92 [2021-06-05 23:29:31,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:31,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:31,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:31,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2021-06-05 23:29:31,310 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:31,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:31,328 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:31,328 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:104 [2021-06-05 23:29:31,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:31,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:31,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:31,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 54 [2021-06-05 23:29:31,389 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:31,397 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:31,397 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:31,397 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:105, output treesize:68 [2021-06-05 23:29:31,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:29:31,439 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:31,443 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:31,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-06-05 23:29:31,444 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:31,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:31,446 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:31,446 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:5 [2021-06-05 23:29:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:31,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850566362] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:31,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:29:31,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2021-06-05 23:29:31,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547136226] [2021-06-05 23:29:31,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 23:29:31,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:29:31,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 23:29:31,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2021-06-05 23:29:31,470 INFO L87 Difference]: Start difference. First operand 89503 states and 321383 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:29:35,090 INFO L93 Difference]: Finished difference Result 162162 states and 577677 transitions. [2021-06-05 23:29:35,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 23:29:35,091 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:29:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:29:35,558 INFO L225 Difference]: With dead ends: 162162 [2021-06-05 23:29:35,558 INFO L226 Difference]: Without dead ends: 162103 [2021-06-05 23:29:35,559 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 2319.9ms TimeCoverageRelationStatistics Valid=450, Invalid=2972, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 23:29:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162103 states. [2021-06-05 23:29:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162103 to 89497. [2021-06-05 23:29:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89497 states, 89496 states have (on average 3.5908308751229105) internal successors, (321365), 89496 states have internal predecessors, (321365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89497 states to 89497 states and 321365 transitions. [2021-06-05 23:29:38,006 INFO L78 Accepts]: Start accepts. Automaton has 89497 states and 321365 transitions. Word has length 37 [2021-06-05 23:29:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:29:38,006 INFO L482 AbstractCegarLoop]: Abstraction has 89497 states and 321365 transitions. [2021-06-05 23:29:38,006 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 89497 states and 321365 transitions. [2021-06-05 23:29:38,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:29:38,111 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:29:38,111 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:29:38,311 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 117 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable752 [2021-06-05 23:29:38,311 INFO L430 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:29:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:29:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1192455507, now seen corresponding path program 115 times [2021-06-05 23:29:38,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:29:38,312 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103815186] [2021-06-05 23:29:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:29:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:29:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:38,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:29:38,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103815186] [2021-06-05 23:29:38,690 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103815186] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:38,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449007127] [2021-06-05 23:29:38,690 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 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 23:29:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:29:38,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:29:38,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:29:38,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:29:38,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:38,780 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:38,781 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:38,781 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2021-06-05 23:29:38,870 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:29:38,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2021-06-05 23:29:38,871 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:38,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:38,886 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:38,886 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:55 [2021-06-05 23:29:38,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2021-06-05 23:29:38,965 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:38,980 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:38,981 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:38,981 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:74 [2021-06-05 23:29:39,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2021-06-05 23:29:39,035 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:39,043 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:39,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2021-06-05 23:29:39,045 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:39,050 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:39,051 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:39,051 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:22 [2021-06-05 23:29:39,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:29:39,078 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:39,079 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:39,080 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:39,080 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:29:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:39,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449007127] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:39,102 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:29:39,102 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:29:39,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13158569] [2021-06-05 23:29:39,102 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:29:39,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:29:39,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:29:39,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:29:39,103 INFO L87 Difference]: Start difference. First operand 89497 states and 321365 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:41,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:29:41,658 INFO L93 Difference]: Finished difference Result 136016 states and 485080 transitions. [2021-06-05 23:29:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 23:29:41,658 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:29:41,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:29:42,040 INFO L225 Difference]: With dead ends: 136016 [2021-06-05 23:29:42,040 INFO L226 Difference]: Without dead ends: 135821 [2021-06-05 23:29:42,040 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1365.0ms TimeCoverageRelationStatistics Valid=259, Invalid=1547, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 23:29:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135821 states. [2021-06-05 23:29:43,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135821 to 89479. [2021-06-05 23:29:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89479 states, 89478 states have (on average 3.590994434386106) internal successors, (321315), 89478 states have internal predecessors, (321315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89479 states to 89479 states and 321315 transitions. [2021-06-05 23:29:44,296 INFO L78 Accepts]: Start accepts. Automaton has 89479 states and 321315 transitions. Word has length 37 [2021-06-05 23:29:44,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:29:44,296 INFO L482 AbstractCegarLoop]: Abstraction has 89479 states and 321315 transitions. [2021-06-05 23:29:44,296 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:44,296 INFO L276 IsEmpty]: Start isEmpty. Operand 89479 states and 321315 transitions. [2021-06-05 23:29:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:29:44,392 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:29:44,392 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:29:44,593 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable753,118 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:29:44,593 INFO L430 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:29:44,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:29:44,593 INFO L82 PathProgramCache]: Analyzing trace with hash -437526489, now seen corresponding path program 116 times [2021-06-05 23:29:44,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:29:44,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705933299] [2021-06-05 23:29:44,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:29:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:29:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:44,864 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:29:44,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705933299] [2021-06-05 23:29:44,864 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705933299] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:44,864 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315852975] [2021-06-05 23:29:44,864 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 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 23:29:44,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:29:44,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:29:44,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 23:29:44,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:29:44,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:29:44,945 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:44,956 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:44,957 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:44,957 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:42 [2021-06-05 23:29:45,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:45,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2021-06-05 23:29:45,094 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:45,112 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:45,112 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:45,112 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:93, output treesize:91 [2021-06-05 23:29:45,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2021-06-05 23:29:45,258 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:45,267 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:45,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-06-05 23:29:45,270 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:45,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:45,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2021-06-05 23:29:45,279 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:45,286 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:45,286 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:45,286 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:30 [2021-06-05 23:29:45,340 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:45,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 41 [2021-06-05 23:29:45,343 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:29:45,350 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:45,352 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:45,352 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:21 [2021-06-05 23:29:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:45,396 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315852975] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:45,396 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:29:45,396 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2021-06-05 23:29:45,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808540074] [2021-06-05 23:29:45,396 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:29:45,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:29:45,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:29:45,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:29:45,396 INFO L87 Difference]: Start difference. First operand 89479 states and 321315 transitions. Second operand has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:29:47,132 INFO L93 Difference]: Finished difference Result 90528 states and 324336 transitions. [2021-06-05 23:29:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 23:29:47,132 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:29:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:29:47,355 INFO L225 Difference]: With dead ends: 90528 [2021-06-05 23:29:47,355 INFO L226 Difference]: Without dead ends: 90354 [2021-06-05 23:29:47,356 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 760.9ms TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2021-06-05 23:29:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90354 states. [2021-06-05 23:29:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90354 to 89533. [2021-06-05 23:29:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89533 states, 89532 states have (on average 3.590570969039003) internal successors, (321471), 89532 states have internal predecessors, (321471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89533 states to 89533 states and 321471 transitions. [2021-06-05 23:29:49,459 INFO L78 Accepts]: Start accepts. Automaton has 89533 states and 321471 transitions. Word has length 37 [2021-06-05 23:29:49,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:29:49,459 INFO L482 AbstractCegarLoop]: Abstraction has 89533 states and 321471 transitions. [2021-06-05 23:29:49,459 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 23 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 89533 states and 321471 transitions. [2021-06-05 23:29:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:29:49,567 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:29:49,567 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:29:49,767 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable754 [2021-06-05 23:29:49,767 INFO L430 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:29:49,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:29:49,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1282486503, now seen corresponding path program 117 times [2021-06-05 23:29:49,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:29:49,768 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867706513] [2021-06-05 23:29:49,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:29:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:29:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:50,020 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:29:50,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867706513] [2021-06-05 23:29:50,020 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867706513] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:50,020 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199159850] [2021-06-05 23:29:50,020 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 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 23:29:50,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-06-05 23:29:50,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:29:50,050 WARN L261 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 23:29:50,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:29:50,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:29:50,121 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:50,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:50,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:50,133 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:56 [2021-06-05 23:29:50,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:50,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2021-06-05 23:29:50,259 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:50,273 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:50,273 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:50,273 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:62 [2021-06-05 23:29:50,487 INFO L446 ElimStorePlain]: Different costs {0=[v_C_222], 3=[A, B]} [2021-06-05 23:29:50,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2021-06-05 23:29:50,491 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:50,513 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:50,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:50,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:50,524 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:50,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 49 [2021-06-05 23:29:50,525 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:50,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:50,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:50,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:50,547 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:50,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2021-06-05 23:29:50,550 INFO L550 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: and 2 xjuncts. [2021-06-05 23:29:50,561 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:50,563 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:50,563 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:82, output treesize:33 [2021-06-05 23:29:50,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:50,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:29:50,782 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:50,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 59 [2021-06-05 23:29:50,808 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2021-06-05 23:29:50,845 INFO L628 ElimStorePlain]: treesize reduction 80, result has 23.8 percent of original size [2021-06-05 23:29:50,847 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:50,847 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:37 [2021-06-05 23:29:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:50,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199159850] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:50,915 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:29:50,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 27 [2021-06-05 23:29:50,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921610613] [2021-06-05 23:29:50,916 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:29:50,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:29:50,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:29:50,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:29:50,916 INFO L87 Difference]: Start difference. First operand 89533 states and 321471 transitions. Second operand has 28 states, 28 states have (on average 2.5) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:29:53,488 INFO L93 Difference]: Finished difference Result 90017 states and 322761 transitions. [2021-06-05 23:29:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 23:29:53,488 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.5) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:29:53,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:29:53,707 INFO L225 Difference]: With dead ends: 90017 [2021-06-05 23:29:53,707 INFO L226 Difference]: Without dead ends: 89774 [2021-06-05 23:29:53,707 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1431.5ms TimeCoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 23:29:53,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89774 states. [2021-06-05 23:29:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89774 to 89533. [2021-06-05 23:29:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89533 states, 89532 states have (on average 3.590570969039003) internal successors, (321471), 89532 states have internal predecessors, (321471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89533 states to 89533 states and 321471 transitions. [2021-06-05 23:29:55,419 INFO L78 Accepts]: Start accepts. Automaton has 89533 states and 321471 transitions. Word has length 37 [2021-06-05 23:29:55,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:29:55,419 INFO L482 AbstractCegarLoop]: Abstraction has 89533 states and 321471 transitions. [2021-06-05 23:29:55,419 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.5) internal successors, (70), 27 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:55,419 INFO L276 IsEmpty]: Start isEmpty. Operand 89533 states and 321471 transitions. [2021-06-05 23:29:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:29:55,516 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:29:55,516 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:29:55,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable759,120 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:29:55,716 INFO L430 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:29:55,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:29:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1442450103, now seen corresponding path program 118 times [2021-06-05 23:29:55,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:29:55,717 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598590048] [2021-06-05 23:29:55,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:29:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:29:56,462 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:56,463 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:29:56,463 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598590048] [2021-06-05 23:29:56,463 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598590048] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:56,463 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187663735] [2021-06-05 23:29:56,463 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 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 23:29:56,490 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:29:56,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:29:56,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:29:56,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:29:56,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:29:56,553 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:56,564 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:56,565 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:56,565 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:42 [2021-06-05 23:29:56,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:29:56,691 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:56,706 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:56,707 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:56,707 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:55 [2021-06-05 23:29:56,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2021-06-05 23:29:56,754 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:56,769 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:56,770 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:56,770 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:67 [2021-06-05 23:29:56,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-06-05 23:29:56,871 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:56,878 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:56,879 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:56,879 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:43 [2021-06-05 23:29:56,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:29:56,921 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:56,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:56,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-06-05 23:29:56,927 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:29:56,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:29:56,928 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:29:56,928 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:29:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:29:56,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187663735] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:29:56,950 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:29:56,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:29:56,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913989780] [2021-06-05 23:29:56,950 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:29:56,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:29:56,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:29:56,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:29:56,951 INFO L87 Difference]: Start difference. First operand 89533 states and 321471 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:29:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:29:59,931 INFO L93 Difference]: Finished difference Result 136200 states and 485772 transitions. [2021-06-05 23:29:59,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 23:29:59,931 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:29:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:30:00,312 INFO L225 Difference]: With dead ends: 136200 [2021-06-05 23:30:00,312 INFO L226 Difference]: Without dead ends: 136133 [2021-06-05 23:30:00,312 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1918.8ms TimeCoverageRelationStatistics Valid=260, Invalid=1996, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 23:30:00,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136133 states. [2021-06-05 23:30:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136133 to 89611. [2021-06-05 23:30:02,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89611 states, 89610 states have (on average 3.589967637540453) internal successors, (321697), 89610 states have internal predecessors, (321697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89611 states to 89611 states and 321697 transitions. [2021-06-05 23:30:02,358 INFO L78 Accepts]: Start accepts. Automaton has 89611 states and 321697 transitions. Word has length 37 [2021-06-05 23:30:02,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:30:02,358 INFO L482 AbstractCegarLoop]: Abstraction has 89611 states and 321697 transitions. [2021-06-05 23:30:02,358 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 89611 states and 321697 transitions. [2021-06-05 23:30:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:30:02,899 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:30:02,899 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:30:03,108 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable775,121 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:30:03,109 INFO L430 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:30:03,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:30:03,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1733721901, now seen corresponding path program 119 times [2021-06-05 23:30:03,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:30:03,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676596597] [2021-06-05 23:30:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:30:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:30:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:03,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:30:03,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676596597] [2021-06-05 23:30:03,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676596597] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:03,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797273010] [2021-06-05 23:30:03,493 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 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 23:30:03,522 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 23:30:03,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:30:03,523 WARN L261 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 23:30:03,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:30:03,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:30:03,585 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:03,597 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:03,597 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:03,597 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2021-06-05 23:30:03,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:03,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:03,805 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-06-05 23:30:03,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 52 [2021-06-05 23:30:03,806 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:03,837 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:03,838 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:03,838 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:94, output treesize:93 [2021-06-05 23:30:03,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:03,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:03,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:03,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:03,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:04,000 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-06-05 23:30:04,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 66 [2021-06-05 23:30:04,001 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:04,021 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:04,021 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:04,022 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:99, output treesize:98 [2021-06-05 23:30:04,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2021-06-05 23:30:04,193 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:04,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:04,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-06-05 23:30:04,213 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:04,223 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:04,224 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:30:04,224 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:37 [2021-06-05 23:30:04,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:04,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:04,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:04,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:04,328 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:04,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 29 treesize of output 83 [2021-06-05 23:30:04,424 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2021-06-05 23:30:04,541 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 21 [2021-06-05 23:30:04,542 INFO L628 ElimStorePlain]: treesize reduction 597, result has 4.3 percent of original size [2021-06-05 23:30:04,543 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:04,544 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:21 [2021-06-05 23:30:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:04,616 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797273010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:04,616 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:30:04,616 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2021-06-05 23:30:04,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956088036] [2021-06-05 23:30:04,616 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:30:04,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:30:04,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:30:04,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:30:04,616 INFO L87 Difference]: Start difference. First operand 89611 states and 321697 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:30:08,356 INFO L93 Difference]: Finished difference Result 136569 states and 486663 transitions. [2021-06-05 23:30:08,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 23:30:08,356 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:30:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:30:08,776 INFO L225 Difference]: With dead ends: 136569 [2021-06-05 23:30:08,777 INFO L226 Difference]: Without dead ends: 136377 [2021-06-05 23:30:08,777 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2408.1ms TimeCoverageRelationStatistics Valid=356, Invalid=2506, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 23:30:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136377 states. [2021-06-05 23:30:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136377 to 89593. [2021-06-05 23:30:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89593 states, 89592 states have (on average 3.5900861684078937) internal successors, (321643), 89592 states have internal predecessors, (321643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89593 states to 89593 states and 321643 transitions. [2021-06-05 23:30:11,119 INFO L78 Accepts]: Start accepts. Automaton has 89593 states and 321643 transitions. Word has length 37 [2021-06-05 23:30:11,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:30:11,119 INFO L482 AbstractCegarLoop]: Abstraction has 89593 states and 321643 transitions. [2021-06-05 23:30:11,119 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 89593 states and 321643 transitions. [2021-06-05 23:30:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:30:11,221 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:30:11,222 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:30:11,424 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable776 [2021-06-05 23:30:11,425 INFO L430 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:30:11,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:30:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash -215989977, now seen corresponding path program 120 times [2021-06-05 23:30:11,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:30:11,425 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840226006] [2021-06-05 23:30:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:30:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:30:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:11,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:30:11,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840226006] [2021-06-05 23:30:11,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840226006] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:11,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989338199] [2021-06-05 23:30:11,794 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 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 23:30:11,824 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 23:30:11,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:30:11,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 49 conjunts are in the unsatisfiable core [2021-06-05 23:30:11,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:30:11,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:30:11,883 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:11,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:11,896 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:11,896 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:40 [2021-06-05 23:30:12,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:30:12,007 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:12,024 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:12,025 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:12,025 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:53 [2021-06-05 23:30:12,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:12,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:12,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2021-06-05 23:30:12,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:12,139 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:12,140 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 1 xjuncts. [2021-06-05 23:30:12,140 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:67 [2021-06-05 23:30:12,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:12,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:12,239 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:12,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 56 [2021-06-05 23:30:12,240 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:12,267 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:12,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:12,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:12,285 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:12,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 88 [2021-06-05 23:30:12,297 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:30:12,368 INFO L628 ElimStorePlain]: treesize reduction 82, result has 59.0 percent of original size [2021-06-05 23:30:12,395 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:30:12,395 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:93 [2021-06-05 23:30:12,882 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-06-05 23:30:12,933 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_8, v_prenex_9, v_prenex_10, v_prenex_11], 3=[C]} [2021-06-05 23:30:12,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:30:12,938 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:12,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:12,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:30:12,986 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:13,025 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:13,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2021-06-05 23:30:13,030 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:13,091 INFO L628 ElimStorePlain]: treesize reduction 10, result has 90.7 percent of original size [2021-06-05 23:30:13,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2021-06-05 23:30:13,095 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:13,132 INFO L628 ElimStorePlain]: treesize reduction 20, result has 72.6 percent of original size [2021-06-05 23:30:13,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:13,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:13,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:30:13,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2021-06-05 23:30:13,137 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:13,151 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:13,151 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 23:30:13,152 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:158, output treesize:31 [2021-06-05 23:30:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:13,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989338199] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:13,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:30:13,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-06-05 23:30:13,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520803722] [2021-06-05 23:30:13,259 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 23:30:13,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:30:13,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 23:30:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2021-06-05 23:30:13,260 INFO L87 Difference]: Start difference. First operand 89593 states and 321643 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:17,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:30:17,239 INFO L93 Difference]: Finished difference Result 136579 states and 486831 transitions. [2021-06-05 23:30:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 23:30:17,239 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:30:17,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:30:17,633 INFO L225 Difference]: With dead ends: 136579 [2021-06-05 23:30:17,633 INFO L226 Difference]: Without dead ends: 136446 [2021-06-05 23:30:17,633 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2558.5ms TimeCoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 23:30:17,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136446 states. [2021-06-05 23:30:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136446 to 89575. [2021-06-05 23:30:19,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89575 states, 89574 states have (on average 3.59024940272847) internal successors, (321593), 89574 states have internal predecessors, (321593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89575 states to 89575 states and 321593 transitions. [2021-06-05 23:30:20,127 INFO L78 Accepts]: Start accepts. Automaton has 89575 states and 321593 transitions. Word has length 37 [2021-06-05 23:30:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:30:20,127 INFO L482 AbstractCegarLoop]: Abstraction has 89575 states and 321593 transitions. [2021-06-05 23:30:20,127 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 89575 states and 321593 transitions. [2021-06-05 23:30:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:30:20,233 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:30:20,233 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:30:20,436 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable820,123 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:30:20,437 INFO L430 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:30:20,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:30:20,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1158927161, now seen corresponding path program 121 times [2021-06-05 23:30:20,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:30:20,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613886313] [2021-06-05 23:30:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:30:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:30:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:20,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:30:20,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613886313] [2021-06-05 23:30:20,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613886313] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:20,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082309193] [2021-06-05 23:30:20,855 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 23:30:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:30:20,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:30:20,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:30:20,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:30:20,923 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:20,934 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:20,934 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:20,934 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:36 [2021-06-05 23:30:21,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:21,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-06-05 23:30:21,023 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:21,037 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:21,037 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:21,037 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:57 [2021-06-05 23:30:21,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2021-06-05 23:30:21,213 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:21,220 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:21,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-06-05 23:30:21,223 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:21,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:21,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2021-06-05 23:30:21,230 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:21,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:21,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:21,236 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:71, output treesize:22 [2021-06-05 23:30:21,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:30:21,271 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:21,272 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:21,273 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:21,273 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:30:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:21,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082309193] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:21,293 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:30:21,293 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2021-06-05 23:30:21,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490817682] [2021-06-05 23:30:21,293 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:30:21,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:30:21,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:30:21,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:30:21,294 INFO L87 Difference]: Start difference. First operand 89575 states and 321593 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:30:23,944 INFO L93 Difference]: Finished difference Result 123300 states and 436703 transitions. [2021-06-05 23:30:23,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 23:30:23,944 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:30:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:30:24,284 INFO L225 Difference]: With dead ends: 123300 [2021-06-05 23:30:24,284 INFO L226 Difference]: Without dead ends: 123171 [2021-06-05 23:30:24,285 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1475.4ms TimeCoverageRelationStatistics Valid=219, Invalid=1503, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 23:30:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123171 states. [2021-06-05 23:30:25,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123171 to 89687. [2021-06-05 23:30:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89687 states, 89686 states have (on average 3.5898021987824187) internal successors, (321955), 89686 states have internal predecessors, (321955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89687 states to 89687 states and 321955 transitions. [2021-06-05 23:30:26,857 INFO L78 Accepts]: Start accepts. Automaton has 89687 states and 321955 transitions. Word has length 37 [2021-06-05 23:30:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:30:26,858 INFO L482 AbstractCegarLoop]: Abstraction has 89687 states and 321955 transitions. [2021-06-05 23:30:26,858 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 89687 states and 321955 transitions. [2021-06-05 23:30:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:30:26,960 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:30:26,960 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:30:27,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable840 [2021-06-05 23:30:27,160 INFO L430 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:30:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:30:27,160 INFO L82 PathProgramCache]: Analyzing trace with hash -985936443, now seen corresponding path program 122 times [2021-06-05 23:30:27,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:30:27,161 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776200232] [2021-06-05 23:30:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:30:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:30:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:27,593 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:30:27,593 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776200232] [2021-06-05 23:30:27,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776200232] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:27,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990380496] [2021-06-05 23:30:27,594 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 23:30:27,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:30:27,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:30:27,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:30:27,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:30:27,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:30:27,668 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:27,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:27,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:27,685 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:36 [2021-06-05 23:30:27,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:27,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-06-05 23:30:27,749 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:27,765 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:27,766 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:27,766 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:53 [2021-06-05 23:30:27,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2021-06-05 23:30:27,892 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:27,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:27,909 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:27,910 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:74 [2021-06-05 23:30:27,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2021-06-05 23:30:27,963 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:27,971 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:27,971 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:27,972 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:43 [2021-06-05 23:30:28,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:30:28,012 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:28,016 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:28,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-06-05 23:30:28,018 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:28,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:28,019 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:28,019 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:30:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:28,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990380496] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:28,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:30:28,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2021-06-05 23:30:28,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865355388] [2021-06-05 23:30:28,043 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:30:28,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:30:28,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:30:28,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:30:28,043 INFO L87 Difference]: Start difference. First operand 89687 states and 321955 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:30:31,324 INFO L93 Difference]: Finished difference Result 117694 states and 416889 transitions. [2021-06-05 23:30:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 23:30:31,324 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:30:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:30:31,635 INFO L225 Difference]: With dead ends: 117694 [2021-06-05 23:30:31,635 INFO L226 Difference]: Without dead ends: 117568 [2021-06-05 23:30:31,636 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 1975.5ms TimeCoverageRelationStatistics Valid=404, Invalid=2352, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 23:30:31,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117568 states. [2021-06-05 23:30:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117568 to 89901. [2021-06-05 23:30:33,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89901 states, 89900 states have (on average 3.589154616240267) internal successors, (322665), 89900 states have internal predecessors, (322665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89901 states to 89901 states and 322665 transitions. [2021-06-05 23:30:33,892 INFO L78 Accepts]: Start accepts. Automaton has 89901 states and 322665 transitions. Word has length 37 [2021-06-05 23:30:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:30:33,892 INFO L482 AbstractCegarLoop]: Abstraction has 89901 states and 322665 transitions. [2021-06-05 23:30:33,892 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 89901 states and 322665 transitions. [2021-06-05 23:30:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:30:33,989 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:30:33,989 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:30:34,189 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable841,125 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:30:34,190 INFO L430 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:30:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:30:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash -2104731735, now seen corresponding path program 123 times [2021-06-05 23:30:34,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:30:34,190 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043091545] [2021-06-05 23:30:34,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:30:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:30:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:34,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:30:34,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043091545] [2021-06-05 23:30:34,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043091545] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:34,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071782782] [2021-06-05 23:30:34,583 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 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 23:30:34,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-06-05 23:30:34,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:30:34,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 23:30:34,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:30:34,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:30:34,660 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:34,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:34,670 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:34,670 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:35 [2021-06-05 23:30:34,738 INFO L354 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2021-06-05 23:30:34,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2021-06-05 23:30:34,739 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:34,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:34,751 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:34,752 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2021-06-05 23:30:34,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:34,994 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-06-05 23:30:34,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 60 [2021-06-05 23:30:34,996 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:35,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:35,029 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 1 xjuncts. [2021-06-05 23:30:35,029 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:93, output treesize:99 [2021-06-05 23:30:35,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,309 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:35,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 76 [2021-06-05 23:30:35,312 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:35,334 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:35,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,358 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:35,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2021-06-05 23:30:35,364 INFO L550 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: and 2 xjuncts. [2021-06-05 23:30:35,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:35,383 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:30:35,383 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:48 [2021-06-05 23:30:35,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:30:35,474 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:35,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,479 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:30:35,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:35,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:30:35,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2021-06-05 23:30:35,481 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:35,495 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:35,496 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 23:30:35,497 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:26 [2021-06-05 23:30:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:35,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071782782] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:35,596 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:30:35,596 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2021-06-05 23:30:35,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455647677] [2021-06-05 23:30:35,596 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:30:35,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:30:35,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:30:35,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=662, Unknown=4, NotChecked=0, Total=756 [2021-06-05 23:30:35,596 INFO L87 Difference]: Start difference. First operand 89901 states and 322665 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:44,407 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2021-06-05 23:30:47,106 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2021-06-05 23:30:47,351 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-06-05 23:30:48,453 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2021-06-05 23:30:48,642 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 87 [2021-06-05 23:30:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:30:49,397 INFO L93 Difference]: Finished difference Result 145734 states and 512593 transitions. [2021-06-05 23:30:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-06-05 23:30:49,397 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:30:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:30:49,788 INFO L225 Difference]: With dead ends: 145734 [2021-06-05 23:30:49,788 INFO L226 Difference]: Without dead ends: 145571 [2021-06-05 23:30:49,788 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 5188.2ms TimeCoverageRelationStatistics Valid=838, Invalid=5961, Unknown=7, NotChecked=0, Total=6806 [2021-06-05 23:30:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145571 states. [2021-06-05 23:30:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145571 to 90654. [2021-06-05 23:30:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90654 states, 90653 states have (on average 3.5878900863733136) internal successors, (325253), 90653 states have internal predecessors, (325253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90654 states to 90654 states and 325253 transitions. [2021-06-05 23:30:52,143 INFO L78 Accepts]: Start accepts. Automaton has 90654 states and 325253 transitions. Word has length 37 [2021-06-05 23:30:52,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:30:52,143 INFO L482 AbstractCegarLoop]: Abstraction has 90654 states and 325253 transitions. [2021-06-05 23:30:52,143 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 90654 states and 325253 transitions. [2021-06-05 23:30:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:30:52,230 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:30:52,230 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:30:52,430 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable842 [2021-06-05 23:30:52,430 INFO L430 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:30:52,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:30:52,430 INFO L82 PathProgramCache]: Analyzing trace with hash 811696453, now seen corresponding path program 124 times [2021-06-05 23:30:52,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:30:52,431 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284208683] [2021-06-05 23:30:52,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:30:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:30:52,769 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:52,769 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:30:52,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284208683] [2021-06-05 23:30:52,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284208683] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:52,769 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784960053] [2021-06-05 23:30:52,769 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:30:52,798 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:30:52,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:30:52,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:30:52,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:30:52,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:30:52,841 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:52,852 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:52,852 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:52,853 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2021-06-05 23:30:52,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:30:52,917 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:52,931 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:52,932 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:52,932 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:55 [2021-06-05 23:30:53,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2021-06-05 23:30:53,013 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:53,029 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:53,029 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:53,029 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:70 [2021-06-05 23:30:53,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-06-05 23:30:53,081 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:53,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:53,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:53,089 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:39 [2021-06-05 23:30:53,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:30:53,163 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:53,168 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:53,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-06-05 23:30:53,169 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:53,171 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:53,171 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:53,171 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:5 [2021-06-05 23:30:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:53,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784960053] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:53,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:30:53,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2021-06-05 23:30:53,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377707819] [2021-06-05 23:30:53,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:30:53,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:30:53,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:30:53,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:30:53,193 INFO L87 Difference]: Start difference. First operand 90654 states and 325253 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:53,886 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-05 23:30:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:30:56,570 INFO L93 Difference]: Finished difference Result 121288 states and 428456 transitions. [2021-06-05 23:30:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-06-05 23:30:56,570 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:30:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:30:57,171 INFO L225 Difference]: With dead ends: 121288 [2021-06-05 23:30:57,172 INFO L226 Difference]: Without dead ends: 121236 [2021-06-05 23:30:57,172 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 1951.6ms TimeCoverageRelationStatistics Valid=385, Invalid=2585, Unknown=0, NotChecked=0, Total=2970 [2021-06-05 23:30:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121236 states. [2021-06-05 23:30:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121236 to 90879. [2021-06-05 23:30:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90879 states, 90878 states have (on average 3.5877109971610293) internal successors, (326044), 90878 states have internal predecessors, (326044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90879 states to 90879 states and 326044 transitions. [2021-06-05 23:30:59,041 INFO L78 Accepts]: Start accepts. Automaton has 90879 states and 326044 transitions. Word has length 37 [2021-06-05 23:30:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:30:59,041 INFO L482 AbstractCegarLoop]: Abstraction has 90879 states and 326044 transitions. [2021-06-05 23:30:59,041 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 22 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:30:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 90879 states and 326044 transitions. [2021-06-05 23:30:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:30:59,135 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:30:59,136 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:30:59,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable857,127 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:30:59,336 INFO L430 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:30:59,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:30:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash -608755159, now seen corresponding path program 125 times [2021-06-05 23:30:59,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:30:59,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497734435] [2021-06-05 23:30:59,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:30:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:30:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:30:59,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:30:59,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497734435] [2021-06-05 23:30:59,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497734435] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:30:59,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49105595] [2021-06-05 23:30:59,685 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 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 23:30:59,719 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-06-05 23:30:59,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:30:59,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 23:30:59,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:30:59,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:30:59,781 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:59,789 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:59,790 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:59,790 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:37 [2021-06-05 23:30:59,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:30:59,867 INFO L354 Elim1Store]: treesize reduction 39, result has 27.8 percent of original size [2021-06-05 23:30:59,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 56 [2021-06-05 23:30:59,869 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:30:59,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:30:59,886 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:30:59,886 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:65 [2021-06-05 23:31:00,220 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-06-05 23:31:00,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:00,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:00,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:00,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:00,470 INFO L354 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2021-06-05 23:31:00,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 57 [2021-06-05 23:31:00,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:00,492 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:00,493 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 1 xjuncts. [2021-06-05 23:31:00,493 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:69 [2021-06-05 23:31:00,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:00,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:00,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:00,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:00,685 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:00,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 102 [2021-06-05 23:31:00,738 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:31:00,968 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 65 [2021-06-05 23:31:00,969 INFO L628 ElimStorePlain]: treesize reduction 490, result has 25.2 percent of original size [2021-06-05 23:31:01,002 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:01,002 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:85, output treesize:213 [2021-06-05 23:31:01,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:31:01,106 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:01,111 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:01,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-06-05 23:31:01,113 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:01,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:01,114 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:01,114 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:31:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:01,138 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49105595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:01,138 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:31:01,138 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-06-05 23:31:01,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608296823] [2021-06-05 23:31:01,138 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 23:31:01,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:31:01,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 23:31:01,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2021-06-05 23:31:01,139 INFO L87 Difference]: Start difference. First operand 90879 states and 326044 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:31:05,923 INFO L93 Difference]: Finished difference Result 119339 states and 422400 transitions. [2021-06-05 23:31:05,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 23:31:05,924 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:31:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:31:06,250 INFO L225 Difference]: With dead ends: 119339 [2021-06-05 23:31:06,250 INFO L226 Difference]: Without dead ends: 119254 [2021-06-05 23:31:06,250 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 2783.2ms TimeCoverageRelationStatistics Valid=459, Invalid=3573, Unknown=0, NotChecked=0, Total=4032 [2021-06-05 23:31:06,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119254 states. [2021-06-05 23:31:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119254 to 90906. [2021-06-05 23:31:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90906 states, 90905 states have (on average 3.5876684450800287) internal successors, (326137), 90905 states have internal predecessors, (326137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90906 states to 90906 states and 326137 transitions. [2021-06-05 23:31:08,380 INFO L78 Accepts]: Start accepts. Automaton has 90906 states and 326137 transitions. Word has length 37 [2021-06-05 23:31:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:31:08,380 INFO L482 AbstractCegarLoop]: Abstraction has 90906 states and 326137 transitions. [2021-06-05 23:31:08,381 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 90906 states and 326137 transitions. [2021-06-05 23:31:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:31:08,479 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:31:08,479 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:31:08,679 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 128 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable858 [2021-06-05 23:31:08,680 INFO L430 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:31:08,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:31:08,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1628573203, now seen corresponding path program 126 times [2021-06-05 23:31:08,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:31:08,680 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124371394] [2021-06-05 23:31:08,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:31:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:31:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:09,061 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:31:09,061 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124371394] [2021-06-05 23:31:09,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124371394] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:09,061 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855692298] [2021-06-05 23:31:09,061 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 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 23:31:09,095 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-06-05 23:31:09,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:31:09,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 50 conjunts are in the unsatisfiable core [2021-06-05 23:31:09,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:31:09,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:31:09,138 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,148 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:09,149 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,149 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:40 [2021-06-05 23:31:09,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:31:09,212 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,226 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:09,226 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,226 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:55 [2021-06-05 23:31:09,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:09,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:31:09,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2021-06-05 23:31:09,348 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,366 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:09,366 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,366 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:75 [2021-06-05 23:31:09,535 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:09,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 72 [2021-06-05 23:31:09,537 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:09,581 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:09,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 82 [2021-06-05 23:31:09,598 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:31:09,665 INFO L628 ElimStorePlain]: treesize reduction 81, result has 52.4 percent of original size [2021-06-05 23:31:09,681 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 23:31:09,681 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:226 [2021-06-05 23:31:09,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:31:09,779 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2021-06-05 23:31:09,784 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,787 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 23:31:09,787 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,792 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:31:09,793 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2021-06-05 23:31:09,802 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:09,836 INFO L628 ElimStorePlain]: treesize reduction 13, result has 75.5 percent of original size [2021-06-05 23:31:09,837 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 23:31:09,837 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:158, output treesize:40 [2021-06-05 23:31:10,185 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2021-06-05 23:31:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:10,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855692298] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:10,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:31:10,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2021-06-05 23:31:10,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925458227] [2021-06-05 23:31:10,227 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 23:31:10,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:31:10,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 23:31:10,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2021-06-05 23:31:10,227 INFO L87 Difference]: Start difference. First operand 90906 states and 326137 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:31:15,370 INFO L93 Difference]: Finished difference Result 146974 states and 516725 transitions. [2021-06-05 23:31:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-06-05 23:31:15,370 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:31:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:31:15,754 INFO L225 Difference]: With dead ends: 146974 [2021-06-05 23:31:15,755 INFO L226 Difference]: Without dead ends: 146869 [2021-06-05 23:31:15,755 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 3373.8ms TimeCoverageRelationStatistics Valid=717, Invalid=5135, Unknown=0, NotChecked=0, Total=5852 [2021-06-05 23:31:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146869 states. [2021-06-05 23:31:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146869 to 90922. [2021-06-05 23:31:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90922 states, 90921 states have (on average 3.587850991520111) internal successors, (326211), 90921 states have internal predecessors, (326211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90922 states to 90922 states and 326211 transitions. [2021-06-05 23:31:18,074 INFO L78 Accepts]: Start accepts. Automaton has 90922 states and 326211 transitions. Word has length 37 [2021-06-05 23:31:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:31:18,074 INFO L482 AbstractCegarLoop]: Abstraction has 90922 states and 326211 transitions. [2021-06-05 23:31:18,074 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:18,074 INFO L276 IsEmpty]: Start isEmpty. Operand 90922 states and 326211 transitions. [2021-06-05 23:31:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:31:18,170 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:31:18,170 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:31:18,370 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable885 [2021-06-05 23:31:18,370 INFO L430 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:31:18,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:31:18,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1966119509, now seen corresponding path program 127 times [2021-06-05 23:31:18,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:31:18,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637156349] [2021-06-05 23:31:18,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:31:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:31:18,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:18,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:31:18,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637156349] [2021-06-05 23:31:18,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637156349] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:18,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887378002] [2021-06-05 23:31:18,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 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 23:31:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:31:18,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:31:18,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:31:18,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:31:18,777 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:18,787 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:18,787 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:18,787 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:42 [2021-06-05 23:31:18,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:18,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-06-05 23:31:18,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:18,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:18,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:18,866 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:53 [2021-06-05 23:31:18,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2021-06-05 23:31:18,946 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:18,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:18,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:18,963 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:66 [2021-06-05 23:31:19,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2021-06-05 23:31:19,060 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:19,067 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:19,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2021-06-05 23:31:19,070 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:19,075 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:19,075 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:19,075 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:22 [2021-06-05 23:31:19,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2021-06-05 23:31:19,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:19,108 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:19,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:19,109 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:5 [2021-06-05 23:31:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:19,134 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887378002] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:19,134 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:31:19,134 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2021-06-05 23:31:19,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53637014] [2021-06-05 23:31:19,134 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:31:19,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:31:19,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:31:19,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:31:19,134 INFO L87 Difference]: Start difference. First operand 90922 states and 326211 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:22,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:31:22,065 INFO L93 Difference]: Finished difference Result 126590 states and 447430 transitions. [2021-06-05 23:31:22,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 23:31:22,065 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:31:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:31:22,401 INFO L225 Difference]: With dead ends: 126590 [2021-06-05 23:31:22,401 INFO L226 Difference]: Without dead ends: 126411 [2021-06-05 23:31:22,401 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1720.6ms TimeCoverageRelationStatistics Valid=281, Invalid=2071, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 23:31:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126411 states. [2021-06-05 23:31:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126411 to 91315. [2021-06-05 23:31:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91315 states, 91314 states have (on average 3.586394200232166) internal successors, (327488), 91314 states have internal predecessors, (327488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91315 states to 91315 states and 327488 transitions. [2021-06-05 23:31:24,535 INFO L78 Accepts]: Start accepts. Automaton has 91315 states and 327488 transitions. Word has length 37 [2021-06-05 23:31:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:31:24,535 INFO L482 AbstractCegarLoop]: Abstraction has 91315 states and 327488 transitions. [2021-06-05 23:31:24,535 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 91315 states and 327488 transitions. [2021-06-05 23:31:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:31:24,634 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:31:24,634 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:31:24,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable900,130 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:31:24,835 INFO L430 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:31:24,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:31:24,835 INFO L82 PathProgramCache]: Analyzing trace with hash 937086363, now seen corresponding path program 128 times [2021-06-05 23:31:24,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:31:24,835 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9085435] [2021-06-05 23:31:24,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:31:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:31:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:25,268 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:31:25,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9085435] [2021-06-05 23:31:25,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9085435] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:25,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796401672] [2021-06-05 23:31:25,268 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 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 23:31:25,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:31:25,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:31:25,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:31:25,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:31:25,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:31:25,337 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:25,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:25,349 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:25,349 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:46 [2021-06-05 23:31:25,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:31:25,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:25,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2021-06-05 23:31:25,411 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:25,425 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:25,426 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:25,426 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:71 [2021-06-05 23:31:25,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:25,553 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:31:25,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2021-06-05 23:31:25,554 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:25,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:25,572 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:25,572 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:84 [2021-06-05 23:31:25,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2021-06-05 23:31:25,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:25,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:25,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2021-06-05 23:31:25,640 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:25,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:25,646 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:25,646 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:24 [2021-06-05 23:31:25,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2021-06-05 23:31:25,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:25,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:25,678 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:25,678 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:5 [2021-06-05 23:31:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:25,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796401672] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:25,700 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:31:25,700 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2021-06-05 23:31:25,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034020918] [2021-06-05 23:31:25,700 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 23:31:25,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:31:25,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 23:31:25,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:31:25,701 INFO L87 Difference]: Start difference. First operand 91315 states and 327488 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:31:29,488 INFO L93 Difference]: Finished difference Result 128914 states and 454619 transitions. [2021-06-05 23:31:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 23:31:29,489 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:31:29,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:31:29,836 INFO L225 Difference]: With dead ends: 128914 [2021-06-05 23:31:29,836 INFO L226 Difference]: Without dead ends: 128775 [2021-06-05 23:31:29,837 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 2165.5ms TimeCoverageRelationStatistics Valid=362, Invalid=2290, Unknown=0, NotChecked=0, Total=2652 [2021-06-05 23:31:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128775 states. [2021-06-05 23:31:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128775 to 91698. [2021-06-05 23:31:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91698 states, 91697 states have (on average 3.5854717166319507) internal successors, (328777), 91697 states have internal predecessors, (328777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91698 states to 91698 states and 328777 transitions. [2021-06-05 23:31:31,717 INFO L78 Accepts]: Start accepts. Automaton has 91698 states and 328777 transitions. Word has length 37 [2021-06-05 23:31:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:31:31,717 INFO L482 AbstractCegarLoop]: Abstraction has 91698 states and 328777 transitions. [2021-06-05 23:31:31,717 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 91698 states and 328777 transitions. [2021-06-05 23:31:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:31:31,817 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:31:31,818 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:31:32,032 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable901,131 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:31:32,033 INFO L430 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:31:32,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:31:32,033 INFO L82 PathProgramCache]: Analyzing trace with hash -253832541, now seen corresponding path program 129 times [2021-06-05 23:31:32,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:31:32,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170897364] [2021-06-05 23:31:32,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:31:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:31:32,531 WARN L205 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2021-06-05 23:31:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:32,724 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:31:32,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170897364] [2021-06-05 23:31:32,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170897364] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:32,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297039900] [2021-06-05 23:31:32,724 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 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 23:31:32,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-06-05 23:31:32,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:31:32,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 51 conjunts are in the unsatisfiable core [2021-06-05 23:31:32,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:31:32,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:31:32,792 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:32,800 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:32,801 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:32,801 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:35 [2021-06-05 23:31:32,860 INFO L354 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2021-06-05 23:31:32,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2021-06-05 23:31:32,861 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:32,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:32,871 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:32,872 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:49 [2021-06-05 23:31:33,156 INFO L446 ElimStorePlain]: Different costs {6=[v_C_258], 7=[A, B]} [2021-06-05 23:31:33,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:33,198 INFO L354 Elim1Store]: treesize reduction 62, result has 31.9 percent of original size [2021-06-05 23:31:33,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 74 [2021-06-05 23:31:33,200 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:33,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:33,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:33,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:33,276 INFO L354 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2021-06-05 23:31:33,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 98 [2021-06-05 23:31:33,279 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:33,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:33,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:33,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:33,331 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:33,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 74 [2021-06-05 23:31:33,337 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2021-06-05 23:31:33,356 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:33,362 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:31:33,362 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:90, output treesize:65 [2021-06-05 23:31:33,884 INFO L446 ElimStorePlain]: Different costs {3=[v_prenex_13], 10=[C]} [2021-06-05 23:31:33,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:33,898 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:33,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 25 [2021-06-05 23:31:33,900 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:33,921 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:33,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:33,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:33,925 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:31:33,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:33,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:33,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:33,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:31:33,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-06-05 23:31:33,929 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:33,945 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:33,946 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 23:31:33,946 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:28 [2021-06-05 23:31:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:34,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297039900] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:34,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:31:34,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 25 [2021-06-05 23:31:34,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584745172] [2021-06-05 23:31:34,004 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 23:31:34,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:31:34,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 23:31:34,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2021-06-05 23:31:34,004 INFO L87 Difference]: Start difference. First operand 91698 states and 328777 transitions. Second operand has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:36,185 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2021-06-05 23:31:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:31:37,461 INFO L93 Difference]: Finished difference Result 92665 states and 331519 transitions. [2021-06-05 23:31:37,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 23:31:37,461 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:31:37,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:31:37,699 INFO L225 Difference]: With dead ends: 92665 [2021-06-05 23:31:37,699 INFO L226 Difference]: Without dead ends: 92428 [2021-06-05 23:31:37,699 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2642.3ms TimeCoverageRelationStatistics Valid=219, Invalid=2037, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 23:31:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92428 states. [2021-06-05 23:31:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92428 to 91718. [2021-06-05 23:31:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91718 states, 91717 states have (on average 3.585344047450309) internal successors, (328837), 91717 states have internal predecessors, (328837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91718 states to 91718 states and 328837 transitions. [2021-06-05 23:31:39,373 INFO L78 Accepts]: Start accepts. Automaton has 91718 states and 328837 transitions. Word has length 37 [2021-06-05 23:31:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:31:39,374 INFO L482 AbstractCegarLoop]: Abstraction has 91718 states and 328837 transitions. [2021-06-05 23:31:39,374 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:39,374 INFO L276 IsEmpty]: Start isEmpty. Operand 91718 states and 328837 transitions. [2021-06-05 23:31:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:31:39,473 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:31:39,473 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:31:39,676 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable902,132 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:31:39,677 INFO L430 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:31:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:31:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1896271151, now seen corresponding path program 130 times [2021-06-05 23:31:39,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:31:39,677 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665073686] [2021-06-05 23:31:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:31:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:31:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:40,412 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:31:40,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665073686] [2021-06-05 23:31:40,412 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665073686] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:40,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993948748] [2021-06-05 23:31:40,412 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 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 23:31:40,439 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:31:40,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:31:40,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:31:40,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:31:40,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:31:40,497 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:40,507 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:40,508 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:40,508 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:42 [2021-06-05 23:31:40,595 INFO L354 Elim1Store]: treesize reduction 72, result has 15.3 percent of original size [2021-06-05 23:31:40,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 104 [2021-06-05 23:31:40,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:40,613 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:40,613 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:40,613 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:136, output treesize:81 [2021-06-05 23:31:40,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:40,747 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:31:40,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:40,748 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:31:40,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:40,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2021-06-05 23:31:40,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:40,768 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:40,768 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:40,768 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:80 [2021-06-05 23:31:40,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-06-05 23:31:40,827 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:40,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:40,835 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:40,835 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:47 [2021-06-05 23:31:40,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:31:40,878 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:40,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:40,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-06-05 23:31:40,884 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:40,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:40,886 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:40,886 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:31:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:40,906 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993948748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:40,906 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:31:40,906 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:31:40,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850637487] [2021-06-05 23:31:40,906 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:31:40,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:31:40,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:31:40,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:31:40,907 INFO L87 Difference]: Start difference. First operand 91718 states and 328837 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:31:45,085 INFO L93 Difference]: Finished difference Result 146059 states and 517513 transitions. [2021-06-05 23:31:45,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-05 23:31:45,086 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:31:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:31:45,475 INFO L225 Difference]: With dead ends: 146059 [2021-06-05 23:31:45,475 INFO L226 Difference]: Without dead ends: 145998 [2021-06-05 23:31:45,475 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2678.1ms TimeCoverageRelationStatistics Valid=705, Invalid=3987, Unknown=0, NotChecked=0, Total=4692 [2021-06-05 23:31:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145998 states. [2021-06-05 23:31:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145998 to 91749. [2021-06-05 23:31:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91749 states, 91748 states have (on average 3.5853533592012905) internal successors, (328949), 91748 states have internal predecessors, (328949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91749 states to 91749 states and 328949 transitions. [2021-06-05 23:31:47,753 INFO L78 Accepts]: Start accepts. Automaton has 91749 states and 328949 transitions. Word has length 37 [2021-06-05 23:31:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:31:47,753 INFO L482 AbstractCegarLoop]: Abstraction has 91749 states and 328949 transitions. [2021-06-05 23:31:47,753 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:31:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 91749 states and 328949 transitions. [2021-06-05 23:31:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:31:47,852 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:31:47,852 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:31:48,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable928 [2021-06-05 23:31:48,053 INFO L430 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:31:48,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:31:48,053 INFO L82 PathProgramCache]: Analyzing trace with hash 777475859, now seen corresponding path program 131 times [2021-06-05 23:31:48,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:31:48,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447436038] [2021-06-05 23:31:48,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:31:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:31:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:48,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:31:48,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447436038] [2021-06-05 23:31:48,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447436038] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:48,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336969638] [2021-06-05 23:31:48,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 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 23:31:48,460 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-05 23:31:48,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:31:48,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:31:48,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:31:48,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:31:48,518 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:48,530 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:48,531 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:31:48,531 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2021-06-05 23:31:48,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:48,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:48,655 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-06-05 23:31:48,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2021-06-05 23:31:48,656 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:48,674 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:48,676 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 1 xjuncts. [2021-06-05 23:31:48,676 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:76 [2021-06-05 23:31:48,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:48,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:48,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:48,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:48,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:48,927 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-06-05 23:31:48,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 55 [2021-06-05 23:31:48,928 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:31:48,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:48,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 23:31:48,959 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:84, output treesize:83 [2021-06-05 23:31:49,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:49,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:49,089 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:49,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2021-06-05 23:31:49,091 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:31:49,108 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:49,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:49,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:49,390 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-06-05 23:31:49,390 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:49,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2021-06-05 23:31:49,392 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:31:49,429 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:49,438 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 23:31:49,439 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:86, output treesize:48 [2021-06-05 23:31:49,561 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:49,561 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 12 treesize of output 31 [2021-06-05 23:31:49,566 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2021-06-05 23:31:49,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:49,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:49,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:49,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:49,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:31:49,615 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:31:49,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 87 [2021-06-05 23:31:49,805 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 3 xjuncts. [2021-06-05 23:31:50,089 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 51 [2021-06-05 23:31:50,089 INFO L628 ElimStorePlain]: treesize reduction 947, result has 9.5 percent of original size [2021-06-05 23:31:50,111 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2021-06-05 23:31:50,111 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:86, output treesize:45 [2021-06-05 23:31:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:31:50,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336969638] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:31:50,189 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:31:50,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-06-05 23:31:50,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527613250] [2021-06-05 23:31:50,189 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 23:31:50,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:31:50,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 23:31:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2021-06-05 23:31:50,189 INFO L87 Difference]: Start difference. First operand 91749 states and 328949 transitions. Second operand has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:01,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:32:01,123 INFO L93 Difference]: Finished difference Result 149619 states and 528913 transitions. [2021-06-05 23:32:01,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-06-05 23:32:01,123 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:32:01,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:32:01,541 INFO L225 Difference]: With dead ends: 149619 [2021-06-05 23:32:01,541 INFO L226 Difference]: Without dead ends: 149346 [2021-06-05 23:32:01,542 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 5477.0ms TimeCoverageRelationStatistics Valid=1159, Invalid=8541, Unknown=2, NotChecked=0, Total=9702 [2021-06-05 23:32:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149346 states. [2021-06-05 23:32:03,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149346 to 91754. [2021-06-05 23:32:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91754 states, 91753 states have (on average 3.5850598890499494) internal successors, (328940), 91753 states have internal predecessors, (328940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91754 states to 91754 states and 328940 transitions. [2021-06-05 23:32:03,899 INFO L78 Accepts]: Start accepts. Automaton has 91754 states and 328940 transitions. Word has length 37 [2021-06-05 23:32:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:32:03,899 INFO L482 AbstractCegarLoop]: Abstraction has 91754 states and 328940 transitions. [2021-06-05 23:32:03,900 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 91754 states and 328940 transitions. [2021-06-05 23:32:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:32:03,998 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:32:03,999 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:32:04,199 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable929,134 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:32:04,199 INFO L430 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:32:04,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:32:04,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1171785827, now seen corresponding path program 132 times [2021-06-05 23:32:04,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:32:04,200 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611734932] [2021-06-05 23:32:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:32:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:32:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:32:04,475 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:32:04,475 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611734932] [2021-06-05 23:32:04,475 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611734932] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:32:04,475 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851603617] [2021-06-05 23:32:04,475 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:32:04,503 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-05 23:32:04,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:32:04,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 23:32:04,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:32:04,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:32:04,543 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:04,553 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:04,554 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:04,554 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:42 [2021-06-05 23:32:04,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:32:04,612 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:04,623 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:04,624 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:04,624 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:42 [2021-06-05 23:32:04,962 INFO L446 ElimStorePlain]: Different costs {2=[v_C_267], 9=[A, B]} [2021-06-05 23:32:04,986 INFO L354 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2021-06-05 23:32:04,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 46 [2021-06-05 23:32:04,987 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:05,016 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:05,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:05,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:05,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:05,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:05,053 INFO L354 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2021-06-05 23:32:05,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 70 [2021-06-05 23:32:05,057 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:05,107 INFO L628 ElimStorePlain]: treesize reduction 53, result has 56.9 percent of original size [2021-06-05 23:32:05,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:05,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:05,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:05,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:05,138 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:05,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 67 [2021-06-05 23:32:05,155 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 5 xjuncts. [2021-06-05 23:32:05,211 INFO L628 ElimStorePlain]: treesize reduction 107, result has 31.8 percent of original size [2021-06-05 23:32:05,221 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:32:05,221 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:91, output treesize:54 [2021-06-05 23:32:05,384 INFO L446 ElimStorePlain]: Different costs {2=[v_prenex_14], 5=[C]} [2021-06-05 23:32:05,398 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:05,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 23 [2021-06-05 23:32:05,400 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:05,419 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:05,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:05,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:05,711 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-06-05 23:32:05,711 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:05,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2021-06-05 23:32:05,715 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:32:05,731 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:05,735 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 23:32:05,735 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:36 [2021-06-05 23:32:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:32:05,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851603617] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:32:05,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:32:05,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2021-06-05 23:32:05,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273685539] [2021-06-05 23:32:05,803 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 23:32:05,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:32:05,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 23:32:05,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2021-06-05 23:32:05,803 INFO L87 Difference]: Start difference. First operand 91754 states and 328940 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:09,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:32:09,103 INFO L93 Difference]: Finished difference Result 94521 states and 337363 transitions. [2021-06-05 23:32:09,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 23:32:09,103 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:32:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:32:09,600 INFO L225 Difference]: With dead ends: 94521 [2021-06-05 23:32:09,600 INFO L226 Difference]: Without dead ends: 94434 [2021-06-05 23:32:09,600 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1863.5ms TimeCoverageRelationStatistics Valid=220, Invalid=1942, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 23:32:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94434 states. [2021-06-05 23:32:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94434 to 91778. [2021-06-05 23:32:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91778 states, 91777 states have (on average 3.5848415180273925) internal successors, (329006), 91777 states have internal predecessors, (329006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91778 states to 91778 states and 329006 transitions. [2021-06-05 23:32:11,302 INFO L78 Accepts]: Start accepts. Automaton has 91778 states and 329006 transitions. Word has length 37 [2021-06-05 23:32:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:32:11,302 INFO L482 AbstractCegarLoop]: Abstraction has 91778 states and 329006 transitions. [2021-06-05 23:32:11,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 91778 states and 329006 transitions. [2021-06-05 23:32:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:32:11,403 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:32:11,403 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:32:11,604 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable977,135 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:32:11,604 INFO L430 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:32:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:32:11,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1403168477, now seen corresponding path program 133 times [2021-06-05 23:32:11,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:32:11,604 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961130497] [2021-06-05 23:32:11,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:32:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:32:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:32:11,900 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:32:11,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961130497] [2021-06-05 23:32:11,900 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961130497] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:32:11,900 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203606918] [2021-06-05 23:32:11,900 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 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 23:32:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:32:11,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:32:11,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:32:11,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:32:11,972 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:11,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:11,985 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:11,985 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:36 [2021-06-05 23:32:12,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:32:12,042 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:12,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:12,055 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:12,055 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:45 [2021-06-05 23:32:12,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2021-06-05 23:32:12,169 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:12,175 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:12,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2021-06-05 23:32:12,178 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:12,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:12,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-06-05 23:32:12,187 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:12,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:12,192 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:12,193 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:21 [2021-06-05 23:32:12,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:32:12,249 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:12,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:12,250 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:12,250 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2021-06-05 23:32:12,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:32:12,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203606918] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:32:12,268 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:32:12,268 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2021-06-05 23:32:12,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028545593] [2021-06-05 23:32:12,268 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 23:32:12,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:32:12,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 23:32:12,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-06-05 23:32:12,269 INFO L87 Difference]: Start difference. First operand 91778 states and 329006 transitions. Second operand has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:32:13,478 INFO L93 Difference]: Finished difference Result 92419 states and 330828 transitions. [2021-06-05 23:32:13,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 23:32:13,479 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:32:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:32:13,700 INFO L225 Difference]: With dead ends: 92419 [2021-06-05 23:32:13,701 INFO L226 Difference]: Without dead ends: 92167 [2021-06-05 23:32:13,701 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 533.5ms TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2021-06-05 23:32:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92167 states. [2021-06-05 23:32:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92167 to 91784. [2021-06-05 23:32:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91784 states, 91783 states have (on average 3.5847706002200845) internal successors, (329021), 91783 states have internal predecessors, (329021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91784 states to 91784 states and 329021 transitions. [2021-06-05 23:32:15,847 INFO L78 Accepts]: Start accepts. Automaton has 91784 states and 329021 transitions. Word has length 37 [2021-06-05 23:32:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:32:15,847 INFO L482 AbstractCegarLoop]: Abstraction has 91784 states and 329021 transitions. [2021-06-05 23:32:15,847 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 91784 states and 329021 transitions. [2021-06-05 23:32:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:32:15,990 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:32:15,990 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:32:16,190 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 136 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1007 [2021-06-05 23:32:16,191 INFO L430 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:32:16,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:32:16,191 INFO L82 PathProgramCache]: Analyzing trace with hash 166862213, now seen corresponding path program 134 times [2021-06-05 23:32:16,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:32:16,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9405071] [2021-06-05 23:32:16,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:32:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:32:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:32:16,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:32:16,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9405071] [2021-06-05 23:32:16,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9405071] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:32:16,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860674455] [2021-06-05 23:32:16,560 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 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 23:32:16,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:32:16,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:32:16,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:32:16,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:32:16,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:32:16,648 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:16,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:16,659 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:16,659 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:42 [2021-06-05 23:32:16,723 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:32:16,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2021-06-05 23:32:16,724 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:16,737 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:16,737 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:16,737 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:51 [2021-06-05 23:32:16,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:16,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:16,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2021-06-05 23:32:16,819 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:16,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:16,835 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:16,835 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:73 [2021-06-05 23:32:16,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-06-05 23:32:16,940 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:16,949 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:16,950 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:16,950 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:47 [2021-06-05 23:32:16,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:32:16,991 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:16,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:16,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-06-05 23:32:16,996 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:16,998 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:16,998 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:16,998 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:32:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:32:17,018 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860674455] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:32:17,018 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:32:17,018 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:32:17,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411006897] [2021-06-05 23:32:17,018 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:32:17,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:32:17,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:32:17,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:32:17,019 INFO L87 Difference]: Start difference. First operand 91784 states and 329021 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:19,600 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-06-05 23:32:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:32:20,879 INFO L93 Difference]: Finished difference Result 143756 states and 510019 transitions. [2021-06-05 23:32:20,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-06-05 23:32:20,879 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:32:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:32:21,275 INFO L225 Difference]: With dead ends: 143756 [2021-06-05 23:32:21,276 INFO L226 Difference]: Without dead ends: 143695 [2021-06-05 23:32:21,276 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 2474.1ms TimeCoverageRelationStatistics Valid=608, Invalid=3682, Unknown=0, NotChecked=0, Total=4290 [2021-06-05 23:32:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143695 states. [2021-06-05 23:32:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143695 to 91808. [2021-06-05 23:32:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91808 states, 91807 states have (on average 3.5846830851677978) internal successors, (329099), 91807 states have internal predecessors, (329099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91808 states to 91808 states and 329099 transitions. [2021-06-05 23:32:23,629 INFO L78 Accepts]: Start accepts. Automaton has 91808 states and 329099 transitions. Word has length 37 [2021-06-05 23:32:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:32:23,629 INFO L482 AbstractCegarLoop]: Abstraction has 91808 states and 329099 transitions. [2021-06-05 23:32:23,629 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 91808 states and 329099 transitions. [2021-06-05 23:32:23,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:32:23,731 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:32:23,731 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:32:23,931 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1008,137 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:32:23,931 INFO L430 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:32:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:32:23,932 INFO L82 PathProgramCache]: Analyzing trace with hash -951933079, now seen corresponding path program 135 times [2021-06-05 23:32:23,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:32:23,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893606645] [2021-06-05 23:32:23,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:32:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:32:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:32:24,329 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:32:24,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893606645] [2021-06-05 23:32:24,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893606645] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:32:24,329 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801077887] [2021-06-05 23:32:24,329 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 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 23:32:24,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-06-05 23:32:24,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:32:24,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 23:32:24,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:32:24,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:32:24,425 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:24,434 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:24,435 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:24,435 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:37 [2021-06-05 23:32:24,508 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-06-05 23:32:24,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2021-06-05 23:32:24,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:24,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:24,522 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:24,522 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:71 [2021-06-05 23:32:24,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:24,704 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-06-05 23:32:24,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 59 [2021-06-05 23:32:24,706 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:24,732 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:24,735 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 1 xjuncts. [2021-06-05 23:32:24,736 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:104, output treesize:102 [2021-06-05 23:32:25,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,083 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:25,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 66 [2021-06-05 23:32:25,086 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:32:25,132 INFO L628 ElimStorePlain]: treesize reduction 60, result has 54.5 percent of original size [2021-06-05 23:32:25,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,152 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:25,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2021-06-05 23:32:25,157 INFO L550 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: and 2 xjuncts. [2021-06-05 23:32:25,171 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:25,173 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:32:25,174 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:50 [2021-06-05 23:32:25,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,286 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:25,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 25 [2021-06-05 23:32:25,288 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:25,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:25,315 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:25,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 63 [2021-06-05 23:32:25,321 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:32:25,366 INFO L628 ElimStorePlain]: treesize reduction 27, result has 64.5 percent of original size [2021-06-05 23:32:25,370 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 23:32:25,370 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:35 [2021-06-05 23:32:25,692 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-05 23:32:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:32:25,768 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801077887] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:32:25,768 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:32:25,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2021-06-05 23:32:25,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123321871] [2021-06-05 23:32:25,768 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 23:32:25,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:32:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 23:32:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=774, Unknown=2, NotChecked=0, Total=870 [2021-06-05 23:32:25,769 INFO L87 Difference]: Start difference. First operand 91808 states and 329099 transitions. Second operand has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:32,058 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2021-06-05 23:32:32,287 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2021-06-05 23:32:36,639 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2021-06-05 23:32:37,086 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2021-06-05 23:32:39,757 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2021-06-05 23:32:40,275 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2021-06-05 23:32:40,510 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2021-06-05 23:32:43,878 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2021-06-05 23:32:46,219 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2021-06-05 23:32:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:32:47,944 INFO L93 Difference]: Finished difference Result 144604 states and 512373 transitions. [2021-06-05 23:32:47,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-06-05 23:32:47,945 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:32:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:32:48,352 INFO L225 Difference]: With dead ends: 144604 [2021-06-05 23:32:48,352 INFO L226 Difference]: Without dead ends: 144438 [2021-06-05 23:32:48,353 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4749 ImplicationChecksByTransitivity, 14747.0ms TimeCoverageRelationStatistics Valid=1460, Invalid=12566, Unknown=16, NotChecked=0, Total=14042 [2021-06-05 23:32:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144438 states. [2021-06-05 23:32:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144438 to 91817. [2021-06-05 23:32:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91817 states, 91816 states have (on average 3.5846039905898754) internal successors, (329124), 91816 states have internal predecessors, (329124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91817 states to 91817 states and 329124 transitions. [2021-06-05 23:32:50,663 INFO L78 Accepts]: Start accepts. Automaton has 91817 states and 329124 transitions. Word has length 37 [2021-06-05 23:32:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:32:50,663 INFO L482 AbstractCegarLoop]: Abstraction has 91817 states and 329124 transitions. [2021-06-05 23:32:50,663 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 91817 states and 329124 transitions. [2021-06-05 23:32:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:32:50,759 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:32:50,759 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:32:50,959 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1009 [2021-06-05 23:32:50,959 INFO L430 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:32:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:32:50,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1393322339, now seen corresponding path program 136 times [2021-06-05 23:32:50,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:32:50,960 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115130684] [2021-06-05 23:32:50,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:32:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:32:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:32:51,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:32:51,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115130684] [2021-06-05 23:32:51,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115130684] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:32:51,359 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890018966] [2021-06-05 23:32:51,359 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 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 23:32:51,385 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:32:51,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:32:51,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:32:51,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:32:51,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:32:51,445 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:51,457 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:51,457 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:51,458 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:48 [2021-06-05 23:32:51,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:32:51,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2021-06-05 23:32:51,548 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:51,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:51,564 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:51,564 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:82, output treesize:86 [2021-06-05 23:32:51,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2021-06-05 23:32:51,655 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:51,671 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:51,672 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:51,672 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:71 [2021-06-05 23:32:51,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2021-06-05 23:32:51,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:51,734 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:51,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2021-06-05 23:32:51,736 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:51,741 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:51,742 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:51,742 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:30 [2021-06-05 23:32:51,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2021-06-05 23:32:51,802 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:32:51,803 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:32:51,804 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:32:51,804 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:5 [2021-06-05 23:32:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:32:51,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890018966] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:32:51,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:32:51,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:32:51,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58909467] [2021-06-05 23:32:51,827 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:32:51,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:32:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:32:51,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:32:51,827 INFO L87 Difference]: Start difference. First operand 91817 states and 329124 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:32:56,391 INFO L93 Difference]: Finished difference Result 143934 states and 510499 transitions. [2021-06-05 23:32:56,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-06-05 23:32:56,392 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:32:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:32:56,769 INFO L225 Difference]: With dead ends: 143934 [2021-06-05 23:32:56,770 INFO L226 Difference]: Without dead ends: 143733 [2021-06-05 23:32:56,770 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 2590.8ms TimeCoverageRelationStatistics Valid=663, Invalid=3497, Unknown=0, NotChecked=0, Total=4160 [2021-06-05 23:32:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143733 states. [2021-06-05 23:32:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143733 to 91817. [2021-06-05 23:32:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91817 states, 91816 states have (on average 3.584495077110743) internal successors, (329114), 91816 states have internal predecessors, (329114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91817 states to 91817 states and 329114 transitions. [2021-06-05 23:32:59,259 INFO L78 Accepts]: Start accepts. Automaton has 91817 states and 329114 transitions. Word has length 37 [2021-06-05 23:32:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:32:59,259 INFO L482 AbstractCegarLoop]: Abstraction has 91817 states and 329114 transitions. [2021-06-05 23:32:59,259 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:32:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 91817 states and 329114 transitions. [2021-06-05 23:32:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:32:59,369 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:32:59,369 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:32:59,569 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 139 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1028 [2021-06-05 23:32:59,569 INFO L430 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:32:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:32:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash 997127455, now seen corresponding path program 137 times [2021-06-05 23:32:59,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:32:59,570 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920730199] [2021-06-05 23:32:59,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:32:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:32:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:32:59,913 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:32:59,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920730199] [2021-06-05 23:32:59,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920730199] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:32:59,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485605846] [2021-06-05 23:32:59,913 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 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 23:32:59,943 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-06-05 23:32:59,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:32:59,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 50 conjunts are in the unsatisfiable core [2021-06-05 23:32:59,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:33:00,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:33:00,001 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:00,012 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:00,013 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:00,013 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:42 [2021-06-05 23:33:00,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:00,125 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-06-05 23:33:00,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2021-06-05 23:33:00,126 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:00,141 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:00,142 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:00,142 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:52 [2021-06-05 23:33:00,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:00,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:00,335 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-06-05 23:33:00,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 50 [2021-06-05 23:33:00,336 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:00,354 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:00,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:00,355 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:72 [2021-06-05 23:33:00,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2021-06-05 23:33:00,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:00,520 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:00,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-06-05 23:33:00,523 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:00,532 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:00,533 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:33:00,533 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:37 [2021-06-05 23:33:00,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:00,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:00,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:00,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:00,618 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:00,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 29 treesize of output 83 [2021-06-05 23:33:00,711 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2021-06-05 23:33:00,777 INFO L628 ElimStorePlain]: treesize reduction 403, result has 6.3 percent of original size [2021-06-05 23:33:00,779 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:00,779 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:21 [2021-06-05 23:33:00,832 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:00,832 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485605846] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:00,832 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:33:00,832 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2021-06-05 23:33:00,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497278299] [2021-06-05 23:33:00,832 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:33:00,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:33:00,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:33:00,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:33:00,833 INFO L87 Difference]: Start difference. First operand 91817 states and 329114 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:02,281 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2021-06-05 23:33:06,712 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-06-05 23:33:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:33:07,378 INFO L93 Difference]: Finished difference Result 152501 states and 538463 transitions. [2021-06-05 23:33:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-05 23:33:07,378 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:33:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:33:07,855 INFO L225 Difference]: With dead ends: 152501 [2021-06-05 23:33:07,856 INFO L226 Difference]: Without dead ends: 152303 [2021-06-05 23:33:07,856 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2602 ImplicationChecksByTransitivity, 4487.5ms TimeCoverageRelationStatistics Valid=1153, Invalid=7037, Unknown=0, NotChecked=0, Total=8190 [2021-06-05 23:33:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152303 states. [2021-06-05 23:33:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152303 to 91814. [2021-06-05 23:33:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91814 states, 91813 states have (on average 3.584546850663849) internal successors, (329108), 91813 states have internal predecessors, (329108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91814 states to 91814 states and 329108 transitions. [2021-06-05 23:33:10,335 INFO L78 Accepts]: Start accepts. Automaton has 91814 states and 329108 transitions. Word has length 37 [2021-06-05 23:33:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:33:10,336 INFO L482 AbstractCegarLoop]: Abstraction has 91814 states and 329108 transitions. [2021-06-05 23:33:10,336 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 91814 states and 329108 transitions. [2021-06-05 23:33:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:33:10,434 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:33:10,434 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:33:10,634 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1029 [2021-06-05 23:33:10,635 INFO L430 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:33:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:33:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash -335393339, now seen corresponding path program 138 times [2021-06-05 23:33:10,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:33:10,635 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780803559] [2021-06-05 23:33:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:33:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:33:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:10,975 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:33:10,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780803559] [2021-06-05 23:33:10,975 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780803559] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:10,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770979989] [2021-06-05 23:33:10,975 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 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 23:33:11,005 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2021-06-05 23:33:11,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:33:11,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 23:33:11,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:33:11,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:33:11,062 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:11,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:11,074 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:11,074 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:48 [2021-06-05 23:33:11,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:11,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2021-06-05 23:33:11,148 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:11,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:11,165 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:11,165 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:75 [2021-06-05 23:33:11,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:11,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:11,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:11,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2021-06-05 23:33:11,296 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:11,315 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:11,315 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:11,315 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:90, output treesize:89 [2021-06-05 23:33:11,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2021-06-05 23:33:11,422 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:11,430 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:11,431 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:11,431 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:38 [2021-06-05 23:33:11,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:33:11,511 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:11,518 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:11,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-06-05 23:33:11,520 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:11,524 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:11,524 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:11,524 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:12 [2021-06-05 23:33:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:11,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770979989] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:11,570 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:33:11,570 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-06-05 23:33:11,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576697026] [2021-06-05 23:33:11,570 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 23:33:11,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:33:11,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 23:33:11,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2021-06-05 23:33:11,571 INFO L87 Difference]: Start difference. First operand 91814 states and 329108 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:12,768 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2021-06-05 23:33:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:33:15,289 INFO L93 Difference]: Finished difference Result 119436 states and 420828 transitions. [2021-06-05 23:33:15,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-06-05 23:33:15,289 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:33:15,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:33:15,882 INFO L225 Difference]: With dead ends: 119436 [2021-06-05 23:33:15,882 INFO L226 Difference]: Without dead ends: 119009 [2021-06-05 23:33:15,882 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 2215.6ms TimeCoverageRelationStatistics Valid=465, Invalid=2957, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 23:33:15,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119009 states. [2021-06-05 23:33:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119009 to 91998. [2021-06-05 23:33:17,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91998 states, 91997 states have (on average 3.5843234018500603) internal successors, (329747), 91997 states have internal predecessors, (329747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91998 states to 91998 states and 329747 transitions. [2021-06-05 23:33:17,784 INFO L78 Accepts]: Start accepts. Automaton has 91998 states and 329747 transitions. Word has length 37 [2021-06-05 23:33:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:33:17,784 INFO L482 AbstractCegarLoop]: Abstraction has 91998 states and 329747 transitions. [2021-06-05 23:33:17,784 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 91998 states and 329747 transitions. [2021-06-05 23:33:17,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:33:17,888 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:33:17,888 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:33:18,088 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1070,141 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:33:18,088 INFO L430 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:33:18,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:33:18,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1755844951, now seen corresponding path program 139 times [2021-06-05 23:33:18,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:33:18,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827971654] [2021-06-05 23:33:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:33:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:33:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:18,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:33:18,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827971654] [2021-06-05 23:33:18,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827971654] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:18,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094375839] [2021-06-05 23:33:18,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 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 23:33:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:33:18,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:33:18,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:33:18,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:33:18,487 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:18,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:18,500 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:18,500 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:56 [2021-06-05 23:33:18,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:18,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2021-06-05 23:33:18,570 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:18,585 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:18,586 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:18,586 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:72 [2021-06-05 23:33:18,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:18,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:18,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:18,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2021-06-05 23:33:18,990 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:19,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:19,009 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:19,009 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:84 [2021-06-05 23:33:19,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2021-06-05 23:33:19,158 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:19,166 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:19,166 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:19,166 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:43 [2021-06-05 23:33:19,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:33:19,207 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:19,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:19,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2021-06-05 23:33:19,213 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:19,214 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:19,215 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:19,215 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2021-06-05 23:33:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:19,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094375839] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:19,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:33:19,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:33:19,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292989543] [2021-06-05 23:33:19,235 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:33:19,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:33:19,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:33:19,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:33:19,235 INFO L87 Difference]: Start difference. First operand 91998 states and 329747 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:33:21,956 INFO L93 Difference]: Finished difference Result 115782 states and 407189 transitions. [2021-06-05 23:33:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 23:33:21,957 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:33:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:33:22,315 INFO L225 Difference]: With dead ends: 115782 [2021-06-05 23:33:22,316 INFO L226 Difference]: Without dead ends: 115691 [2021-06-05 23:33:22,316 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 1608.9ms TimeCoverageRelationStatistics Valid=361, Invalid=1445, Unknown=0, NotChecked=0, Total=1806 [2021-06-05 23:33:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115691 states. [2021-06-05 23:33:23,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115691 to 92002. [2021-06-05 23:33:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92002 states, 92001 states have (on average 3.5843414745491895) internal successors, (329763), 92001 states have internal predecessors, (329763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92002 states to 92002 states and 329763 transitions. [2021-06-05 23:33:24,274 INFO L78 Accepts]: Start accepts. Automaton has 92002 states and 329763 transitions. Word has length 37 [2021-06-05 23:33:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:33:24,274 INFO L482 AbstractCegarLoop]: Abstraction has 92002 states and 329763 transitions. [2021-06-05 23:33:24,274 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand 92002 states and 329763 transitions. [2021-06-05 23:33:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:33:24,379 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:33:24,379 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:33:24,580 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1071,142 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:33:24,580 INFO L430 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:33:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:33:24,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1519304301, now seen corresponding path program 140 times [2021-06-05 23:33:24,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:33:24,581 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038055213] [2021-06-05 23:33:24,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:33:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:33:25,114 WARN L205 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 18 [2021-06-05 23:33:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:25,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:33:25,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038055213] [2021-06-05 23:33:25,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038055213] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:25,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657937290] [2021-06-05 23:33:25,312 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 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 23:33:25,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 23:33:25,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:33:25,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:33:25,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:33:25,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:33:25,397 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:25,409 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:25,409 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:25,409 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:56 [2021-06-05 23:33:25,478 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:33:25,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:25,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2021-06-05 23:33:25,480 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:25,495 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:25,496 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:25,496 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:73 [2021-06-05 23:33:25,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:25,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:25,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:25,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2021-06-05 23:33:25,543 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:25,561 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:25,561 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:25,561 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:86, output treesize:85 [2021-06-05 23:33:25,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2021-06-05 23:33:25,710 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:25,718 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:25,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-06-05 23:33:25,720 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:25,725 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:25,726 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:25,726 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:27 [2021-06-05 23:33:25,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 23:33:25,756 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:25,757 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:25,757 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:25,758 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:5 [2021-06-05 23:33:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:25,785 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657937290] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:25,785 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:33:25,785 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:33:25,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315555014] [2021-06-05 23:33:25,785 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:33:25,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:33:25,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:33:25,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:33:25,785 INFO L87 Difference]: Start difference. First operand 92002 states and 329763 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:33:30,315 INFO L93 Difference]: Finished difference Result 155122 states and 547535 transitions. [2021-06-05 23:33:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-06-05 23:33:30,324 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:33:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:33:30,750 INFO L225 Difference]: With dead ends: 155122 [2021-06-05 23:33:30,750 INFO L226 Difference]: Without dead ends: 154964 [2021-06-05 23:33:30,750 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 3265.8ms TimeCoverageRelationStatistics Valid=841, Invalid=3449, Unknown=0, NotChecked=0, Total=4290 [2021-06-05 23:33:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154964 states. [2021-06-05 23:33:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154964 to 92005. [2021-06-05 23:33:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92005 states, 92004 states have (on average 3.5841919916525367) internal successors, (329760), 92004 states have internal predecessors, (329760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:33,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92005 states to 92005 states and 329760 transitions. [2021-06-05 23:33:33,147 INFO L78 Accepts]: Start accepts. Automaton has 92005 states and 329760 transitions. Word has length 37 [2021-06-05 23:33:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:33:33,147 INFO L482 AbstractCegarLoop]: Abstraction has 92005 states and 329760 transitions. [2021-06-05 23:33:33,147 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 92005 states and 329760 transitions. [2021-06-05 23:33:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:33:33,241 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:33:33,241 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:33:33,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1072 [2021-06-05 23:33:33,441 INFO L430 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:33:33,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:33:33,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1471748643, now seen corresponding path program 141 times [2021-06-05 23:33:33,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:33:33,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187787967] [2021-06-05 23:33:33,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:33:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:33:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:33,762 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:33:33,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187787967] [2021-06-05 23:33:33,762 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187787967] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:33,762 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403637517] [2021-06-05 23:33:33,762 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 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 23:33:33,797 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-06-05 23:33:33,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:33:33,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 49 conjunts are in the unsatisfiable core [2021-06-05 23:33:33,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:33:33,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:33:33,854 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:33,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:33,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:33,866 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:48 [2021-06-05 23:33:33,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:33:33,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:33,938 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:33,939 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:33,939 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2021-06-05 23:33:34,029 INFO L354 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2021-06-05 23:33:34,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 43 [2021-06-05 23:33:34,031 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:34,049 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:34,051 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 1 xjuncts. [2021-06-05 23:33:34,051 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:61 [2021-06-05 23:33:34,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:34,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:34,400 INFO L354 Elim1Store]: treesize reduction 16, result has 73.8 percent of original size [2021-06-05 23:33:34,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 78 [2021-06-05 23:33:34,406 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 23:33:34,517 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2021-06-05 23:33:34,518 INFO L628 ElimStorePlain]: treesize reduction 91, result has 51.6 percent of original size [2021-06-05 23:33:34,532 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:33:34,532 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:110 [2021-06-05 23:33:34,885 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-06-05 23:33:35,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:35,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:35,099 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:33:35,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:33:35,100 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:35,118 INFO L628 ElimStorePlain]: treesize reduction 3, result has 93.5 percent of original size [2021-06-05 23:33:35,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:35,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:33:35,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:35,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-06-05 23:33:35,122 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:35,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:35,129 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:35,129 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:5 [2021-06-05 23:33:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:35,148 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403637517] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:35,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:33:35,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2021-06-05 23:33:35,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893644512] [2021-06-05 23:33:35,149 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 23:33:35,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:33:35,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 23:33:35,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2021-06-05 23:33:35,149 INFO L87 Difference]: Start difference. First operand 92005 states and 329760 transitions. Second operand has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:33:39,562 INFO L93 Difference]: Finished difference Result 106072 states and 374129 transitions. [2021-06-05 23:33:39,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-06-05 23:33:39,562 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:33:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:33:39,843 INFO L225 Difference]: With dead ends: 106072 [2021-06-05 23:33:39,843 INFO L226 Difference]: Without dead ends: 105970 [2021-06-05 23:33:39,843 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 2653.0ms TimeCoverageRelationStatistics Valid=500, Invalid=3406, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 23:33:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105970 states. [2021-06-05 23:33:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105970 to 92026. [2021-06-05 23:33:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92026 states, 92025 states have (on average 3.5840369464819344) internal successors, (329821), 92025 states have internal predecessors, (329821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92026 states to 92026 states and 329821 transitions. [2021-06-05 23:33:41,647 INFO L78 Accepts]: Start accepts. Automaton has 92026 states and 329821 transitions. Word has length 37 [2021-06-05 23:33:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:33:41,647 INFO L482 AbstractCegarLoop]: Abstraction has 92026 states and 329821 transitions. [2021-06-05 23:33:41,647 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 2.310344827586207) internal successors, (67), 28 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 92026 states and 329821 transitions. [2021-06-05 23:33:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:33:42,174 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:33:42,175 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:33:42,390 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1073,144 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 23:33:42,390 INFO L430 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:33:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:33:42,391 INFO L82 PathProgramCache]: Analyzing trace with hash 839365129, now seen corresponding path program 142 times [2021-06-05 23:33:42,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:33:42,391 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102120284] [2021-06-05 23:33:42,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:33:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:33:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:42,714 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:33:42,714 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102120284] [2021-06-05 23:33:42,714 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102120284] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:42,714 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518219466] [2021-06-05 23:33:42,714 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 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 23:33:42,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 23:33:42,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:33:42,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 23:33:42,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:33:42,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:33:42,798 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:42,808 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:42,809 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:42,809 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:42 [2021-06-05 23:33:42,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-06-05 23:33:42,874 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:42,889 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:42,889 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:42,889 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:47 [2021-06-05 23:33:42,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2021-06-05 23:33:42,928 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:42,942 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:42,943 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:42,943 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:55 [2021-06-05 23:33:43,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2021-06-05 23:33:43,069 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:43,076 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:43,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:43,077 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:43 [2021-06-05 23:33:43,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-06-05 23:33:43,117 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:43,121 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:43,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2021-06-05 23:33:43,123 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:43,124 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:43,124 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:43,124 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:5 [2021-06-05 23:33:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:43,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518219466] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:43,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:33:43,144 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2021-06-05 23:33:43,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754058091] [2021-06-05 23:33:43,144 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 23:33:43,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:33:43,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 23:33:43,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2021-06-05 23:33:43,144 INFO L87 Difference]: Start difference. First operand 92026 states and 329821 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:33:46,480 INFO L93 Difference]: Finished difference Result 154460 states and 545262 transitions. [2021-06-05 23:33:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 23:33:46,480 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:33:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:33:46,903 INFO L225 Difference]: With dead ends: 154460 [2021-06-05 23:33:46,903 INFO L226 Difference]: Without dead ends: 154379 [2021-06-05 23:33:46,903 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1539.3ms TimeCoverageRelationStatistics Valid=509, Invalid=2247, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 23:33:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154379 states. [2021-06-05 23:33:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154379 to 92029. [2021-06-05 23:33:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92029 states, 92028 states have (on average 3.584104837658104) internal successors, (329838), 92028 states have internal predecessors, (329838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92029 states to 92029 states and 329838 transitions. [2021-06-05 23:33:49,423 INFO L78 Accepts]: Start accepts. Automaton has 92029 states and 329838 transitions. Word has length 37 [2021-06-05 23:33:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:33:49,424 INFO L482 AbstractCegarLoop]: Abstraction has 92029 states and 329838 transitions. [2021-06-05 23:33:49,424 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 92029 states and 329838 transitions. [2021-06-05 23:33:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:33:49,529 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:33:49,529 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:33:49,729 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1088 [2021-06-05 23:33:49,729 INFO L430 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:33:49,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:33:49,729 INFO L82 PathProgramCache]: Analyzing trace with hash 451930599, now seen corresponding path program 143 times [2021-06-05 23:33:49,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:33:49,730 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932764816] [2021-06-05 23:33:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:33:49,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:33:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:50,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:33:50,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932764816] [2021-06-05 23:33:50,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932764816] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:50,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663627120] [2021-06-05 23:33:50,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 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 23:33:50,076 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-06-05 23:33:50,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:33:50,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 50 conjunts are in the unsatisfiable core [2021-06-05 23:33:50,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:33:50,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 23:33:50,130 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:50,140 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:50,140 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:50,140 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2021-06-05 23:33:50,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:50,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:50,236 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-06-05 23:33:50,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 42 [2021-06-05 23:33:50,237 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:50,252 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:50,253 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:50,253 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:58 [2021-06-05 23:33:50,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:50,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:50,374 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-06-05 23:33:50,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 50 [2021-06-05 23:33:50,375 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:50,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:50,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:50,392 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:60 [2021-06-05 23:33:50,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2021-06-05 23:33:50,574 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:50,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:50,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2021-06-05 23:33:50,589 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:33:50,598 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:50,599 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 23:33:50,599 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:37 [2021-06-05 23:33:50,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:50,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:50,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:50,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:33:50,684 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:33:50,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 29 treesize of output 83 [2021-06-05 23:33:51,024 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 128 [2021-06-05 23:33:51,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2021-06-05 23:33:51,143 INFO L628 ElimStorePlain]: treesize reduction 663, result has 3.9 percent of original size [2021-06-05 23:33:51,145 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:33:51,145 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:21 [2021-06-05 23:33:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:33:51,198 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663627120] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:33:51,198 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:33:51,198 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2021-06-05 23:33:51,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054585745] [2021-06-05 23:33:51,198 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 23:33:51,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:33:51,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 23:33:51,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2021-06-05 23:33:51,199 INFO L87 Difference]: Start difference. First operand 92029 states and 329838 transitions. Second operand has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:33:54,935 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2021-06-05 23:33:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 23:33:57,467 INFO L93 Difference]: Finished difference Result 149768 states and 529766 transitions. [2021-06-05 23:33:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-06-05 23:33:57,467 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 23:33:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 23:33:57,886 INFO L225 Difference]: With dead ends: 149768 [2021-06-05 23:33:57,886 INFO L226 Difference]: Without dead ends: 149653 [2021-06-05 23:33:57,887 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2384 ImplicationChecksByTransitivity, 4177.2ms TimeCoverageRelationStatistics Valid=1155, Invalid=6327, Unknown=0, NotChecked=0, Total=7482 [2021-06-05 23:33:58,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149653 states. [2021-06-05 23:33:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149653 to 92032. [2021-06-05 23:33:59,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92032 states, 92031 states have (on average 3.583977138138236) internal successors, (329837), 92031 states have internal predecessors, (329837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:34:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92032 states to 92032 states and 329837 transitions. [2021-06-05 23:34:00,158 INFO L78 Accepts]: Start accepts. Automaton has 92032 states and 329837 transitions. Word has length 37 [2021-06-05 23:34:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 23:34:00,158 INFO L482 AbstractCegarLoop]: Abstraction has 92032 states and 329837 transitions. [2021-06-05 23:34:00,158 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 2.357142857142857) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:34:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 92032 states and 329837 transitions. [2021-06-05 23:34:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 23:34:00,261 INFO L546 BasicCegarLoop]: Found error trace [2021-06-05 23:34:00,261 INFO L554 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 23:34:00,461 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 146 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1089 [2021-06-05 23:34:00,461 INFO L430 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-06-05 23:34:00,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 23:34:00,462 INFO L82 PathProgramCache]: Analyzing trace with hash -271278237, now seen corresponding path program 144 times [2021-06-05 23:34:00,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 23:34:00,462 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054802985] [2021-06-05 23:34:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 23:34:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 23:34:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:34:00,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 23:34:00,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054802985] [2021-06-05 23:34:00,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054802985] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:34:00,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436756653] [2021-06-05 23:34:00,804 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 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 23:34:00,835 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-06-05 23:34:00,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 23:34:00,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 23:34:00,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 23:34:00,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2021-06-05 23:34:00,890 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:34:00,900 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:34:00,901 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:34:00,901 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:40 [2021-06-05 23:34:00,962 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 23:34:00,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2021-06-05 23:34:00,964 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:34:00,979 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:34:00,979 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:34:00,979 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:50 [2021-06-05 23:34:01,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:34:01,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:34:01,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 36 [2021-06-05 23:34:01,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:34:01,123 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:34:01,124 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 23:34:01,124 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:58 [2021-06-05 23:34:01,560 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-06-05 23:34:01,601 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:34:01,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 56 [2021-06-05 23:34:01,602 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 23:34:01,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:34:01,671 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:34:01,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 88 [2021-06-05 23:34:01,702 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 23:34:01,762 INFO L628 ElimStorePlain]: treesize reduction 41, result has 69.6 percent of original size [2021-06-05 23:34:01,773 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 23:34:01,774 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:232 [2021-06-05 23:34:01,957 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 23:34:01,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2021-06-05 23:34:01,960 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2021-06-05 23:34:01,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:34:01,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:34:01,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:34:01,969 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 23:34:01,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:34:01,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:34:01,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2021-06-05 23:34:01,978 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 23:34:01,980 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-06-05 23:34:01,981 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 23:34:01,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:34:01,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-05 23:34:01,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2021-06-05 23:34:01,986 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 23:34:02,041 INFO L628 ElimStorePlain]: treesize reduction 57, result has 51.3 percent of original size [2021-06-05 23:34:02,043 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2021-06-05 23:34:02,044 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:183, output treesize:49 [2021-06-05 23:34:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 23:34:02,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436756653] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 23:34:02,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 23:34:02,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2021-06-05 23:34:02,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264191682] [2021-06-05 23:34:02,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 23:34:02,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 23:34:02,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 23:34:02,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=696, Unknown=0, NotChecked=0, Total=812 [2021-06-05 23:34:02,162 INFO L87 Difference]: Start difference. First operand 92032 states and 329837 transitions. Second operand has 29 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 23:34:05,830 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2021-06-05 23:34:06,730 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2021-06-05 23:34:07,086 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 Received shutdown request... [2021-06-05 23:34:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-05 23:34:07,797 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 147 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1138 [2021-06-05 23:34:07,798 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 23:34:07,800 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-05 23:34:07,801 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 23:34:07,801 INFO L202 PluginConnector]: Adding new model three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 11:34:07 BasicIcfg [2021-06-05 23:34:07,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 23:34:07,802 INFO L168 Benchmark]: Toolchain (without parser) took 755640.19 ms. Allocated memory was 337.6 MB in the beginning and 16.0 GB in the end (delta: 15.7 GB). Free memory was 316.7 MB in the beginning and 11.8 GB in the end (delta: -11.4 GB). Peak memory consumption was 4.2 GB. Max. memory is 16.0 GB. [2021-06-05 23:34:07,802 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.09 ms. Allocated memory is still 337.6 MB. Free memory is still 317.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 23:34:07,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.04 ms. Allocated memory is still 337.6 MB. Free memory was 316.6 MB in the beginning and 315.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 23:34:07,803 INFO L168 Benchmark]: Boogie Preprocessor took 17.07 ms. Allocated memory is still 337.6 MB. Free memory was 315.2 MB in the beginning and 314.2 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 23:34:07,803 INFO L168 Benchmark]: RCFGBuilder took 212.47 ms. Allocated memory is still 337.6 MB. Free memory was 314.1 MB in the beginning and 299.9 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-06-05 23:34:07,803 INFO L168 Benchmark]: TraceAbstraction took 755386.94 ms. Allocated memory was 337.6 MB in the beginning and 16.0 GB in the end (delta: 15.7 GB). Free memory was 299.5 MB in the beginning and 11.8 GB in the end (delta: -11.5 GB). Peak memory consumption was 4.2 GB. Max. memory is 16.0 GB. [2021-06-05 23:34:07,803 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.09 ms. Allocated memory is still 337.6 MB. Free memory is still 317.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 19.04 ms. Allocated memory is still 337.6 MB. Free memory was 316.6 MB in the beginning and 315.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 17.07 ms. Allocated memory is still 337.6 MB. Free memory was 315.2 MB in the beginning and 314.2 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 212.47 ms. Allocated memory is still 337.6 MB. Free memory was 314.1 MB in the beginning and 299.9 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 755386.94 ms. Allocated memory was 337.6 MB in the beginning and 16.0 GB in the end (delta: 15.7 GB). Free memory was 299.5 MB in the beginning and 11.8 GB in the end (delta: -11.5 GB). Peak memory consumption was 4.2 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (92032states) and FLOYD_HOARE automaton (currently 60 states, 29 states before enhancement),while ReachableStatesComputation was computing reachable states (79202 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 755313.9ms, OverallIterations: 152, TraceHistogramMax: 3, EmptinessCheckTime: 11593.6ms, AutomataDifference: 358523.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 23.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7073 SDtfs, 34210 SDslu, 68621 SDs, 0 SdLazy, 177174 SolverSat, 7421 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 124837.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9288 GetRequests, 3729 SyntacticMatches, 189 SemanticMatches, 5370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74405 ImplicationChecksByTransitivity, 190527.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=151324occurred in iteration=69, InterpolantAutomatonStates: 4357, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 200103.5ms AutomataMinimizationTime, 151 MinimizatonAttempts, 2741011 StatesRemovedByMinimization, 151 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 592.0ms SsaConstructionTime, 2492.6ms SatisfiabilityAnalysisTime, 148968.0ms InterpolantComputationTime, 9880 NumberOfCodeBlocks, 9873 NumberOfCodeBlocksAsserted, 615 NumberOfCheckSat, 9582 ConstructedInterpolants, 278 QuantifiedInterpolants, 268780 SizeOfPredicates, 905 NumberOfNonLiveVariables, 14061 ConjunctsInSsa, 5061 ConjunctsInUnsatCore, 298 InterpolantComputations, 6 PerfectInterpolantSequences, 610/6441 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