/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-770125f [2021-05-21 20:49:22,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-21 20:49:22,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-21 20:49:22,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-21 20:49:22,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-21 20:49:22,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-21 20:49:22,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-21 20:49:22,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-21 20:49:22,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-21 20:49:22,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-21 20:49:22,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-21 20:49:22,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-21 20:49:22,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-21 20:49:22,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-21 20:49:22,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-21 20:49:22,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-21 20:49:22,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-21 20:49:22,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-21 20:49:22,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-21 20:49:22,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-21 20:49:22,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-21 20:49:22,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-21 20:49:22,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-21 20:49:22,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-21 20:49:22,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-21 20:49:22,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-21 20:49:22,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-21 20:49:22,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-21 20:49:22,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-21 20:49:22,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-21 20:49:22,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-21 20:49:22,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-21 20:49:22,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-21 20:49:22,122 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-21 20:49:22,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-21 20:49:22,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-21 20:49:22,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-21 20:49:22,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-21 20:49:22,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-21 20:49:22,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-21 20:49:22,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-21 20:49:22,128 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-05-21 20:49:22,156 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-21 20:49:22,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-21 20:49:22,156 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-21 20:49:22,156 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-21 20:49:22,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-21 20:49:22,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-21 20:49:22,158 INFO L138 SettingsManager]: * Use SBE=true [2021-05-21 20:49:22,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-21 20:49:22,158 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-21 20:49:22,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-21 20:49:22,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-21 20:49:22,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-21 20:49:22,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-21 20:49:22,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-21 20:49:22,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-21 20:49:22,159 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-21 20:49:22,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-21 20:49:22,159 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-21 20:49:22,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-21 20:49:22,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-21 20:49:22,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-21 20:49:22,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-21 20:49:22,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-21 20:49:22,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-21 20:49:22,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-21 20:49:22,160 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-21 20:49:22,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-21 20:49:22,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-21 20:49:22,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-21 20:49:22,161 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-21 20:49:22,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-21 20:49:22,161 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-05-21 20:49:22,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-21 20:49:22,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-21 20:49:22,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-21 20:49:22,443 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-05-21 20:49:22,444 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-05-21 20:49:22,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-symm.wvr.bpl [2021-05-21 20:49:22,445 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-symm.wvr.bpl' [2021-05-21 20:49:22,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-21 20:49:22,570 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-21 20:49:22,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-21 20:49:22,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-21 20:49:22,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-21 20:49:22,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:49:22" (1/1) ... [2021-05-21 20:49:22,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:49:22" (1/1) ... [2021-05-21 20:49:22,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-21 20:49:22,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-21 20:49:22,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-21 20:49:22,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-21 20:49:22,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:49:22" (1/1) ... [2021-05-21 20:49:22,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:49:22" (1/1) ... [2021-05-21 20:49:22,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:49:22" (1/1) ... [2021-05-21 20:49:22,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:49:22" (1/1) ... [2021-05-21 20:49:22,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:49:22" (1/1) ... [2021-05-21 20:49:22,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:49:22" (1/1) ... [2021-05-21 20:49:22,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:49:22" (1/1) ... [2021-05-21 20:49:22,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-21 20:49:22,636 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-21 20:49:22,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-21 20:49:22,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-21 20:49:22,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:49:22" (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-05-21 20:49:22,727 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-05-21 20:49:22,727 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-05-21 20:49:22,728 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-05-21 20:49:22,728 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-05-21 20:49:22,728 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-05-21 20:49:22,728 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-05-21 20:49:22,728 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-05-21 20:49:22,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-21 20:49:22,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-21 20:49:22,729 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-05-21 20:49:23,056 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-21 20:49:23,057 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-21 20:49:23,058 INFO L202 PluginConnector]: Adding new model word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 08:49:23 BoogieIcfgContainer [2021-05-21 20:49:23,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-21 20:49:23,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-21 20:49:23,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-21 20:49:23,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-21 20:49:23,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 08:49:22" (1/2) ... [2021-05-21 20:49:23,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1990d8e6 and model type word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 08:49:23, skipping insertion in model container [2021-05-21 20:49:23,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 08:49:23" (2/2) ... [2021-05-21 20:49:23,072 INFO L111 eAbstractionObserver]: Analyzing ICFG word-symm.wvr.bpl [2021-05-21 20:49:23,079 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-21 20:49:23,079 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-21 20:49:23,079 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-05-21 20:49:23,080 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-21 20:49:23,102 INFO L149 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-05-21 20:49:23,119 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-05-21 20:49:23,135 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 20:49:23,135 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 20:49:23,135 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 20:49:23,135 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 20:49:23,135 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 20:49:23,135 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 20:49:23,135 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 20:49:23,136 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 20:49:23,145 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 20 transitions, 56 flow [2021-05-21 20:49:23,156 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 30 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 29 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-05-21 20:49:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 29 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-05-21 20:49:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-05-21 20:49:23,164 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:23,165 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:23,165 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:23,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:23,175 INFO L82 PathProgramCache]: Analyzing trace with hash 942627414, now seen corresponding path program 1 times [2021-05-21 20:49:23,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:23,182 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915639535] [2021-05-21 20:49:23,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:23,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:23,358 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:23,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915639535] [2021-05-21 20:49:23,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915639535] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:23,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:23,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-21 20:49:23,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399669956] [2021-05-21 20:49:23,363 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 20:49:23,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 20:49:23,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-21 20:49:23,375 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 29 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) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:23,442 INFO L93 Difference]: Finished difference Result 52 states and 96 transitions. [2021-05-21 20:49:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-21 20:49:23,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-05-21 20:49:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:23,451 INFO L225 Difference]: With dead ends: 52 [2021-05-21 20:49:23,451 INFO L226 Difference]: Without dead ends: 40 [2021-05-21 20:49:23,452 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:49:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-21 20:49:23,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2021-05-21 20:49:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2021-05-21 20:49:23,484 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 10 [2021-05-21 20:49:23,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:23,485 INFO L482 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2021-05-21 20:49:23,485 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,485 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2021-05-21 20:49:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-05-21 20:49:23,486 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:23,486 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:23,487 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-21 20:49:23,487 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:23,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:23,492 INFO L82 PathProgramCache]: Analyzing trace with hash 382081942, now seen corresponding path program 2 times [2021-05-21 20:49:23,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:23,492 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991521866] [2021-05-21 20:49:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:23,591 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:23,592 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991521866] [2021-05-21 20:49:23,592 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991521866] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:23,592 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:23,592 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-21 20:49:23,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201591066] [2021-05-21 20:49:23,593 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-21 20:49:23,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:23,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-21 20:49:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-21 20:49:23,595 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:23,660 INFO L93 Difference]: Finished difference Result 48 states and 86 transitions. [2021-05-21 20:49:23,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-21 20:49:23,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-05-21 20:49:23,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:23,664 INFO L225 Difference]: With dead ends: 48 [2021-05-21 20:49:23,664 INFO L226 Difference]: Without dead ends: 39 [2021-05-21 20:49:23,664 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:49:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-21 20:49:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2021-05-21 20:49:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 27 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-05-21 20:49:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 59 transitions. [2021-05-21 20:49:23,670 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 59 transitions. Word has length 10 [2021-05-21 20:49:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:23,670 INFO L482 AbstractCegarLoop]: Abstraction has 28 states and 59 transitions. [2021-05-21 20:49:23,670 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 59 transitions. [2021-05-21 20:49:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-21 20:49:23,671 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:23,671 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:23,671 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-21 20:49:23,671 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:23,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:23,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1385928133, now seen corresponding path program 1 times [2021-05-21 20:49:23,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:23,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311920003] [2021-05-21 20:49:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:23,692 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:23,692 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311920003] [2021-05-21 20:49:23,692 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311920003] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:23,693 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:23,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-21 20:49:23,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563103061] [2021-05-21 20:49:23,693 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 20:49:23,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 20:49:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:49:23,695 INFO L87 Difference]: Start difference. First operand 28 states and 59 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:23,700 INFO L93 Difference]: Finished difference Result 28 states and 52 transitions. [2021-05-21 20:49:23,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 20:49:23,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-05-21 20:49:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:23,702 INFO L225 Difference]: With dead ends: 28 [2021-05-21 20:49:23,702 INFO L226 Difference]: Without dead ends: 28 [2021-05-21 20:49:23,702 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 20:49:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-05-21 20:49:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-05-21 20:49:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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-05-21 20:49:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 52 transitions. [2021-05-21 20:49:23,706 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 52 transitions. Word has length 11 [2021-05-21 20:49:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:23,706 INFO L482 AbstractCegarLoop]: Abstraction has 28 states and 52 transitions. [2021-05-21 20:49:23,706 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 52 transitions. [2021-05-21 20:49:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-21 20:49:23,707 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:23,707 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:23,707 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-21 20:49:23,707 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:23,708 INFO L82 PathProgramCache]: Analyzing trace with hash 924188067, now seen corresponding path program 1 times [2021-05-21 20:49:23,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:23,708 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449710415] [2021-05-21 20:49:23,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:23,773 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:23,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449710415] [2021-05-21 20:49:23,773 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449710415] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:23,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:23,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:49:23,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342776542] [2021-05-21 20:49:23,774 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:49:23,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:23,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:49:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:49:23,776 INFO L87 Difference]: Start difference. First operand 28 states and 52 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:23,828 INFO L93 Difference]: Finished difference Result 60 states and 109 transitions. [2021-05-21 20:49:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:49:23,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-05-21 20:49:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:23,830 INFO L225 Difference]: With dead ends: 60 [2021-05-21 20:49:23,830 INFO L226 Difference]: Without dead ends: 53 [2021-05-21 20:49:23,830 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 44.3ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-05-21 20:49:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-05-21 20:49:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2021-05-21 20:49:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 37 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 71 transitions. [2021-05-21 20:49:23,836 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 71 transitions. Word has length 12 [2021-05-21 20:49:23,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:23,837 INFO L482 AbstractCegarLoop]: Abstraction has 38 states and 71 transitions. [2021-05-21 20:49:23,837 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 71 transitions. [2021-05-21 20:49:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-21 20:49:23,837 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:23,837 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:23,838 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-21 20:49:23,838 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:23,838 INFO L82 PathProgramCache]: Analyzing trace with hash -28486685, now seen corresponding path program 2 times [2021-05-21 20:49:23,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:23,839 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740264951] [2021-05-21 20:49:23,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:23,894 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:23,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740264951] [2021-05-21 20:49:23,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740264951] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:23,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:23,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:49:23,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319053827] [2021-05-21 20:49:23,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:49:23,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:23,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:49:23,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:49:23,896 INFO L87 Difference]: Start difference. First operand 38 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:23,945 INFO L93 Difference]: Finished difference Result 75 states and 133 transitions. [2021-05-21 20:49:23,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:49:23,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-05-21 20:49:23,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:23,946 INFO L225 Difference]: With dead ends: 75 [2021-05-21 20:49:23,946 INFO L226 Difference]: Without dead ends: 68 [2021-05-21 20:49:23,947 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:49:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-21 20:49:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2021-05-21 20:49:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 75 transitions. [2021-05-21 20:49:23,952 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 75 transitions. Word has length 12 [2021-05-21 20:49:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:23,953 INFO L482 AbstractCegarLoop]: Abstraction has 39 states and 75 transitions. [2021-05-21 20:49:23,953 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 75 transitions. [2021-05-21 20:49:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-21 20:49:23,953 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:23,954 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:23,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-21 20:49:23,954 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:23,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:23,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1663097951, now seen corresponding path program 3 times [2021-05-21 20:49:23,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:23,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436643570] [2021-05-21 20:49:23,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:24,044 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:24,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436643570] [2021-05-21 20:49:24,044 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436643570] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:24,044 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:24,044 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:49:24,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414244969] [2021-05-21 20:49:24,045 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:49:24,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:24,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:49:24,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:49:24,046 INFO L87 Difference]: Start difference. First operand 39 states and 75 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:24,102 INFO L93 Difference]: Finished difference Result 63 states and 115 transitions. [2021-05-21 20:49:24,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:49:24,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-05-21 20:49:24,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:24,104 INFO L225 Difference]: With dead ends: 63 [2021-05-21 20:49:24,104 INFO L226 Difference]: Without dead ends: 56 [2021-05-21 20:49:24,105 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 43.2ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:49:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-05-21 20:49:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2021-05-21 20:49:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.95) internal successors, (78), 40 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 78 transitions. [2021-05-21 20:49:24,119 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 78 transitions. Word has length 12 [2021-05-21 20:49:24,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:24,120 INFO L482 AbstractCegarLoop]: Abstraction has 41 states and 78 transitions. [2021-05-21 20:49:24,120 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 78 transitions. [2021-05-21 20:49:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-21 20:49:24,124 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:24,124 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:24,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-21 20:49:24,127 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:24,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:24,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1716368849, now seen corresponding path program 4 times [2021-05-21 20:49:24,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:24,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948761834] [2021-05-21 20:49:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:24,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:24,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948761834] [2021-05-21 20:49:24,208 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948761834] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:24,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:24,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:49:24,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778723514] [2021-05-21 20:49:24,210 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:49:24,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:24,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:49:24,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:49:24,250 INFO L87 Difference]: Start difference. First operand 41 states and 78 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:24,306 INFO L93 Difference]: Finished difference Result 81 states and 146 transitions. [2021-05-21 20:49:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:49:24,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-05-21 20:49:24,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:24,309 INFO L225 Difference]: With dead ends: 81 [2021-05-21 20:49:24,309 INFO L226 Difference]: Without dead ends: 74 [2021-05-21 20:49:24,310 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 38.8ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:49:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-05-21 20:49:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 43. [2021-05-21 20:49:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 2.0238095238095237) internal successors, (85), 42 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 85 transitions. [2021-05-21 20:49:24,320 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 85 transitions. Word has length 12 [2021-05-21 20:49:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:24,320 INFO L482 AbstractCegarLoop]: Abstraction has 43 states and 85 transitions. [2021-05-21 20:49:24,320 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 85 transitions. [2021-05-21 20:49:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-21 20:49:24,324 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:24,324 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:24,324 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-21 20:49:24,324 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:24,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:24,325 INFO L82 PathProgramCache]: Analyzing trace with hash -887013811, now seen corresponding path program 5 times [2021-05-21 20:49:24,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:24,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622743724] [2021-05-21 20:49:24,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:24,400 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:24,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622743724] [2021-05-21 20:49:24,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622743724] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:24,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:24,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:49:24,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253712913] [2021-05-21 20:49:24,402 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:49:24,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:24,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:49:24,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:49:24,403 INFO L87 Difference]: Start difference. First operand 43 states and 85 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:24,457 INFO L93 Difference]: Finished difference Result 83 states and 148 transitions. [2021-05-21 20:49:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:49:24,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-05-21 20:49:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:24,459 INFO L225 Difference]: With dead ends: 83 [2021-05-21 20:49:24,459 INFO L226 Difference]: Without dead ends: 76 [2021-05-21 20:49:24,459 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:49:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-21 20:49:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 42. [2021-05-21 20:49:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.975609756097561) internal successors, (81), 41 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 81 transitions. [2021-05-21 20:49:24,470 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 81 transitions. Word has length 12 [2021-05-21 20:49:24,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:24,471 INFO L482 AbstractCegarLoop]: Abstraction has 42 states and 81 transitions. [2021-05-21 20:49:24,471 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 81 transitions. [2021-05-21 20:49:24,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-21 20:49:24,471 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:24,472 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:24,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-21 20:49:24,472 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:24,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:24,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1520341375, now seen corresponding path program 6 times [2021-05-21 20:49:24,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:24,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635852148] [2021-05-21 20:49:24,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:24,539 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:24,539 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635852148] [2021-05-21 20:49:24,539 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635852148] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:24,539 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:24,539 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-21 20:49:24,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199577351] [2021-05-21 20:49:24,540 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:49:24,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:24,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:49:24,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:49:24,541 INFO L87 Difference]: Start difference. First operand 42 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:24,591 INFO L93 Difference]: Finished difference Result 68 states and 124 transitions. [2021-05-21 20:49:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-21 20:49:24,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-05-21 20:49:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:24,592 INFO L225 Difference]: With dead ends: 68 [2021-05-21 20:49:24,592 INFO L226 Difference]: Without dead ends: 61 [2021-05-21 20:49:24,593 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 42.0ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-05-21 20:49:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-05-21 20:49:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2021-05-21 20:49:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 43 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 84 transitions. [2021-05-21 20:49:24,596 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 84 transitions. Word has length 12 [2021-05-21 20:49:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:24,596 INFO L482 AbstractCegarLoop]: Abstraction has 44 states and 84 transitions. [2021-05-21 20:49:24,596 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 84 transitions. [2021-05-21 20:49:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:24,596 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:24,597 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:24,597 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-21 20:49:24,597 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2043306169, now seen corresponding path program 1 times [2021-05-21 20:49:24,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:24,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720197761] [2021-05-21 20:49:24,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:24,649 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:24,650 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720197761] [2021-05-21 20:49:24,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720197761] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:24,650 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:24,650 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:49:24,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823853127] [2021-05-21 20:49:24,650 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:49:24,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:24,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:49:24,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:49:24,652 INFO L87 Difference]: Start difference. First operand 44 states and 84 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:24,698 INFO L93 Difference]: Finished difference Result 62 states and 113 transitions. [2021-05-21 20:49:24,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:24,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:24,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:24,700 INFO L225 Difference]: With dead ends: 62 [2021-05-21 20:49:24,700 INFO L226 Difference]: Without dead ends: 54 [2021-05-21 20:49:24,700 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:49:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-05-21 20:49:24,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2021-05-21 20:49:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 38 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 74 transitions. [2021-05-21 20:49:24,705 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 74 transitions. Word has length 13 [2021-05-21 20:49:24,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:24,705 INFO L482 AbstractCegarLoop]: Abstraction has 39 states and 74 transitions. [2021-05-21 20:49:24,706 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 74 transitions. [2021-05-21 20:49:24,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:24,707 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:24,707 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:24,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-21 20:49:24,708 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:24,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1561333194, now seen corresponding path program 1 times [2021-05-21 20:49:24,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:24,708 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077677325] [2021-05-21 20:49:24,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:24,755 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:24,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077677325] [2021-05-21 20:49:24,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077677325] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:49:24,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063343365] [2021-05-21 20:49:24,755 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-05-21 20:49:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:24,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-21 20:49:24,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 20:49:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:24,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063343365] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:49:24,901 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-21 20:49:24,901 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-05-21 20:49:24,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655063397] [2021-05-21 20:49:24,902 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-21 20:49:24,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:24,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-21 20:49:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-21 20:49:24,903 INFO L87 Difference]: Start difference. First operand 39 states and 74 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:24,943 INFO L93 Difference]: Finished difference Result 58 states and 109 transitions. [2021-05-21 20:49:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:24,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:24,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:24,944 INFO L225 Difference]: With dead ends: 58 [2021-05-21 20:49:24,945 INFO L226 Difference]: Without dead ends: 58 [2021-05-21 20:49:24,945 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 42.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:49:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-05-21 20:49:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2021-05-21 20:49:24,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 39 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 77 transitions. [2021-05-21 20:49:24,948 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 77 transitions. Word has length 13 [2021-05-21 20:49:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:24,948 INFO L482 AbstractCegarLoop]: Abstraction has 40 states and 77 transitions. [2021-05-21 20:49:24,948 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 77 transitions. [2021-05-21 20:49:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:24,949 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:24,949 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:25,173 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-05-21 20:49:25,174 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:25,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:25,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1719807367, now seen corresponding path program 2 times [2021-05-21 20:49:25,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:25,174 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802117780] [2021-05-21 20:49:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:25,235 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:25,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802117780] [2021-05-21 20:49:25,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802117780] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:25,235 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:25,235 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:49:25,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717287382] [2021-05-21 20:49:25,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:49:25,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:25,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:49:25,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:49:25,237 INFO L87 Difference]: Start difference. First operand 40 states and 77 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:25,277 INFO L93 Difference]: Finished difference Result 79 states and 142 transitions. [2021-05-21 20:49:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:25,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:25,278 INFO L225 Difference]: With dead ends: 79 [2021-05-21 20:49:25,278 INFO L226 Difference]: Without dead ends: 76 [2021-05-21 20:49:25,278 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:49:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-05-21 20:49:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 45. [2021-05-21 20:49:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.022727272727273) internal successors, (89), 44 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 89 transitions. [2021-05-21 20:49:25,280 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 89 transitions. Word has length 13 [2021-05-21 20:49:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:25,280 INFO L482 AbstractCegarLoop]: Abstraction has 45 states and 89 transitions. [2021-05-21 20:49:25,280 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 89 transitions. [2021-05-21 20:49:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:25,281 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:25,281 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:25,281 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-21 20:49:25,281 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:25,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1972962632, now seen corresponding path program 2 times [2021-05-21 20:49:25,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:25,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719549262] [2021-05-21 20:49:25,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:25,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:25,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719549262] [2021-05-21 20:49:25,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719549262] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:49:25,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442725240] [2021-05-21 20:49:25,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 20:49:25,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-21 20:49:25,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-21 20:49:25,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-21 20:49:25,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 20:49:25,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:25,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442725240] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:49:25,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-21 20:49:25,455 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-05-21 20:49:25,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520655330] [2021-05-21 20:49:25,456 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:49:25,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:25,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:49:25,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:49:25,457 INFO L87 Difference]: Start difference. First operand 45 states and 89 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:25,498 INFO L93 Difference]: Finished difference Result 69 states and 128 transitions. [2021-05-21 20:49:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:25,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:25,499 INFO L225 Difference]: With dead ends: 69 [2021-05-21 20:49:25,499 INFO L226 Difference]: Without dead ends: 69 [2021-05-21 20:49:25,499 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 58.3ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:49:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-05-21 20:49:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 45. [2021-05-21 20:49:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 2.022727272727273) internal successors, (89), 44 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 89 transitions. [2021-05-21 20:49:25,502 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 89 transitions. Word has length 13 [2021-05-21 20:49:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:25,502 INFO L482 AbstractCegarLoop]: Abstraction has 45 states and 89 transitions. [2021-05-21 20:49:25,502 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 89 transitions. [2021-05-21 20:49:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:25,502 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:25,503 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:25,724 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-05-21 20:49:25,725 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:25,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:25,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1874666941, now seen corresponding path program 3 times [2021-05-21 20:49:25,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:25,726 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019225351] [2021-05-21 20:49:25,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:25,772 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:25,773 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019225351] [2021-05-21 20:49:25,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019225351] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:25,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:25,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:49:25,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966625687] [2021-05-21 20:49:25,776 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:49:25,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:25,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:49:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:49:25,777 INFO L87 Difference]: Start difference. First operand 45 states and 89 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:25,828 INFO L93 Difference]: Finished difference Result 64 states and 121 transitions. [2021-05-21 20:49:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:25,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:25,829 INFO L225 Difference]: With dead ends: 64 [2021-05-21 20:49:25,829 INFO L226 Difference]: Without dead ends: 64 [2021-05-21 20:49:25,829 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:49:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-05-21 20:49:25,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2021-05-21 20:49:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 83 transitions. [2021-05-21 20:49:25,832 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 83 transitions. Word has length 13 [2021-05-21 20:49:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:25,832 INFO L482 AbstractCegarLoop]: Abstraction has 42 states and 83 transitions. [2021-05-21 20:49:25,832 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 83 transitions. [2021-05-21 20:49:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:25,833 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:25,833 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:25,833 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-21 20:49:25,833 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:25,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:25,834 INFO L82 PathProgramCache]: Analyzing trace with hash -108130304, now seen corresponding path program 3 times [2021-05-21 20:49:25,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:25,834 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803316828] [2021-05-21 20:49:25,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:25,865 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:25,866 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803316828] [2021-05-21 20:49:25,866 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803316828] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:25,866 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:25,866 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:49:25,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872293263] [2021-05-21 20:49:25,866 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:49:25,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:25,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:49:25,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:49:25,867 INFO L87 Difference]: Start difference. First operand 42 states and 83 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:25,908 INFO L93 Difference]: Finished difference Result 47 states and 89 transitions. [2021-05-21 20:49:25,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:25,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:25,909 INFO L225 Difference]: With dead ends: 47 [2021-05-21 20:49:25,909 INFO L226 Difference]: Without dead ends: 45 [2021-05-21 20:49:25,910 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:49:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-05-21 20:49:25,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2021-05-21 20:49:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 2.0) internal successors, (82), 41 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 82 transitions. [2021-05-21 20:49:25,912 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 82 transitions. Word has length 13 [2021-05-21 20:49:25,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:25,913 INFO L482 AbstractCegarLoop]: Abstraction has 42 states and 82 transitions. [2021-05-21 20:49:25,913 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 82 transitions. [2021-05-21 20:49:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:25,913 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:25,913 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:25,913 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-21 20:49:25,913 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:25,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:25,915 INFO L82 PathProgramCache]: Analyzing trace with hash 831106635, now seen corresponding path program 4 times [2021-05-21 20:49:25,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:25,915 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130871877] [2021-05-21 20:49:25,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:25,951 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:25,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130871877] [2021-05-21 20:49:25,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130871877] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:25,952 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:25,952 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:49:25,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673370900] [2021-05-21 20:49:25,952 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:49:25,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:25,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:49:25,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:49:25,953 INFO L87 Difference]: Start difference. First operand 42 states and 82 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:25,996 INFO L93 Difference]: Finished difference Result 62 states and 111 transitions. [2021-05-21 20:49:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:25,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:25,998 INFO L225 Difference]: With dead ends: 62 [2021-05-21 20:49:25,998 INFO L226 Difference]: Without dead ends: 59 [2021-05-21 20:49:25,998 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:49:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-05-21 20:49:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2021-05-21 20:49:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.0) internal successors, (90), 45 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2021-05-21 20:49:26,002 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 13 [2021-05-21 20:49:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:26,002 INFO L482 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2021-05-21 20:49:26,002 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2021-05-21 20:49:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:26,003 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:26,003 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:26,003 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-21 20:49:26,003 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:26,004 INFO L82 PathProgramCache]: Analyzing trace with hash 577951370, now seen corresponding path program 4 times [2021-05-21 20:49:26,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:26,004 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87464370] [2021-05-21 20:49:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:26,036 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:26,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87464370] [2021-05-21 20:49:26,037 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87464370] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:49:26,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925261358] [2021-05-21 20:49:26,037 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 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-05-21 20:49:26,070 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-21 20:49:26,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-21 20:49:26,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-21 20:49:26,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 20:49:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:26,151 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925261358] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:49:26,151 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-21 20:49:26,151 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-05-21 20:49:26,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224356387] [2021-05-21 20:49:26,152 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-21 20:49:26,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:26,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-21 20:49:26,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:49:26,152 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:26,191 INFO L93 Difference]: Finished difference Result 63 states and 116 transitions. [2021-05-21 20:49:26,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:26,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:26,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:26,192 INFO L225 Difference]: With dead ends: 63 [2021-05-21 20:49:26,192 INFO L226 Difference]: Without dead ends: 63 [2021-05-21 20:49:26,192 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 46.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-05-21 20:49:26,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-21 20:49:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2021-05-21 20:49:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.0) internal successors, (90), 45 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2021-05-21 20:49:26,194 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 13 [2021-05-21 20:49:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:26,194 INFO L482 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2021-05-21 20:49:26,194 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,195 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2021-05-21 20:49:26,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:26,195 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:26,195 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:26,408 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-05-21 20:49:26,409 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:26,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash 130613647, now seen corresponding path program 5 times [2021-05-21 20:49:26,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:26,410 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642527508] [2021-05-21 20:49:26,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:26,434 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:26,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642527508] [2021-05-21 20:49:26,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642527508] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:26,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:26,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:49:26,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965332952] [2021-05-21 20:49:26,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:49:26,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:49:26,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:49:26,436 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:26,475 INFO L93 Difference]: Finished difference Result 62 states and 114 transitions. [2021-05-21 20:49:26,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:26,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:26,476 INFO L225 Difference]: With dead ends: 62 [2021-05-21 20:49:26,476 INFO L226 Difference]: Without dead ends: 62 [2021-05-21 20:49:26,477 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:49:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-05-21 20:49:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2021-05-21 20:49:26,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.0) internal successors, (90), 45 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 90 transitions. [2021-05-21 20:49:26,479 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 90 transitions. Word has length 13 [2021-05-21 20:49:26,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:26,479 INFO L482 AbstractCegarLoop]: Abstraction has 46 states and 90 transitions. [2021-05-21 20:49:26,479 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 90 transitions. [2021-05-21 20:49:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:26,479 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:26,479 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:26,479 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-21 20:49:26,480 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:26,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:26,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1852183598, now seen corresponding path program 5 times [2021-05-21 20:49:26,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:26,480 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603609812] [2021-05-21 20:49:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:26,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:26,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603609812] [2021-05-21 20:49:26,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603609812] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:26,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:26,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:49:26,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355535827] [2021-05-21 20:49:26,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:49:26,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:26,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:49:26,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:49:26,506 INFO L87 Difference]: Start difference. First operand 46 states and 90 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:26,544 INFO L93 Difference]: Finished difference Result 65 states and 117 transitions. [2021-05-21 20:49:26,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:26,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:26,545 INFO L225 Difference]: With dead ends: 65 [2021-05-21 20:49:26,545 INFO L226 Difference]: Without dead ends: 63 [2021-05-21 20:49:26,545 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:49:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-05-21 20:49:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2021-05-21 20:49:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 44 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 87 transitions. [2021-05-21 20:49:26,547 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 87 transitions. Word has length 13 [2021-05-21 20:49:26,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:26,547 INFO L482 AbstractCegarLoop]: Abstraction has 45 states and 87 transitions. [2021-05-21 20:49:26,547 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 87 transitions. [2021-05-21 20:49:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:26,548 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:26,548 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:26,548 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-05-21 20:49:26,548 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:26,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:26,548 INFO L82 PathProgramCache]: Analyzing trace with hash 133239423, now seen corresponding path program 6 times [2021-05-21 20:49:26,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:26,549 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880140562] [2021-05-21 20:49:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:26,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:26,572 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:26,572 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880140562] [2021-05-21 20:49:26,572 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880140562] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:26,572 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:26,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:49:26,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005157831] [2021-05-21 20:49:26,573 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:49:26,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:26,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:49:26,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:49:26,573 INFO L87 Difference]: Start difference. First operand 45 states and 87 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:26,612 INFO L93 Difference]: Finished difference Result 60 states and 108 transitions. [2021-05-21 20:49:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:26,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:26,617 INFO L225 Difference]: With dead ends: 60 [2021-05-21 20:49:26,617 INFO L226 Difference]: Without dead ends: 60 [2021-05-21 20:49:26,617 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:49:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-05-21 20:49:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2021-05-21 20:49:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9736842105263157) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 75 transitions. [2021-05-21 20:49:26,620 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 75 transitions. Word has length 13 [2021-05-21 20:49:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:26,620 INFO L482 AbstractCegarLoop]: Abstraction has 39 states and 75 transitions. [2021-05-21 20:49:26,620 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 75 transitions. [2021-05-21 20:49:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-21 20:49:26,623 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:26,623 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:26,623 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-05-21 20:49:26,623 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:26,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash -238616864, now seen corresponding path program 6 times [2021-05-21 20:49:26,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:26,624 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834170175] [2021-05-21 20:49:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:26,656 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:26,656 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834170175] [2021-05-21 20:49:26,656 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834170175] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 20:49:26,656 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 20:49:26,656 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-21 20:49:26,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256553804] [2021-05-21 20:49:26,657 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-21 20:49:26,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 20:49:26,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-21 20:49:26,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-21 20:49:26,657 INFO L87 Difference]: Start difference. First operand 39 states and 75 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 20:49:26,691 INFO L93 Difference]: Finished difference Result 43 states and 79 transitions. [2021-05-21 20:49:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-21 20:49:26,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-05-21 20:49:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 20:49:26,692 INFO L225 Difference]: With dead ends: 43 [2021-05-21 20:49:26,692 INFO L226 Difference]: Without dead ends: 39 [2021-05-21 20:49:26,692 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-05-21 20:49:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-05-21 20:49:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-05-21 20:49:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 38 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 74 transitions. [2021-05-21 20:49:26,695 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 74 transitions. Word has length 13 [2021-05-21 20:49:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 20:49:26,695 INFO L482 AbstractCegarLoop]: Abstraction has 39 states and 74 transitions. [2021-05-21 20:49:26,695 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 20:49:26,695 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 74 transitions. [2021-05-21 20:49:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-21 20:49:26,696 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 20:49:26,696 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 20:49:26,696 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-05-21 20:49:26,696 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 20:49:26,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 20:49:26,697 INFO L82 PathProgramCache]: Analyzing trace with hash 319968626, now seen corresponding path program 1 times [2021-05-21 20:49:26,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 20:49:26,697 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851131521] [2021-05-21 20:49:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 20:49:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-21 20:49:26,907 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 20:49:26,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851131521] [2021-05-21 20:49:26,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851131521] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-21 20:49:26,907 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658738775] [2021-05-21 20:49:26,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-05-21 20:49:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 20:49:26,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 17 conjunts are in the unsatisfiable core [2021-05-21 20:49:26,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-21 20:49:27,028 WARN L348 FreeRefinementEngine]: Global settings require throwing the following exception [2021-05-21 20:49:27,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-21 20:49:27,252 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.EqualityInformation.getEqinfo(EqualityInformation.java:130) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.XnfDer.derSimple(XnfDer.java:308) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.XnfDer.tryToEliminate_EqInfoBased(XnfDer.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.XnfDer.tryToEliminate(XnfDer.java:101) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:100) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:374) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:63) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-05-21 20:49:27,254 INFO L168 Benchmark]: Toolchain (without parser) took 4683.34 ms. Allocated memory is still 337.6 MB. Free memory was 317.5 MB in the beginning and 198.9 MB in the end (delta: 118.5 MB). Peak memory consumption was 121.1 MB. Max. memory is 16.0 GB. [2021-05-21 20:49:27,254 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 337.6 MB. Free memory was 318.8 MB in the beginning and 318.7 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 20:49:27,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.98 ms. Allocated memory is still 337.6 MB. Free memory was 317.4 MB in the beginning and 315.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-05-21 20:49:27,254 INFO L168 Benchmark]: Boogie Preprocessor took 23.41 ms. Allocated memory is still 337.6 MB. Free memory was 315.9 MB in the beginning and 314.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 20:49:27,254 INFO L168 Benchmark]: RCFGBuilder took 430.35 ms. Allocated memory is still 337.6 MB. Free memory was 314.8 MB in the beginning and 322.1 MB in the end (delta: -7.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. [2021-05-21 20:49:27,254 INFO L168 Benchmark]: TraceAbstraction took 4185.77 ms. Allocated memory is still 337.6 MB. Free memory was 322.1 MB in the beginning and 198.9 MB in the end (delta: 123.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 16.0 GB. [2021-05-21 20:49:27,255 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.16 ms. Allocated memory is still 337.6 MB. Free memory was 318.8 MB in the beginning and 318.7 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 25.98 ms. Allocated memory is still 337.6 MB. Free memory was 317.4 MB in the beginning and 315.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 23.41 ms. Allocated memory is still 337.6 MB. Free memory was 315.9 MB in the beginning and 314.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 430.35 ms. Allocated memory is still 337.6 MB. Free memory was 314.8 MB in the beginning and 322.1 MB in the end (delta: -7.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 4185.77 ms. Allocated memory is still 337.6 MB. Free memory was 322.1 MB in the beginning and 198.9 MB in the end (delta: 123.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.EqualityInformation.getEqinfo(EqualityInformation.java:130) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...