/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/fork_loop_noop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-770125f [2021-05-21 19:55:32,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-21 19:55:32,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-21 19:55:32,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-21 19:55:32,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-21 19:55:32,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-21 19:55:32,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-21 19:55:32,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-21 19:55:32,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-21 19:55:32,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-21 19:55:32,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-21 19:55:32,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-21 19:55:32,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-21 19:55:32,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-21 19:55:32,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-21 19:55:32,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-21 19:55:32,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-21 19:55:32,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-21 19:55:32,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-21 19:55:32,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-21 19:55:32,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-21 19:55:32,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-21 19:55:32,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-21 19:55:32,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-21 19:55:32,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-21 19:55:32,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-21 19:55:32,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-21 19:55:32,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-21 19:55:32,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-21 19:55:32,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-21 19:55:32,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-21 19:55:32,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-21 19:55:32,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-21 19:55:32,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-21 19:55:32,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-21 19:55:32,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-21 19:55:32,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-21 19:55:32,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-21 19:55:32,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-21 19:55:32,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-21 19:55:32,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-21 19:55:32,760 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 19:55:32,796 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-21 19:55:32,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-21 19:55:32,797 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-05-21 19:55:32,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-05-21 19:55:32,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-21 19:55:32,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-21 19:55:32,800 INFO L138 SettingsManager]: * Use SBE=true [2021-05-21 19:55:32,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-21 19:55:32,800 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-21 19:55:32,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-21 19:55:32,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-21 19:55:32,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-21 19:55:32,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-21 19:55:32,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-21 19:55:32,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-21 19:55:32,802 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-21 19:55:32,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-21 19:55:32,802 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-21 19:55:32,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-21 19:55:32,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-21 19:55:32,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-21 19:55:32,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-21 19:55:32,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-21 19:55:32,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-21 19:55:32,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-21 19:55:32,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-21 19:55:32,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-21 19:55:32,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-21 19:55:32,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-21 19:55:32,803 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-05-21 19:55:32,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-21 19:55:32,803 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 19:55:33,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-21 19:55:33,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-21 19:55:33,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-21 19:55:33,140 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-05-21 19:55:33,141 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-05-21 19:55:33,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_noop.bpl [2021-05-21 19:55:33,142 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_noop.bpl' [2021-05-21 19:55:33,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-21 19:55:33,170 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-21 19:55:33,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-05-21 19:55:33,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-05-21 19:55:33,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-05-21 19:55:33,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 07:55:33" (1/1) ... [2021-05-21 19:55:33,190 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 07:55:33" (1/1) ... [2021-05-21 19:55:33,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-05-21 19:55:33,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-21 19:55:33,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-21 19:55:33,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-21 19:55:33,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 07:55:33" (1/1) ... [2021-05-21 19:55:33,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 07:55:33" (1/1) ... [2021-05-21 19:55:33,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 07:55:33" (1/1) ... [2021-05-21 19:55:33,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 07:55:33" (1/1) ... [2021-05-21 19:55:33,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 07:55:33" (1/1) ... [2021-05-21 19:55:33,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 07:55:33" (1/1) ... [2021-05-21 19:55:33,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 07:55:33" (1/1) ... [2021-05-21 19:55:33,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-21 19:55:33,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-21 19:55:33,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-21 19:55:33,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-21 19:55:33,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 07:55:33" (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 19:55:33,297 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-05-21 19:55:33,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-21 19:55:33,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-21 19:55:33,298 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2021-05-21 19:55:33,298 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2021-05-21 19:55:33,298 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2021-05-21 19:55:33,299 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 19:55:33,408 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-21 19:55:33,409 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-21 19:55:33,410 INFO L202 PluginConnector]: Adding new model fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 07:55:33 BoogieIcfgContainer [2021-05-21 19:55:33,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-21 19:55:33,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-21 19:55:33,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-21 19:55:33,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-21 19:55:33,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 21.05 07:55:33" (1/2) ... [2021-05-21 19:55:33,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486bbae6 and model type fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.05 07:55:33, skipping insertion in model container [2021-05-21 19:55:33,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.05 07:55:33" (2/2) ... [2021-05-21 19:55:33,417 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_loop_noop.bpl [2021-05-21 19:55:33,426 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-05-21 19:55:33,426 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-21 19:55:33,427 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-05-21 19:55:33,427 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-05-21 19:55:33,462 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-05-21 19:55:33,483 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-05-21 19:55:33,512 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 19:55:33,512 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 19:55:33,512 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 19:55:33,512 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 19:55:33,512 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 19:55:33,513 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 19:55:33,513 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 19:55:33,513 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 19:55:33,525 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 11 places, 8 transitions, 21 flow [2021-05-21 19:55:33,534 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 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-05-21 19:55:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 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-05-21 19:55:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-05-21 19:55:33,541 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:33,541 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-05-21 19:55:33,541 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1315, now seen corresponding path program 1 times [2021-05-21 19:55:33,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:33,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023945770] [2021-05-21 19:55:33,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 19:55:33,683 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 19:55:33,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 19:55:33,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023945770] [2021-05-21 19:55:33,685 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023945770] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 19:55:33,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 19:55:33,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-05-21 19:55:33,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084505707] [2021-05-21 19:55:33,690 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 19:55:33,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 19:55:33,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 19:55:33,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:33,709 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 19 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 19:55:33,723 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2021-05-21 19:55:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 19:55:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-05-21 19:55:33,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 19:55:33,730 INFO L225 Difference]: With dead ends: 16 [2021-05-21 19:55:33,730 INFO L226 Difference]: Without dead ends: 8 [2021-05-21 19:55:33,731 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-05-21 19:55:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-05-21 19:55:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 19:55:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-05-21 19:55:33,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 2 [2021-05-21 19:55:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 19:55:33,759 INFO L482 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-05-21 19:55:33,760 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-05-21 19:55:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-05-21 19:55:33,760 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:33,760 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-05-21 19:55:33,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-21 19:55:33,761 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:33,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:33,764 INFO L82 PathProgramCache]: Analyzing trace with hash 41033, now seen corresponding path program 1 times [2021-05-21 19:55:33,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:33,765 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027508238] [2021-05-21 19:55:33,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:33,771 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:33,778 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:33,790 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 19:55:33,790 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 19:55:33,792 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-21 19:55:33,793 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-05-21 19:55:33,793 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-05-21 19:55:33,804 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-05-21 19:55:33,804 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-05-21 19:55:33,807 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 19:55:33,808 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 19:55:33,808 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 19:55:33,808 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 19:55:33,808 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 19:55:33,808 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 19:55:33,808 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 19:55:33,808 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 19:55:33,809 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 11 transitions, 34 flow [2021-05-21 19:55:33,819 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 62 states, 55 states have (on average 2.2) internal successors, (121), 61 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 19:55:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 55 states have (on average 2.2) internal successors, (121), 61 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 19:55:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-05-21 19:55:33,820 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:33,820 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-05-21 19:55:33,820 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:33,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:33,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2021-05-21 19:55:33,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:33,822 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362313230] [2021-05-21 19:55:33,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 19:55:33,854 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 19:55:33,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 19:55:33,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362313230] [2021-05-21 19:55:33,855 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362313230] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 19:55:33,855 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 19:55:33,855 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-05-21 19:55:33,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140382940] [2021-05-21 19:55:33,855 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 19:55:33,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 19:55:33,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 19:55:33,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:33,856 INFO L87 Difference]: Start difference. First operand has 62 states, 55 states have (on average 2.2) internal successors, (121), 61 states have internal predecessors, (121), 0 states have call successors, (0), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 19:55:33,862 INFO L93 Difference]: Finished difference Result 49 states and 94 transitions. [2021-05-21 19:55:33,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 19:55:33,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-05-21 19:55:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 19:55:33,866 INFO L225 Difference]: With dead ends: 49 [2021-05-21 19:55:33,866 INFO L226 Difference]: Without dead ends: 23 [2021-05-21 19:55:33,867 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:33,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-05-21 19:55:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-05-21 19:55:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 19:55:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 40 transitions. [2021-05-21 19:55:33,877 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 40 transitions. Word has length 2 [2021-05-21 19:55:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 19:55:33,877 INFO L482 AbstractCegarLoop]: Abstraction has 23 states and 40 transitions. [2021-05-21 19:55:33,878 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 40 transitions. [2021-05-21 19:55:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-05-21 19:55:33,878 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:33,879 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-05-21 19:55:33,879 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-21 19:55:33,881 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:33,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:33,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1612715, now seen corresponding path program 1 times [2021-05-21 19:55:33,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:33,883 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665190487] [2021-05-21 19:55:33,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:33,886 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:33,888 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:33,889 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 19:55:33,889 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 19:55:33,890 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-21 19:55:33,890 WARN L242 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-05-21 19:55:33,890 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-05-21 19:55:33,924 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-05-21 19:55:33,924 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-05-21 19:55:33,925 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 19:55:33,925 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 19:55:33,925 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 19:55:33,925 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 19:55:33,925 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 19:55:33,925 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 19:55:33,925 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 19:55:33,926 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 19:55:33,926 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 21 places, 14 transitions, 49 flow [2021-05-21 19:55:33,947 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 188 states, 179 states have (on average 2.7206703910614527) internal successors, (487), 187 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 19:55:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 179 states have (on average 2.7206703910614527) internal successors, (487), 187 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 19:55:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-05-21 19:55:33,949 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:33,949 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-05-21 19:55:33,949 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:33,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2115, now seen corresponding path program 1 times [2021-05-21 19:55:33,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:33,950 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915025108] [2021-05-21 19:55:33,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 19:55:33,973 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 19:55:33,973 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 19:55:33,973 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915025108] [2021-05-21 19:55:33,973 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915025108] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 19:55:33,973 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 19:55:33,974 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-05-21 19:55:33,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782061356] [2021-05-21 19:55:33,974 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 19:55:33,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 19:55:33,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 19:55:33,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:33,976 INFO L87 Difference]: Start difference. First operand has 188 states, 179 states have (on average 2.7206703910614527) internal successors, (487), 187 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 19:55:33,988 INFO L93 Difference]: Finished difference Result 148 states and 379 transitions. [2021-05-21 19:55:34,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 19:55:34,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-05-21 19:55:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 19:55:34,008 INFO L225 Difference]: With dead ends: 148 [2021-05-21 19:55:34,008 INFO L226 Difference]: Without dead ends: 68 [2021-05-21 19:55:34,009 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-05-21 19:55:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-05-21 19:55:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.4328358208955225) internal successors, (163), 67 states have internal predecessors, (163), 0 states have call successors, (0), 0 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 19:55:34,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 163 transitions. [2021-05-21 19:55:34,034 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 163 transitions. Word has length 2 [2021-05-21 19:55:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 19:55:34,035 INFO L482 AbstractCegarLoop]: Abstraction has 68 states and 163 transitions. [2021-05-21 19:55:34,035 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 163 transitions. [2021-05-21 19:55:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-05-21 19:55:34,036 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:34,036 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-05-21 19:55:34,037 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-21 19:55:34,037 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:34,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:34,037 INFO L82 PathProgramCache]: Analyzing trace with hash 63416129, now seen corresponding path program 1 times [2021-05-21 19:55:34,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:34,038 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917182491] [2021-05-21 19:55:34,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:34,045 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:34,049 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:34,051 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 19:55:34,051 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 19:55:34,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-21 19:55:34,051 WARN L242 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-05-21 19:55:34,051 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-05-21 19:55:34,073 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-05-21 19:55:34,073 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-05-21 19:55:34,074 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 19:55:34,074 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 19:55:34,074 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 19:55:34,074 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 19:55:34,075 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 19:55:34,075 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 19:55:34,075 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 19:55:34,075 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 19:55:34,076 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 17 transitions, 66 flow [2021-05-21 19:55:34,122 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 566 states, 555 states have (on average 3.30990990990991) internal successors, (1837), 565 states have internal predecessors, (1837), 0 states have call successors, (0), 0 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 19:55:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 566 states, 555 states have (on average 3.30990990990991) internal successors, (1837), 565 states have internal predecessors, (1837), 0 states have call successors, (0), 0 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 19:55:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-05-21 19:55:34,125 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:34,125 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-05-21 19:55:34,125 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:34,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2659, now seen corresponding path program 1 times [2021-05-21 19:55:34,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:34,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670548252] [2021-05-21 19:55:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 19:55:34,148 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 19:55:34,149 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 19:55:34,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670548252] [2021-05-21 19:55:34,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670548252] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 19:55:34,149 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 19:55:34,150 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-05-21 19:55:34,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030400435] [2021-05-21 19:55:34,150 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 19:55:34,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 19:55:34,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 19:55:34,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:34,153 INFO L87 Difference]: Start difference. First operand has 566 states, 555 states have (on average 3.30990990990991) internal successors, (1837), 565 states have internal predecessors, (1837), 0 states have call successors, (0), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 19:55:34,178 INFO L93 Difference]: Finished difference Result 445 states and 1432 transitions. [2021-05-21 19:55:34,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 19:55:34,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-05-21 19:55:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 19:55:34,190 INFO L225 Difference]: With dead ends: 445 [2021-05-21 19:55:34,191 INFO L226 Difference]: Without dead ends: 203 [2021-05-21 19:55:34,191 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-05-21 19:55:34,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2021-05-21 19:55:34,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 3.0792079207920793) internal successors, (622), 202 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-21 19:55:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 622 transitions. [2021-05-21 19:55:34,233 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 622 transitions. Word has length 2 [2021-05-21 19:55:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 19:55:34,233 INFO L482 AbstractCegarLoop]: Abstraction has 203 states and 622 transitions. [2021-05-21 19:55:34,233 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 622 transitions. [2021-05-21 19:55:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-05-21 19:55:34,234 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:34,234 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-05-21 19:55:34,234 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-21 19:55:34,234 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:34,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1824239762, now seen corresponding path program 1 times [2021-05-21 19:55:34,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:34,236 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612756920] [2021-05-21 19:55:34,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:34,246 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:34,249 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:34,251 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 19:55:34,251 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 19:55:34,251 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-21 19:55:34,251 WARN L242 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2021-05-21 19:55:34,251 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2021-05-21 19:55:34,271 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-05-21 19:55:34,271 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-05-21 19:55:34,272 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 19:55:34,272 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 19:55:34,272 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 19:55:34,272 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 19:55:34,272 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 19:55:34,273 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 19:55:34,273 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 19:55:34,273 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 19:55:34,274 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 20 transitions, 85 flow [2021-05-21 19:55:34,375 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1700 states, 1687 states have (on average 3.9377593360995853) internal successors, (6643), 1699 states have internal predecessors, (6643), 0 states have call successors, (0), 0 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 19:55:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 1700 states, 1687 states have (on average 3.9377593360995853) internal successors, (6643), 1699 states have internal predecessors, (6643), 0 states have call successors, (0), 0 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 19:55:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-05-21 19:55:34,383 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:34,383 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-05-21 19:55:34,383 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:34,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:34,384 INFO L82 PathProgramCache]: Analyzing trace with hash 3299, now seen corresponding path program 1 times [2021-05-21 19:55:34,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:34,384 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835383713] [2021-05-21 19:55:34,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 19:55:34,399 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 19:55:34,399 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 19:55:34,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835383713] [2021-05-21 19:55:34,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835383713] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 19:55:34,399 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 19:55:34,400 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-05-21 19:55:34,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774971051] [2021-05-21 19:55:34,400 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 19:55:34,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 19:55:34,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 19:55:34,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:34,408 INFO L87 Difference]: Start difference. First operand has 1700 states, 1687 states have (on average 3.9377593360995853) internal successors, (6643), 1699 states have internal predecessors, (6643), 0 states have call successors, (0), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 19:55:34,431 INFO L93 Difference]: Finished difference Result 1336 states and 5185 transitions. [2021-05-21 19:55:34,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 19:55:34,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-05-21 19:55:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 19:55:34,438 INFO L225 Difference]: With dead ends: 1336 [2021-05-21 19:55:34,438 INFO L226 Difference]: Without dead ends: 608 [2021-05-21 19:55:34,439 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-05-21 19:55:34,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2021-05-21 19:55:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 607 states have (on average 3.7380560131795715) internal successors, (2269), 607 states have internal predecessors, (2269), 0 states have call successors, (0), 0 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 19:55:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 2269 transitions. [2021-05-21 19:55:34,489 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 2269 transitions. Word has length 2 [2021-05-21 19:55:34,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 19:55:34,489 INFO L482 AbstractCegarLoop]: Abstraction has 608 states and 2269 transitions. [2021-05-21 19:55:34,489 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 2269 transitions. [2021-05-21 19:55:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-05-21 19:55:34,490 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:34,490 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-05-21 19:55:34,490 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-21 19:55:34,490 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:34,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:34,491 INFO L82 PathProgramCache]: Analyzing trace with hash 504182917, now seen corresponding path program 1 times [2021-05-21 19:55:34,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:34,491 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052873567] [2021-05-21 19:55:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:34,495 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:34,498 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:34,499 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 19:55:34,500 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 19:55:34,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-05-21 19:55:34,500 WARN L242 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2021-05-21 19:55:34,500 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2021-05-21 19:55:34,520 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-05-21 19:55:34,521 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-05-21 19:55:34,522 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 19:55:34,522 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 19:55:34,522 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 19:55:34,522 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 19:55:34,522 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 19:55:34,522 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 19:55:34,522 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 19:55:34,523 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 19:55:34,525 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 23 transitions, 106 flow [2021-05-21 19:55:34,853 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5102 states, 5087 states have (on average 4.586003538431296) internal successors, (23329), 5101 states have internal predecessors, (23329), 0 states have call successors, (0), 0 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 19:55:34,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 5102 states, 5087 states have (on average 4.586003538431296) internal successors, (23329), 5101 states have internal predecessors, (23329), 0 states have call successors, (0), 0 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 19:55:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-05-21 19:55:34,873 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:34,873 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-05-21 19:55:34,873 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:34,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:34,874 INFO L82 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 1 times [2021-05-21 19:55:34,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:34,874 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900622500] [2021-05-21 19:55:34,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 19:55:34,882 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 19:55:34,882 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 19:55:34,882 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900622500] [2021-05-21 19:55:34,882 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900622500] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 19:55:34,882 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 19:55:34,883 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-05-21 19:55:34,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638532137] [2021-05-21 19:55:34,883 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 19:55:34,883 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 19:55:34,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 19:55:34,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:34,902 INFO L87 Difference]: Start difference. First operand has 5102 states, 5087 states have (on average 4.586003538431296) internal successors, (23329), 5101 states have internal predecessors, (23329), 0 states have call successors, (0), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 19:55:34,955 INFO L93 Difference]: Finished difference Result 4009 states and 18226 transitions. [2021-05-21 19:55:34,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 19:55:34,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-05-21 19:55:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 19:55:34,971 INFO L225 Difference]: With dead ends: 4009 [2021-05-21 19:55:34,971 INFO L226 Difference]: Without dead ends: 1823 [2021-05-21 19:55:34,972 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2021-05-21 19:55:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1823. [2021-05-21 19:55:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1822 states have (on average 4.401756311745335) internal successors, (8020), 1822 states have internal predecessors, (8020), 0 states have call successors, (0), 0 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 19:55:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 8020 transitions. [2021-05-21 19:55:35,094 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 8020 transitions. Word has length 2 [2021-05-21 19:55:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 19:55:35,095 INFO L482 AbstractCegarLoop]: Abstraction has 1823 states and 8020 transitions. [2021-05-21 19:55:35,095 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 8020 transitions. [2021-05-21 19:55:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-05-21 19:55:35,096 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:35,096 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 19:55:35,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-05-21 19:55:35,096 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:35,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1332075505, now seen corresponding path program 1 times [2021-05-21 19:55:35,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:35,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502093912] [2021-05-21 19:55:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:35,101 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:35,103 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:35,105 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 19:55:35,105 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 19:55:35,105 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-05-21 19:55:35,105 WARN L242 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2021-05-21 19:55:35,105 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2021-05-21 19:55:35,115 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-05-21 19:55:35,116 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-05-21 19:55:35,116 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 19:55:35,116 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 19:55:35,116 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 19:55:35,116 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 19:55:35,116 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 19:55:35,117 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 19:55:35,117 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 19:55:35,117 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 19:55:35,117 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 26 transitions, 129 flow [2021-05-21 19:55:36,438 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 15308 states, 15291 states have (on average 5.244326728140736) internal successors, (80191), 15307 states have internal predecessors, (80191), 0 states have call successors, (0), 0 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 19:55:36,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 15308 states, 15291 states have (on average 5.244326728140736) internal successors, (80191), 15307 states have internal predecessors, (80191), 0 states have call successors, (0), 0 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 19:55:36,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-05-21 19:55:36,467 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:36,467 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-05-21 19:55:36,467 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:36,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:36,468 INFO L82 PathProgramCache]: Analyzing trace with hash 4867, now seen corresponding path program 1 times [2021-05-21 19:55:36,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:36,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967174229] [2021-05-21 19:55:36,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 19:55:36,492 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 19:55:36,493 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 19:55:36,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967174229] [2021-05-21 19:55:36,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967174229] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 19:55:36,493 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 19:55:36,493 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-05-21 19:55:36,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528571831] [2021-05-21 19:55:36,494 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 19:55:36,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 19:55:36,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 19:55:36,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:36,523 INFO L87 Difference]: Start difference. First operand has 15308 states, 15291 states have (on average 5.244326728140736) internal successors, (80191), 15307 states have internal predecessors, (80191), 0 states have call successors, (0), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 19:55:36,718 INFO L93 Difference]: Finished difference Result 12028 states and 62695 transitions. [2021-05-21 19:55:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 19:55:36,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-05-21 19:55:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 19:55:36,769 INFO L225 Difference]: With dead ends: 12028 [2021-05-21 19:55:36,769 INFO L226 Difference]: Without dead ends: 5468 [2021-05-21 19:55:36,769 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2021-05-21 19:55:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5468. [2021-05-21 19:55:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5468 states, 5467 states have (on average 5.06731296872142) internal successors, (27703), 5467 states have internal predecessors, (27703), 0 states have call successors, (0), 0 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 19:55:37,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 27703 transitions. [2021-05-21 19:55:37,366 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 27703 transitions. Word has length 2 [2021-05-21 19:55:37,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 19:55:37,366 INFO L482 AbstractCegarLoop]: Abstraction has 5468 states and 27703 transitions. [2021-05-21 19:55:37,366 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:37,366 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 27703 transitions. [2021-05-21 19:55:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-05-21 19:55:37,368 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:37,368 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 19:55:37,368 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-05-21 19:55:37,368 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash 58177429, now seen corresponding path program 1 times [2021-05-21 19:55:37,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:37,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169814778] [2021-05-21 19:55:37,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:37,373 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:37,375 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:37,377 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 19:55:37,377 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 19:55:37,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-05-21 19:55:37,378 WARN L242 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2021-05-21 19:55:37,378 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2021-05-21 19:55:37,393 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-05-21 19:55:37,393 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-05-21 19:55:37,396 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 19:55:37,396 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 19:55:37,397 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 19:55:37,397 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 19:55:37,397 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 19:55:37,397 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 19:55:37,397 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 19:55:37,397 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 19:55:37,399 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 29 transitions, 154 flow [2021-05-21 19:55:50,263 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45926 states, 45907 states have (on average 5.907356176617945) internal successors, (271189), 45925 states have internal predecessors, (271189), 0 states have call successors, (0), 0 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 19:55:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 45926 states, 45907 states have (on average 5.907356176617945) internal successors, (271189), 45925 states have internal predecessors, (271189), 0 states have call successors, (0), 0 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 19:55:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-05-21 19:55:50,341 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:50,341 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-05-21 19:55:50,341 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:50,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash 5795, now seen corresponding path program 1 times [2021-05-21 19:55:50,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:50,342 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143364593] [2021-05-21 19:55:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 19:55:50,351 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 19:55:50,352 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 19:55:50,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143364593] [2021-05-21 19:55:50,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143364593] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 19:55:50,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 19:55:50,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-05-21 19:55:50,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430571117] [2021-05-21 19:55:50,353 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 19:55:50,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 19:55:50,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 19:55:50,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:50,433 INFO L87 Difference]: Start difference. First operand has 45926 states, 45907 states have (on average 5.907356176617945) internal successors, (271189), 45925 states have internal predecessors, (271189), 0 states have call successors, (0), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 19:55:51,232 INFO L93 Difference]: Finished difference Result 36085 states and 212140 transitions. [2021-05-21 19:55:51,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 19:55:51,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-05-21 19:55:51,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 19:55:51,409 INFO L225 Difference]: With dead ends: 36085 [2021-05-21 19:55:51,409 INFO L226 Difference]: Without dead ends: 16403 [2021-05-21 19:55:51,410 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:55:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16403 states. [2021-05-21 19:55:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16403 to 16403. [2021-05-21 19:55:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16403 states, 16402 states have (on average 5.733569076941836) internal successors, (94042), 16402 states have internal predecessors, (94042), 0 states have call successors, (0), 0 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 19:55:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16403 states to 16403 states and 94042 transitions. [2021-05-21 19:55:53,188 INFO L78 Accepts]: Start accepts. Automaton has 16403 states and 94042 transitions. Word has length 2 [2021-05-21 19:55:53,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 19:55:53,188 INFO L482 AbstractCegarLoop]: Abstraction has 16403 states and 94042 transitions. [2021-05-21 19:55:53,188 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:55:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 16403 states and 94042 transitions. [2021-05-21 19:55:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-05-21 19:55:53,190 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:55:53,190 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 19:55:53,191 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-05-21 19:55:53,191 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:55:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:55:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1055505844, now seen corresponding path program 1 times [2021-05-21 19:55:53,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:55:53,192 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033418577] [2021-05-21 19:55:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:55:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:53,195 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:55:53,198 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:55:53,199 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 19:55:53,199 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 19:55:53,199 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-05-21 19:55:53,200 WARN L242 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2021-05-21 19:55:53,200 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2021-05-21 19:55:53,242 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-05-21 19:55:53,242 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-05-21 19:55:53,243 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 19:55:53,243 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 19:55:53,243 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 19:55:53,243 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 19:55:53,243 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 19:55:53,244 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 19:55:53,244 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 19:55:53,244 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 19:55:53,245 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 32 transitions, 181 flow [2021-05-21 19:57:30,137 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 137780 states, 137759 states have (on average 6.5724852822683095) internal successors, (905419), 137779 states have internal predecessors, (905419), 0 states have call successors, (0), 0 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 19:57:30,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 137780 states, 137759 states have (on average 6.5724852822683095) internal successors, (905419), 137779 states have internal predecessors, (905419), 0 states have call successors, (0), 0 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 19:57:30,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-05-21 19:57:30,395 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:57:30,396 INFO L521 BasicCegarLoop]: trace histogram [1, 1] [2021-05-21 19:57:30,396 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:57:30,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:57:30,396 INFO L82 PathProgramCache]: Analyzing trace with hash 6819, now seen corresponding path program 1 times [2021-05-21 19:57:30,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:57:30,396 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750096411] [2021-05-21 19:57:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:57:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-21 19:57:30,405 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 19:57:30,405 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-21 19:57:30,405 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750096411] [2021-05-21 19:57:30,405 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750096411] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-21 19:57:30,405 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-21 19:57:30,405 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-05-21 19:57:30,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416326686] [2021-05-21 19:57:30,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-21 19:57:30,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-21 19:57:30,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-21 19:57:30,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-21 19:57:30,587 INFO L87 Difference]: Start difference. First operand has 137780 states, 137759 states have (on average 6.5724852822683095) internal successors, (905419), 137779 states have internal predecessors, (905419), 0 states have call successors, (0), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:57:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-21 19:57:32,507 INFO L93 Difference]: Finished difference Result 108256 states and 708589 transitions. [2021-05-21 19:57:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-21 19:57:32,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-05-21 19:57:32,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-21 19:57:32,903 INFO L225 Difference]: With dead ends: 108256 [2021-05-21 19:57:32,903 INFO L226 Difference]: Without dead ends: 49208 [2021-05-21 19:57:32,904 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 19:57:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49208 states. [2021-05-21 19:57:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49208 to 49208. [2021-05-21 19:57:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49208 states, 49207 states have (on average 6.400085353709838) internal successors, (314929), 49207 states have internal predecessors, (314929), 0 states have call successors, (0), 0 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 19:57:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49208 states to 49208 states and 314929 transitions. [2021-05-21 19:57:41,588 INFO L78 Accepts]: Start accepts. Automaton has 49208 states and 314929 transitions. Word has length 2 [2021-05-21 19:57:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-21 19:57:41,588 INFO L482 AbstractCegarLoop]: Abstraction has 49208 states and 314929 transitions. [2021-05-21 19:57:41,589 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 19:57:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 49208 states and 314929 transitions. [2021-05-21 19:57:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-21 19:57:41,591 INFO L513 BasicCegarLoop]: Found error trace [2021-05-21 19:57:41,591 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-21 19:57:41,591 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-05-21 19:57:41,591 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-05-21 19:57:41,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-21 19:57:41,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1814808561, now seen corresponding path program 1 times [2021-05-21 19:57:41,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-21 19:57:41,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775572717] [2021-05-21 19:57:41,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-21 19:57:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:57:41,596 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:57:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-21 19:57:41,599 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-21 19:57:41,600 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-05-21 19:57:41,600 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-05-21 19:57:41,601 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-05-21 19:57:41,601 WARN L242 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2021-05-21 19:57:41,601 INFO L478 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2021-05-21 19:57:41,633 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-05-21 19:57:41,634 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-05-21 19:57:41,635 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-05-21 19:57:41,635 INFO L379 AbstractCegarLoop]: Hoare is false [2021-05-21 19:57:41,635 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-21 19:57:41,635 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-21 19:57:41,635 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-21 19:57:41,635 INFO L383 AbstractCegarLoop]: Difference is false [2021-05-21 19:57:41,635 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-21 19:57:41,635 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-21 19:57:41,636 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 35 transitions, 210 flow Received shutdown request... [2021-05-21 20:10:03,257 WARN L547 AbstractCegarLoop]: Verification canceled [2021-05-21 20:10:03,258 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 10 thread instances [2021-05-21 20:10:03,261 WARN L196 ceAbstractionStarter]: Timeout [2021-05-21 20:10:03,262 INFO L202 PluginConnector]: Adding new model fork_loop_noop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.05 08:10:03 BasicIcfg [2021-05-21 20:10:03,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-21 20:10:03,263 INFO L168 Benchmark]: Toolchain (without parser) took 870093.30 ms. Allocated memory was 343.9 MB in the beginning and 9.1 GB in the end (delta: 8.8 GB). Free memory was 323.9 MB in the beginning and 4.7 GB in the end (delta: -4.4 GB). Peak memory consumption was 5.5 GB. Max. memory is 16.0 GB. [2021-05-21 20:10:03,263 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 343.9 MB. Free memory was 324.9 MB in the beginning and 324.8 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 20:10:03,264 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.28 ms. Allocated memory is still 343.9 MB. Free memory was 323.8 MB in the beginning and 322.4 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:10:03,264 INFO L168 Benchmark]: Boogie Preprocessor took 14.31 ms. Allocated memory is still 343.9 MB. Free memory was 322.4 MB in the beginning and 321.5 MB in the end (delta: 903.7 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-05-21 20:10:03,265 INFO L168 Benchmark]: RCFGBuilder took 195.40 ms. Allocated memory is still 343.9 MB. Free memory was 321.4 MB in the beginning and 313.2 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. [2021-05-21 20:10:03,265 INFO L168 Benchmark]: TraceAbstraction took 869850.08 ms. Allocated memory was 343.9 MB in the beginning and 9.1 GB in the end (delta: 8.8 GB). Free memory was 312.8 MB in the beginning and 4.7 GB in the end (delta: -4.4 GB). Peak memory consumption was 5.5 GB. Max. memory is 16.0 GB. [2021-05-21 20:10:03,267 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.15 ms. Allocated memory is still 343.9 MB. Free memory was 324.9 MB in the beginning and 324.8 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 27.28 ms. Allocated memory is still 343.9 MB. Free memory was 323.8 MB in the beginning and 322.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 14.31 ms. Allocated memory is still 343.9 MB. Free memory was 322.4 MB in the beginning and 321.5 MB in the end (delta: 903.7 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 195.40 ms. Allocated memory is still 343.9 MB. Free memory was 321.4 MB in the beginning and 313.2 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 869850.08 ms. Allocated memory was 343.9 MB in the beginning and 9.1 GB in the end (delta: 8.8 GB). Free memory was 312.8 MB in the beginning and 4.7 GB in the end (delta: -4.4 GB). Peak memory consumption was 5.5 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 56 places, 35 transitions, 210 flow. Already constructed 370140 states. Currently 34548 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 12 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 282.7ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 6.5ms, AutomataDifference: 40.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 21.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 6 SDtfs, 6 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 14.0ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.2ms SsaConstructionTime, 17.2ms SatisfiabilityAnalysisTime, 43.7ms InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 15 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 82.3ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 1.1ms, AutomataDifference: 11.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 9 SDtfs, 9 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 10.1ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 3.1ms SsaConstructionTime, 2.6ms SatisfiabilityAnalysisTime, 22.7ms InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 18 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 126.3ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 1.9ms, AutomataDifference: 34.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 21.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 12 SDtfs, 12 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 25.3ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0ms SsaConstructionTime, 5.9ms SatisfiabilityAnalysisTime, 19.3ms InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 21 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 176.9ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 2.5ms, AutomataDifference: 40.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 47.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 15 SDtfs, 15 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=566occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 41.6ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2ms SsaConstructionTime, 7.7ms SatisfiabilityAnalysisTime, 15.0ms InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 5 thread instances CFG has 7 procedures, 24 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 227.8ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 7.9ms, AutomataDifference: 38.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 102.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 18 SDtfs, 18 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1700occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 49.7ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.4ms SsaConstructionTime, 3.0ms SatisfiabilityAnalysisTime, 8.2ms InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 6 thread instances CFG has 8 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 583.4ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 20.8ms, AutomataDifference: 88.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 330.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 21 SDtfs, 21 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5102occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 122.7ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7ms SsaConstructionTime, 2.7ms SatisfiabilityAnalysisTime, 5.0ms InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 7 thread instances CFG has 9 procedures, 30 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2261.4ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 29.5ms, AutomataDifference: 275.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1322.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 24 SDtfs, 24 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=15308occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 596.0ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0ms SsaConstructionTime, 3.8ms SatisfiabilityAnalysisTime, 14.9ms InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 8 thread instances CFG has 10 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15803.2ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 80.0ms, AutomataDifference: 1056.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12866.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 27 SDtfs, 27 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=45926occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1777.3ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5ms SsaConstructionTime, 2.6ms SatisfiabilityAnalysisTime, 6.6ms InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 9 thread instances CFG has 11 procedures, 36 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 108357.5ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 260.0ms, AutomataDifference: 2497.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 96893.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 30 SDtfs, 30 SDslu, 0 SDs, 0 SdLazy, 1 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=137780occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8684.3ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6ms SsaConstructionTime, 2.6ms SatisfiabilityAnalysisTime, 4.4ms InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 3 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 10 thread instances CFG has 12 procedures, 39 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 741622.3ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 741621.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown