/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/bench/exp2x9.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 21:40:26,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 21:40:26,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 21:40:26,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 21:40:26,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 21:40:26,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 21:40:26,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 21:40:26,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 21:40:26,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 21:40:26,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 21:40:26,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 21:40:26,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 21:40:26,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 21:40:26,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 21:40:26,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 21:40:26,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 21:40:26,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 21:40:26,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 21:40:26,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 21:40:26,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 21:40:26,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 21:40:26,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 21:40:26,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 21:40:26,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 21:40:26,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 21:40:26,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 21:40:26,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 21:40:26,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 21:40:26,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 21:40:26,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 21:40:26,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 21:40:26,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 21:40:26,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 21:40:26,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 21:40:26,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 21:40:26,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 21:40:26,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 21:40:26,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 21:40:26,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 21:40:26,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 21:40:26,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 21:40:26,595 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-03-10 21:40:26,635 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 21:40:26,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 21:40:26,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 21:40:26,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 21:40:26,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 21:40:26,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 21:40:26,640 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 21:40:26,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 21:40:26,640 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 21:40:26,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 21:40:26,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 21:40:26,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 21:40:26,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 21:40:26,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 21:40:26,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 21:40:26,642 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 21:40:26,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 21:40:26,642 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 21:40:26,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 21:40:26,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 21:40:26,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 21:40:26,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 21:40:26,643 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 21:40:26,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 21:40:26,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 21:40:26,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 21:40:26,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 21:40:26,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 21:40:26,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 21:40:26,644 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 21:40:26,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 21:40:26,644 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-03-10 21:40:26,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 21:40:26,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 21:40:26,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 21:40:26,986 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-10 21:40:26,987 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-10 21:40:26,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x9.wvr.bpl [2021-03-10 21:40:26,988 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/bench/exp2x9.wvr.bpl' [2021-03-10 21:40:27,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 21:40:27,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-10 21:40:27,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 21:40:27,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 21:40:27,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 21:40:27,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:27" (1/1) ... [2021-03-10 21:40:27,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:27" (1/1) ... [2021-03-10 21:40:27,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 21:40:27,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 21:40:27,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 21:40:27,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 21:40:27,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:27" (1/1) ... [2021-03-10 21:40:27,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:27" (1/1) ... [2021-03-10 21:40:27,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:27" (1/1) ... [2021-03-10 21:40:27,069 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:27" (1/1) ... [2021-03-10 21:40:27,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:27" (1/1) ... [2021-03-10 21:40:27,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:27" (1/1) ... [2021-03-10 21:40:27,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:27" (1/1) ... [2021-03-10 21:40:27,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 21:40:27,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 21:40:27,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 21:40:27,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 21:40:27,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:27" (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-03-10 21:40:27,143 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-10 21:40:27,143 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-10 21:40:27,143 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-10 21:40:27,144 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-10 21:40:27,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-10 21:40:27,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-10 21:40:27,144 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-10 21:40:27,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 21:40:27,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 21:40:27,144 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-10 21:40:27,144 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-10 21:40:27,145 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-10 21:40:27,145 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-03-10 21:40:27,145 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-03-10 21:40:27,145 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-03-10 21:40:27,146 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-10 21:40:27,394 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 21:40:27,394 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-10 21:40:27,395 INFO L202 PluginConnector]: Adding new model exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 09:40:27 BoogieIcfgContainer [2021-03-10 21:40:27,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 21:40:27,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 21:40:27,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 21:40:27,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 21:40:27,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 09:40:27" (1/2) ... [2021-03-10 21:40:27,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd24580 and model type exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 09:40:27, skipping insertion in model container [2021-03-10 21:40:27,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "exp2x9.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 09:40:27" (2/2) ... [2021-03-10 21:40:27,402 INFO L111 eAbstractionObserver]: Analyzing ICFG exp2x9.wvr.bpl [2021-03-10 21:40:27,407 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 21:40:27,407 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 21:40:27,411 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-10 21:40:27,412 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 21:40:27,455 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-03-10 21:40:27,471 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-10 21:40:27,505 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 21:40:27,505 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 21:40:27,505 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 21:40:27,506 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 21:40:27,506 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 21:40:27,506 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 21:40:27,506 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 21:40:27,506 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 21:40:27,516 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 57 transitions, 146 flow [2021-03-10 21:40:28,808 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12227 states, 12225 states have (on average 3.979304703476483) internal successors, (48647), 12226 states have internal predecessors, (48647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand has 12227 states, 12225 states have (on average 3.979304703476483) internal successors, (48647), 12226 states have internal predecessors, (48647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:28,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-10 21:40:28,986 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:28,987 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:40:28,987 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:28,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1273756842, now seen corresponding path program 1 times [2021-03-10 21:40:29,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:29,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545574673] [2021-03-10 21:40:29,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:29,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545574673] [2021-03-10 21:40:29,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:29,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-10 21:40:29,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370278257] [2021-03-10 21:40:29,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-10 21:40:29,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:29,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-10 21:40:29,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 21:40:29,285 INFO L87 Difference]: Start difference. First operand has 12227 states, 12225 states have (on average 3.979304703476483) internal successors, (48647), 12226 states have internal predecessors, (48647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:29,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:29,610 INFO L93 Difference]: Finished difference Result 12650 states and 50294 transitions. [2021-03-10 21:40:29,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-10 21:40:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-03-10 21:40:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:29,847 INFO L225 Difference]: With dead ends: 12650 [2021-03-10 21:40:29,847 INFO L226 Difference]: Without dead ends: 12619 [2021-03-10 21:40:29,848 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 21:40:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12619 states. [2021-03-10 21:40:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12619 to 12354. [2021-03-10 21:40:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12354 states, 12353 states have (on average 3.977900105237594) internal successors, (49139), 12353 states have internal predecessors, (49139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12354 states to 12354 states and 49139 transitions. [2021-03-10 21:40:30,832 INFO L78 Accepts]: Start accepts. Automaton has 12354 states and 49139 transitions. Word has length 19 [2021-03-10 21:40:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:30,834 INFO L480 AbstractCegarLoop]: Abstraction has 12354 states and 49139 transitions. [2021-03-10 21:40:30,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 12354 states and 49139 transitions. [2021-03-10 21:40:30,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-03-10 21:40:30,887 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:30,887 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:40:30,887 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 21:40:30,888 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:30,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:30,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2073926619, now seen corresponding path program 1 times [2021-03-10 21:40:30,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:30,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514307065] [2021-03-10 21:40:30,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:30,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514307065] [2021-03-10 21:40:30,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:30,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-10 21:40:30,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723548584] [2021-03-10 21:40:30,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-10 21:40:30,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:30,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-10 21:40:30,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:30,945 INFO L87 Difference]: Start difference. First operand 12354 states and 49139 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:31,393 INFO L93 Difference]: Finished difference Result 19078 states and 74406 transitions. [2021-03-10 21:40:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:31,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-03-10 21:40:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:31,501 INFO L225 Difference]: With dead ends: 19078 [2021-03-10 21:40:31,501 INFO L226 Difference]: Without dead ends: 19078 [2021-03-10 21:40:31,502 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2021-03-10 21:40:32,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 13678. [2021-03-10 21:40:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13678 states, 13677 states have (on average 3.9960517657381005) internal successors, (54654), 13677 states have internal predecessors, (54654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13678 states to 13678 states and 54654 transitions. [2021-03-10 21:40:32,485 INFO L78 Accepts]: Start accepts. Automaton has 13678 states and 54654 transitions. Word has length 27 [2021-03-10 21:40:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:32,485 INFO L480 AbstractCegarLoop]: Abstraction has 13678 states and 54654 transitions. [2021-03-10 21:40:32,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:32,485 INFO L276 IsEmpty]: Start isEmpty. Operand 13678 states and 54654 transitions. [2021-03-10 21:40:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-03-10 21:40:32,537 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:32,537 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:40:32,538 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-10 21:40:32,538 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:32,540 INFO L82 PathProgramCache]: Analyzing trace with hash -247820921, now seen corresponding path program 1 times [2021-03-10 21:40:32,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:32,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291524194] [2021-03-10 21:40:32,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:32,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291524194] [2021-03-10 21:40:32,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:32,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 21:40:32,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794015593] [2021-03-10 21:40:32,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:32,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:32,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:32,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:32,607 INFO L87 Difference]: Start difference. First operand 13678 states and 54654 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:32,960 INFO L93 Difference]: Finished difference Result 19792 states and 77741 transitions. [2021-03-10 21:40:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:32,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-03-10 21:40:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:33,084 INFO L225 Difference]: With dead ends: 19792 [2021-03-10 21:40:33,085 INFO L226 Difference]: Without dead ends: 19792 [2021-03-10 21:40:33,085 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19792 states. [2021-03-10 21:40:33,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19792 to 15127. [2021-03-10 21:40:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15127 states, 15126 states have (on average 4.021750628057649) internal successors, (60833), 15126 states have internal predecessors, (60833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:33,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15127 states to 15127 states and 60833 transitions. [2021-03-10 21:40:33,949 INFO L78 Accepts]: Start accepts. Automaton has 15127 states and 60833 transitions. Word has length 27 [2021-03-10 21:40:33,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:33,949 INFO L480 AbstractCegarLoop]: Abstraction has 15127 states and 60833 transitions. [2021-03-10 21:40:33,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 15127 states and 60833 transitions. [2021-03-10 21:40:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-03-10 21:40:33,994 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:33,994 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:40:33,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 21:40:33,994 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:33,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1511295755, now seen corresponding path program 1 times [2021-03-10 21:40:33,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:33,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541921602] [2021-03-10 21:40:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:34,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541921602] [2021-03-10 21:40:34,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:34,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 21:40:34,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205680017] [2021-03-10 21:40:34,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:34,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:34,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:34,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:34,044 INFO L87 Difference]: Start difference. First operand 15127 states and 60833 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:34,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:34,202 INFO L93 Difference]: Finished difference Result 16794 states and 66463 transitions. [2021-03-10 21:40:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-10 21:40:34,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-03-10 21:40:34,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:34,429 INFO L225 Difference]: With dead ends: 16794 [2021-03-10 21:40:34,429 INFO L226 Difference]: Without dead ends: 16774 [2021-03-10 21:40:34,429 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:34,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16774 states. [2021-03-10 21:40:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16774 to 15695. [2021-03-10 21:40:35,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15695 states, 15694 states have (on average 4.002867337836116) internal successors, (62821), 15694 states have internal predecessors, (62821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:35,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15695 states to 15695 states and 62821 transitions. [2021-03-10 21:40:35,273 INFO L78 Accepts]: Start accepts. Automaton has 15695 states and 62821 transitions. Word has length 27 [2021-03-10 21:40:35,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:35,274 INFO L480 AbstractCegarLoop]: Abstraction has 15695 states and 62821 transitions. [2021-03-10 21:40:35,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 15695 states and 62821 transitions. [2021-03-10 21:40:35,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-03-10 21:40:35,309 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:35,310 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:40:35,310 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-10 21:40:35,310 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1596363793, now seen corresponding path program 1 times [2021-03-10 21:40:35,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:35,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390156926] [2021-03-10 21:40:35,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:35,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390156926] [2021-03-10 21:40:35,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:35,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 21:40:35,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443648499] [2021-03-10 21:40:35,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:35,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:35,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:35,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:35,338 INFO L87 Difference]: Start difference. First operand 15695 states and 62821 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:35,520 INFO L93 Difference]: Finished difference Result 17936 states and 70972 transitions. [2021-03-10 21:40:35,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:35,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-03-10 21:40:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:35,570 INFO L225 Difference]: With dead ends: 17936 [2021-03-10 21:40:35,570 INFO L226 Difference]: Without dead ends: 17912 [2021-03-10 21:40:35,571 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17912 states. [2021-03-10 21:40:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17912 to 15939. [2021-03-10 21:40:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15939 states, 15938 states have (on average 3.9939139164261515) internal successors, (63655), 15938 states have internal predecessors, (63655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15939 states to 15939 states and 63655 transitions. [2021-03-10 21:40:36,517 INFO L78 Accepts]: Start accepts. Automaton has 15939 states and 63655 transitions. Word has length 27 [2021-03-10 21:40:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:36,518 INFO L480 AbstractCegarLoop]: Abstraction has 15939 states and 63655 transitions. [2021-03-10 21:40:36,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 15939 states and 63655 transitions. [2021-03-10 21:40:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-03-10 21:40:36,546 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:36,547 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:40:36,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 21:40:36,547 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:36,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1792363413, now seen corresponding path program 2 times [2021-03-10 21:40:36,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:36,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476204707] [2021-03-10 21:40:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:36,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476204707] [2021-03-10 21:40:36,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:36,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 21:40:36,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281417929] [2021-03-10 21:40:36,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:36,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:36,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:36,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:36,592 INFO L87 Difference]: Start difference. First operand 15939 states and 63655 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:36,761 INFO L93 Difference]: Finished difference Result 18937 states and 75002 transitions. [2021-03-10 21:40:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:36,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-03-10 21:40:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:36,819 INFO L225 Difference]: With dead ends: 18937 [2021-03-10 21:40:36,819 INFO L226 Difference]: Without dead ends: 18937 [2021-03-10 21:40:36,819 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18937 states. [2021-03-10 21:40:37,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18937 to 17401. [2021-03-10 21:40:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17401 states, 17400 states have (on average 3.990229885057471) internal successors, (69430), 17400 states have internal predecessors, (69430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:37,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17401 states to 17401 states and 69430 transitions. [2021-03-10 21:40:37,570 INFO L78 Accepts]: Start accepts. Automaton has 17401 states and 69430 transitions. Word has length 27 [2021-03-10 21:40:37,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:37,570 INFO L480 AbstractCegarLoop]: Abstraction has 17401 states and 69430 transitions. [2021-03-10 21:40:37,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:37,570 INFO L276 IsEmpty]: Start isEmpty. Operand 17401 states and 69430 transitions. [2021-03-10 21:40:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-03-10 21:40:37,604 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:37,605 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:40:37,605 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 21:40:37,605 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:37,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:37,605 INFO L82 PathProgramCache]: Analyzing trace with hash -156654911, now seen corresponding path program 2 times [2021-03-10 21:40:37,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:37,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693677055] [2021-03-10 21:40:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:37,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693677055] [2021-03-10 21:40:37,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:37,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 21:40:37,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109928699] [2021-03-10 21:40:37,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-10 21:40:37,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:37,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-10 21:40:37,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-10 21:40:37,631 INFO L87 Difference]: Start difference. First operand 17401 states and 69430 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:37,970 INFO L93 Difference]: Finished difference Result 18936 states and 74728 transitions. [2021-03-10 21:40:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:37,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-03-10 21:40:37,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:38,020 INFO L225 Difference]: With dead ends: 18936 [2021-03-10 21:40:38,020 INFO L226 Difference]: Without dead ends: 18895 [2021-03-10 21:40:38,021 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18895 states. [2021-03-10 21:40:38,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18895 to 17646. [2021-03-10 21:40:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17646 states, 17645 states have (on average 3.9815245111929727) internal successors, (70254), 17645 states have internal predecessors, (70254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17646 states to 17646 states and 70254 transitions. [2021-03-10 21:40:38,751 INFO L78 Accepts]: Start accepts. Automaton has 17646 states and 70254 transitions. Word has length 27 [2021-03-10 21:40:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:38,752 INFO L480 AbstractCegarLoop]: Abstraction has 17646 states and 70254 transitions. [2021-03-10 21:40:38,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17646 states and 70254 transitions. [2021-03-10 21:40:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-03-10 21:40:38,782 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:38,782 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:40:38,782 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 21:40:38,782 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:38,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:38,783 INFO L82 PathProgramCache]: Analyzing trace with hash -19520629, now seen corresponding path program 2 times [2021-03-10 21:40:38,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:38,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439375476] [2021-03-10 21:40:38,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:38,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439375476] [2021-03-10 21:40:38,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 21:40:38,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-10 21:40:38,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557402917] [2021-03-10 21:40:38,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-10 21:40:38,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 21:40:38,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-10 21:40:38,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:38,837 INFO L87 Difference]: Start difference. First operand 17646 states and 70254 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 21:40:38,985 INFO L93 Difference]: Finished difference Result 20333 states and 80199 transitions. [2021-03-10 21:40:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-10 21:40:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-03-10 21:40:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 21:40:39,040 INFO L225 Difference]: With dead ends: 20333 [2021-03-10 21:40:39,040 INFO L226 Difference]: Without dead ends: 20333 [2021-03-10 21:40:39,041 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-10 21:40:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20333 states. [2021-03-10 21:40:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20333 to 19021. [2021-03-10 21:40:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19021 states, 19020 states have (on average 3.982492113564669) internal successors, (75747), 19020 states have internal predecessors, (75747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19021 states to 19021 states and 75747 transitions. [2021-03-10 21:40:39,787 INFO L78 Accepts]: Start accepts. Automaton has 19021 states and 75747 transitions. Word has length 27 [2021-03-10 21:40:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 21:40:39,787 INFO L480 AbstractCegarLoop]: Abstraction has 19021 states and 75747 transitions. [2021-03-10 21:40:39,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 21:40:39,787 INFO L276 IsEmpty]: Start isEmpty. Operand 19021 states and 75747 transitions. [2021-03-10 21:40:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-03-10 21:40:39,832 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 21:40:39,832 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 21:40:39,832 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 21:40:39,833 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 21:40:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 21:40:39,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1299886574, now seen corresponding path program 1 times [2021-03-10 21:40:39,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 21:40:39,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698571112] [2021-03-10 21:40:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 21:40:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:40,154 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2021-03-10 21:40:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 21:40:40,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698571112] [2021-03-10 21:40:40,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472150795] [2021-03-10 21:40:40,173 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-03-10 21:40:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 21:40:40,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 33 conjunts are in the unsatisfiable core [2021-03-10 21:40:40,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-10 21:40:41,298 WARN L340 FreeRefinementEngine]: Global settings require throwing the following exception [2021-03-10 21:40:41,511 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-03-10 21:40:41,512 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Possible infinite loop detected aux_div_aux_div_x1_10_133 already exists at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:585) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:573) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:573) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:76) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:451) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:212) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:585) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:573) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:76) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:451) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:408) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:312) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:328) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.access$1(DualJunctionDer.java:323) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:231) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:149) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminate(DualJunctionDer.java:127) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:862) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:828) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:746) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:383) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:315) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.convert(QuantifierPusher.java:227) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.eliminate(QuantifierPusher.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.eliminate(QuantifierPusher.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$LiveVariablesPostprocessorForward.postprocess(TraceCheckSpWp.java:539) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) 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:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) 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.iterateAllErrorsAtOnce(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:131) 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-03-10 21:40:41,515 INFO L168 Benchmark]: Toolchain (without parser) took 14485.17 ms. Allocated memory was 255.9 MB in the beginning and 10.7 GB in the end (delta: 10.4 GB). Free memory was 236.5 MB in the beginning and 10.3 GB in the end (delta: -10.0 GB). Peak memory consumption was 376.1 MB. Max. memory is 16.0 GB. [2021-03-10 21:40:41,515 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.6 MB in the end (delta: 165.7 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 21:40:41,515 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.95 ms. Allocated memory is still 255.9 MB. Free memory was 236.1 MB in the beginning and 234.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 21:40:41,515 INFO L168 Benchmark]: Boogie Preprocessor took 23.43 ms. Allocated memory is still 255.9 MB. Free memory was 234.6 MB in the beginning and 233.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 21:40:41,516 INFO L168 Benchmark]: RCFGBuilder took 312.18 ms. Allocated memory is still 255.9 MB. Free memory was 233.4 MB in the beginning and 233.5 MB in the end (delta: -103.4 kB). Peak memory consumption was 16.1 MB. Max. memory is 16.0 GB. [2021-03-10 21:40:41,516 INFO L168 Benchmark]: TraceAbstraction took 14117.27 ms. Allocated memory was 255.9 MB in the beginning and 10.7 GB in the end (delta: 10.4 GB). Free memory was 232.8 MB in the beginning and 10.3 GB in the end (delta: -10.0 GB). Peak memory consumption was 370.5 MB. Max. memory is 16.0 GB. [2021-03-10 21:40:41,518 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.18 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.6 MB in the end (delta: 165.7 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 24.95 ms. Allocated memory is still 255.9 MB. Free memory was 236.1 MB in the beginning and 234.6 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.43 ms. Allocated memory is still 255.9 MB. Free memory was 234.6 MB in the beginning and 233.5 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 312.18 ms. Allocated memory is still 255.9 MB. Free memory was 233.4 MB in the beginning and 233.5 MB in the end (delta: -103.4 kB). Peak memory consumption was 16.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14117.27 ms. Allocated memory was 255.9 MB in the beginning and 10.7 GB in the end (delta: 10.4 GB). Free memory was 232.8 MB in the beginning and 10.3 GB in the end (delta: -10.0 GB). Peak memory consumption was 370.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Possible infinite loop detected aux_div_aux_div_x1_10_133 already exists de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Possible infinite loop detected aux_div_aux_div_x1_10_133 already exists: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:198) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...