/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/fork_loop_inc.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 14:04:13,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 14:04:13,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 14:04:13,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 14:04:13,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 14:04:13,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 14:04:13,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 14:04:13,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 14:04:13,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 14:04:13,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 14:04:13,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 14:04:13,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 14:04:13,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 14:04:13,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 14:04:13,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 14:04:13,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 14:04:13,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 14:04:13,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 14:04:13,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 14:04:13,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 14:04:13,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 14:04:13,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 14:04:13,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 14:04:13,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 14:04:13,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 14:04:13,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 14:04:13,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 14:04:13,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 14:04:13,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 14:04:13,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 14:04:13,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 14:04:13,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 14:04:13,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 14:04:13,377 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 14:04:13,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 14:04:13,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 14:04:13,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 14:04:13,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 14:04:13,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 14:04:13,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 14:04:13,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 14:04:13,381 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-SemanticLbe.epf [2021-03-11 14:04:13,403 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 14:04:13,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 14:04:13,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 14:04:13,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 14:04:13,404 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 14:04:13,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 14:04:13,404 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 14:04:13,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 14:04:13,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 14:04:13,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 14:04:13,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 14:04:13,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 14:04:13,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 14:04:13,405 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 14:04:13,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 14:04:13,406 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 14:04:13,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 14:04:13,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 14:04:13,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 14:04:13,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 14:04:13,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 14:04:13,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 14:04:13,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 14:04:13,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 14:04:13,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 14:04:13,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 14:04:13,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 14:04:13,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 14:04:13,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 14:04:13,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 14:04:13,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 14:04:13,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 14:04:13,650 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-11 14:04:13,655 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-11 14:04:13,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_inc.bpl [2021-03-11 14:04:13,657 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/fork_loop_inc.bpl' [2021-03-11 14:04:13,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 14:04:13,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-11 14:04:13,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 14:04:13,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 14:04:13,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 14:04:13,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:04:13" (1/1) ... [2021-03-11 14:04:13,702 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:04:13" (1/1) ... [2021-03-11 14:04:13,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 14:04:13,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 14:04:13,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 14:04:13,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 14:04:13,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:04:13" (1/1) ... [2021-03-11 14:04:13,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:04:13" (1/1) ... [2021-03-11 14:04:13,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:04:13" (1/1) ... [2021-03-11 14:04:13,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:04:13" (1/1) ... [2021-03-11 14:04:13,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:04:13" (1/1) ... [2021-03-11 14:04:13,726 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:04:13" (1/1) ... [2021-03-11 14:04:13,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:04:13" (1/1) ... [2021-03-11 14:04:13,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 14:04:13,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 14:04:13,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 14:04:13,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 14:04:13,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:04:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 14:04:13,791 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-11 14:04:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 14:04:13,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 14:04:13,793 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2021-03-11 14:04:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2021-03-11 14:04:13,793 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2021-03-11 14:04:13,794 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 14:04:13,879 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 14:04:13,879 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-03-11 14:04:13,880 INFO L202 PluginConnector]: Adding new model fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:04:13 BoogieIcfgContainer [2021-03-11 14:04:13,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 14:04:13,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 14:04:13,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 14:04:13,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 14:04:13,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.03 02:04:13" (1/2) ... [2021-03-11 14:04:13,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecb1a3c and model type fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:04:13, skipping insertion in model container [2021-03-11 14:04:13,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:04:13" (2/2) ... [2021-03-11 14:04:13,885 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_loop_inc.bpl [2021-03-11 14:04:13,888 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 14:04:13,888 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 14:04:13,890 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-11 14:04:13,891 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 14:04:13,914 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:13,925 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:13,949 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:13,949 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:13,949 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:13,949 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:13,949 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:13,949 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:13,949 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:13,949 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:13,958 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:13,966 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 11 places, 8 transitions, 21 flow [2021-03-11 14:04:13,968 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 11 places, 8 transitions, 21 flow [2021-03-11 14:04:13,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 11 places, 8 transitions, 21 flow [2021-03-11 14:04:13,979 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-11 14:04:13,980 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:13,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16 conditions, 11 events. 0/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 19 event pairs, 0 based on Foata normal form. 0/9 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-11 14:04:13,981 INFO L116 LiptonReduction]: Number of co-enabled transitions 16 [2021-03-11 14:04:14,020 INFO L131 LiptonReduction]: Checked pairs total: 10 [2021-03-11 14:04:14,021 INFO L133 LiptonReduction]: Total number of compositions: 2 [2021-03-11 14:04:14,026 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 9 places, 6 transitions, 17 flow [2021-03-11 14:04:14,031 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 12 states, 7 states have (on average 2.0) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 7 states have (on average 2.0) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:14,035 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,035 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:14,035 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1315, now seen corresponding path program 1 times [2021-03-11 14:04:14,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358433335] [2021-03-11 14:04:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:14,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:14,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:14,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358433335] [2021-03-11 14:04:14,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:14,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:14,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637119397] [2021-03-11 14:04:14,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:14,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:14,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:14,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,141 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 2.0) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-03-11 14:04:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:14,152 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2021-03-11 14:04:14,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:14,153 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-03-11 14:04:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:14,158 INFO L225 Difference]: With dead ends: 9 [2021-03-11 14:04:14,158 INFO L226 Difference]: Without dead ends: 6 [2021-03-11 14:04:14,159 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2021-03-11 14:04:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2021-03-11 14:04:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2021-03-11 14:04:14,189 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 2 [2021-03-11 14:04:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:14,189 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2021-03-11 14:04:14,189 INFO L481 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-03-11 14:04:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2021-03-11 14:04:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-03-11 14:04:14,190 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,191 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-03-11 14:04:14,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 14:04:14,191 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,194 INFO L82 PathProgramCache]: Analyzing trace with hash 41033, now seen corresponding path program 1 times [2021-03-11 14:04:14,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502503408] [2021-03-11 14:04:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,203 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,204 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,213 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:14,213 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:14,214 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 14:04:14,215 WARN L342 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:14,215 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-03-11 14:04:14,226 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:14,227 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:14,228 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:14,228 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:14,228 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:14,228 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:14,228 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:14,228 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:14,228 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:14,228 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:14,229 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:14,229 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 11 transitions, 34 flow [2021-03-11 14:04:14,229 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 16 places, 11 transitions, 34 flow [2021-03-11 14:04:14,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 16 places, 11 transitions, 34 flow [2021-03-11 14:04:14,232 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-11 14:04:14,232 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:14,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 39 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-11 14:04:14,233 INFO L116 LiptonReduction]: Number of co-enabled transitions 44 [2021-03-11 14:04:14,292 INFO L131 LiptonReduction]: Checked pairs total: 30 [2021-03-11 14:04:14,292 INFO L133 LiptonReduction]: Total number of compositions: 3 [2021-03-11 14:04:14,293 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 13 places, 8 transitions, 28 flow [2021-03-11 14:04:14,294 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 25 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 25 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:14,295 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,295 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:14,295 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2021-03-11 14:04:14,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320446738] [2021-03-11 14:04:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:14,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:14,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:14,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320446738] [2021-03-11 14:04:14,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:14,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:14,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228971437] [2021-03-11 14:04:14,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:14,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:14,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:14,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,305 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 25 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-03-11 14:04:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:14,310 INFO L93 Difference]: Finished difference Result 19 states and 29 transitions. [2021-03-11 14:04:14,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:14,310 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-03-11 14:04:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:14,311 INFO L225 Difference]: With dead ends: 19 [2021-03-11 14:04:14,311 INFO L226 Difference]: Without dead ends: 12 [2021-03-11 14:04:14,311 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-03-11 14:04:14,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-03-11 14:04:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2021-03-11 14:04:14,313 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 2 [2021-03-11 14:04:14,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:14,313 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-03-11 14:04:14,313 INFO L481 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-03-11 14:04:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2021-03-11 14:04:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-03-11 14:04:14,314 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,314 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-03-11 14:04:14,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 14:04:14,314 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1674283, now seen corresponding path program 1 times [2021-03-11 14:04:14,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483385597] [2021-03-11 14:04:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,317 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,318 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,319 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:14,319 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:14,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 14:04:14,320 WARN L342 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:14,320 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2021-03-11 14:04:14,325 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:14,325 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:14,326 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:14,326 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:14,326 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:14,326 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:14,326 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:14,326 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:14,326 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:14,326 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:14,327 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:14,327 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 14 transitions, 49 flow [2021-03-11 14:04:14,327 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 14 transitions, 49 flow [2021-03-11 14:04:14,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 21 places, 14 transitions, 49 flow [2021-03-11 14:04:14,330 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-11 14:04:14,331 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:14,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 66 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-11 14:04:14,331 INFO L116 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-11 14:04:14,405 INFO L131 LiptonReduction]: Checked pairs total: 60 [2021-03-11 14:04:14,405 INFO L133 LiptonReduction]: Total number of compositions: 4 [2021-03-11 14:04:14,406 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 17 places, 10 transitions, 41 flow [2021-03-11 14:04:14,408 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 54 states, 45 states have (on average 2.422222222222222) internal successors, (109), 53 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 45 states have (on average 2.422222222222222) internal successors, (109), 53 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:14,409 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,409 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:14,409 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2275, now seen corresponding path program 1 times [2021-03-11 14:04:14,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169510683] [2021-03-11 14:04:14,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:14,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:14,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:14,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:14,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169510683] [2021-03-11 14:04:14,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:14,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:14,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388041420] [2021-03-11 14:04:14,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:14,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:14,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:14,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,423 INFO L87 Difference]: Start difference. First operand has 54 states, 45 states have (on average 2.422222222222222) internal successors, (109), 53 states have internal predecessors, (109), 0 states have call successors, (0), 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-03-11 14:04:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:14,446 INFO L93 Difference]: Finished difference Result 39 states and 77 transitions. [2021-03-11 14:04:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:14,449 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-03-11 14:04:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:14,450 INFO L225 Difference]: With dead ends: 39 [2021-03-11 14:04:14,450 INFO L226 Difference]: Without dead ends: 24 [2021-03-11 14:04:14,450 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-03-11 14:04:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-03-11 14:04:14,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 45 transitions. [2021-03-11 14:04:14,454 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 45 transitions. Word has length 2 [2021-03-11 14:04:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:14,454 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 45 transitions. [2021-03-11 14:04:14,454 INFO L481 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-03-11 14:04:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 45 transitions. [2021-03-11 14:04:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-03-11 14:04:14,454 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,454 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 14:04:14,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 14:04:14,455 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,455 INFO L82 PathProgramCache]: Analyzing trace with hash 68187654, now seen corresponding path program 1 times [2021-03-11 14:04:14,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621179187] [2021-03-11 14:04:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,458 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,460 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,461 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:14,461 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:14,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 14:04:14,461 WARN L342 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:14,461 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2021-03-11 14:04:14,474 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:14,474 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:14,475 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:14,475 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:14,475 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:14,475 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:14,475 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:14,475 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:14,475 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:14,475 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:14,476 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:14,476 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 17 transitions, 66 flow [2021-03-11 14:04:14,476 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 17 transitions, 66 flow [2021-03-11 14:04:14,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 17 transitions, 66 flow [2021-03-11 14:04:14,480 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-11 14:04:14,480 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:14,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 91 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2021-03-11 14:04:14,481 INFO L116 LiptonReduction]: Number of co-enabled transitions 136 [2021-03-11 14:04:14,530 INFO L131 LiptonReduction]: Checked pairs total: 100 [2021-03-11 14:04:14,530 INFO L133 LiptonReduction]: Total number of compositions: 5 [2021-03-11 14:04:14,531 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 21 places, 12 transitions, 56 flow [2021-03-11 14:04:14,535 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 110 states, 99 states have (on average 2.757575757575758) internal successors, (273), 109 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 99 states have (on average 2.757575757575758) internal successors, (273), 109 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:14,536 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,536 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:14,536 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2947, now seen corresponding path program 1 times [2021-03-11 14:04:14,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295731961] [2021-03-11 14:04:14,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:14,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:14,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:14,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295731961] [2021-03-11 14:04:14,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:14,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:14,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897865200] [2021-03-11 14:04:14,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:14,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:14,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:14,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,545 INFO L87 Difference]: Start difference. First operand has 110 states, 99 states have (on average 2.757575757575758) internal successors, (273), 109 states have internal predecessors, (273), 0 states have call successors, (0), 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-03-11 14:04:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:14,554 INFO L93 Difference]: Finished difference Result 79 states and 193 transitions. [2021-03-11 14:04:14,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:14,555 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-03-11 14:04:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:14,555 INFO L225 Difference]: With dead ends: 79 [2021-03-11 14:04:14,555 INFO L226 Difference]: Without dead ends: 48 [2021-03-11 14:04:14,556 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-03-11 14:04:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-03-11 14:04:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.404255319148936) internal successors, (113), 47 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 113 transitions. [2021-03-11 14:04:14,560 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 113 transitions. Word has length 2 [2021-03-11 14:04:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:14,560 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 113 transitions. [2021-03-11 14:04:14,560 INFO L481 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-03-11 14:04:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 113 transitions. [2021-03-11 14:04:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-03-11 14:04:14,561 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,561 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-03-11 14:04:14,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 14:04:14,561 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1557988658, now seen corresponding path program 1 times [2021-03-11 14:04:14,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170385972] [2021-03-11 14:04:14,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,565 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,566 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,567 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:14,568 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:14,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 14:04:14,568 WARN L342 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:14,568 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2021-03-11 14:04:14,574 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:14,575 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:14,575 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:14,575 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:14,575 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:14,575 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:14,575 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:14,576 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:14,576 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:14,576 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:14,576 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:14,576 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 85 flow [2021-03-11 14:04:14,577 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 20 transitions, 85 flow [2021-03-11 14:04:14,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 20 transitions, 85 flow [2021-03-11 14:04:14,581 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-11 14:04:14,581 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:14,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2021-03-11 14:04:14,581 INFO L116 LiptonReduction]: Number of co-enabled transitions 200 [2021-03-11 14:04:14,668 INFO L131 LiptonReduction]: Checked pairs total: 150 [2021-03-11 14:04:14,668 INFO L133 LiptonReduction]: Total number of compositions: 6 [2021-03-11 14:04:14,669 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 14 transitions, 73 flow [2021-03-11 14:04:14,676 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 222 states, 209 states have (on average 3.1435406698564594) internal successors, (657), 221 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 209 states have (on average 3.1435406698564594) internal successors, (657), 221 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:14,677 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,677 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:14,677 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,677 INFO L82 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2021-03-11 14:04:14,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897542964] [2021-03-11 14:04:14,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:14,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:14,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:14,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897542964] [2021-03-11 14:04:14,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:14,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:14,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192878601] [2021-03-11 14:04:14,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:14,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:14,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:14,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,687 INFO L87 Difference]: Start difference. First operand has 222 states, 209 states have (on average 3.1435406698564594) internal successors, (657), 221 states have internal predecessors, (657), 0 states have call successors, (0), 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-03-11 14:04:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:14,698 INFO L93 Difference]: Finished difference Result 159 states and 465 transitions. [2021-03-11 14:04:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:14,698 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-03-11 14:04:14,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:14,700 INFO L225 Difference]: With dead ends: 159 [2021-03-11 14:04:14,700 INFO L226 Difference]: Without dead ends: 96 [2021-03-11 14:04:14,700 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-03-11 14:04:14,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-03-11 14:04:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.873684210526316) internal successors, (273), 95 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 273 transitions. [2021-03-11 14:04:14,709 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 273 transitions. Word has length 2 [2021-03-11 14:04:14,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:14,709 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 273 transitions. [2021-03-11 14:04:14,709 INFO L481 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-03-11 14:04:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 273 transitions. [2021-03-11 14:04:14,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-03-11 14:04:14,710 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,710 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:04:14,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 14:04:14,710 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,711 INFO L82 PathProgramCache]: Analyzing trace with hash 458500947, now seen corresponding path program 1 times [2021-03-11 14:04:14,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889695422] [2021-03-11 14:04:14,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,714 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,716 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,717 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:14,717 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:14,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 14:04:14,717 WARN L342 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:14,717 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2021-03-11 14:04:14,725 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:14,725 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:14,726 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:14,726 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:14,726 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:14,726 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:14,726 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:14,726 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:14,726 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:14,726 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:14,727 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:14,727 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 23 transitions, 106 flow [2021-03-11 14:04:14,727 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 106 flow [2021-03-11 14:04:14,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 106 flow [2021-03-11 14:04:14,732 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-11 14:04:14,732 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:14,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2021-03-11 14:04:14,733 INFO L116 LiptonReduction]: Number of co-enabled transitions 276 [2021-03-11 14:04:14,835 INFO L131 LiptonReduction]: Checked pairs total: 210 [2021-03-11 14:04:14,836 INFO L133 LiptonReduction]: Total number of compositions: 7 [2021-03-11 14:04:14,838 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 16 transitions, 92 flow [2021-03-11 14:04:14,852 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 446 states, 431 states have (on average 3.566125290023202) internal successors, (1537), 445 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 446 states, 431 states have (on average 3.566125290023202) internal successors, (1537), 445 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:14,853 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,853 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:14,853 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash 4675, now seen corresponding path program 1 times [2021-03-11 14:04:14,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094857743] [2021-03-11 14:04:14,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:14,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:14,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:14,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094857743] [2021-03-11 14:04:14,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:14,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:14,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845431325] [2021-03-11 14:04:14,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:14,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:14,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:14,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,869 INFO L87 Difference]: Start difference. First operand has 446 states, 431 states have (on average 3.566125290023202) internal successors, (1537), 445 states have internal predecessors, (1537), 0 states have call successors, (0), 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-03-11 14:04:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:14,887 INFO L93 Difference]: Finished difference Result 319 states and 1089 transitions. [2021-03-11 14:04:14,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:14,887 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-03-11 14:04:14,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:14,893 INFO L225 Difference]: With dead ends: 319 [2021-03-11 14:04:14,893 INFO L226 Difference]: Without dead ends: 192 [2021-03-11 14:04:14,894 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-03-11 14:04:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2021-03-11 14:04:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 3.356020942408377) internal successors, (641), 191 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 641 transitions. [2021-03-11 14:04:14,913 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 641 transitions. Word has length 2 [2021-03-11 14:04:14,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:14,913 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 641 transitions. [2021-03-11 14:04:14,913 INFO L481 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-03-11 14:04:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 641 transitions. [2021-03-11 14:04:14,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-03-11 14:04:14,914 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:14,914 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:04:14,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 14:04:14,914 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:14,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:14,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1304549903, now seen corresponding path program 1 times [2021-03-11 14:04:14,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:14,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841457085] [2021-03-11 14:04:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,918 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:14,924 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:14,927 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:14,928 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:14,928 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 14:04:14,928 WARN L342 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:14,929 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2021-03-11 14:04:14,938 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:14,938 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:14,939 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:14,939 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:14,939 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:14,939 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:14,939 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:14,939 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:14,939 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:14,939 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:14,941 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:14,941 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 129 flow [2021-03-11 14:04:14,941 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 129 flow [2021-03-11 14:04:14,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 26 transitions, 129 flow [2021-03-11 14:04:14,949 INFO L129 PetriNetUnfolder]: 0/47 cut-off events. [2021-03-11 14:04:14,950 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:14,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 47 events. 0/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 166 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2021-03-11 14:04:14,950 INFO L116 LiptonReduction]: Number of co-enabled transitions 364 [2021-03-11 14:04:15,083 INFO L131 LiptonReduction]: Checked pairs total: 280 [2021-03-11 14:04:15,083 INFO L133 LiptonReduction]: Total number of compositions: 8 [2021-03-11 14:04:15,084 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 18 transitions, 113 flow [2021-03-11 14:04:15,122 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 894 states, 877 states have (on average 4.014823261117446) internal successors, (3521), 893 states have internal predecessors, (3521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 894 states, 877 states have (on average 4.014823261117446) internal successors, (3521), 893 states have internal predecessors, (3521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:15,124 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:15,124 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:15,124 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:15,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:15,125 INFO L82 PathProgramCache]: Analyzing trace with hash 5731, now seen corresponding path program 1 times [2021-03-11 14:04:15,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:15,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995688426] [2021-03-11 14:04:15,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:15,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:15,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:15,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995688426] [2021-03-11 14:04:15,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:15,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:15,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180285881] [2021-03-11 14:04:15,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:15,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:15,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:15,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:15,142 INFO L87 Difference]: Start difference. First operand has 894 states, 877 states have (on average 4.014823261117446) internal successors, (3521), 893 states have internal predecessors, (3521), 0 states have call successors, (0), 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-03-11 14:04:15,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:15,164 INFO L93 Difference]: Finished difference Result 639 states and 2497 transitions. [2021-03-11 14:04:15,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:15,164 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-03-11 14:04:15,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:15,169 INFO L225 Difference]: With dead ends: 639 [2021-03-11 14:04:15,169 INFO L226 Difference]: Without dead ends: 384 [2021-03-11 14:04:15,170 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:15,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-03-11 14:04:15,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2021-03-11 14:04:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.845953002610966) internal successors, (1473), 383 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1473 transitions. [2021-03-11 14:04:15,197 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1473 transitions. Word has length 2 [2021-03-11 14:04:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:15,197 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 1473 transitions. [2021-03-11 14:04:15,197 INFO L481 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-03-11 14:04:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1473 transitions. [2021-03-11 14:04:15,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-03-11 14:04:15,199 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:15,200 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:04:15,200 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 14:04:15,200 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:15,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1599302192, now seen corresponding path program 1 times [2021-03-11 14:04:15,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:15,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782982315] [2021-03-11 14:04:15,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:15,213 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:15,225 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:15,226 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:15,226 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:15,226 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 14:04:15,226 WARN L342 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:15,226 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2021-03-11 14:04:15,239 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:15,240 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:15,243 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:15,243 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:15,243 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:15,243 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:15,243 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:15,243 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:15,243 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:15,243 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:15,245 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:15,246 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 29 transitions, 154 flow [2021-03-11 14:04:15,246 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 29 transitions, 154 flow [2021-03-11 14:04:15,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 29 transitions, 154 flow [2021-03-11 14:04:15,255 INFO L129 PetriNetUnfolder]: 0/53 cut-off events. [2021-03-11 14:04:15,256 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:15,256 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 53 events. 0/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 185 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2021-03-11 14:04:15,256 INFO L116 LiptonReduction]: Number of co-enabled transitions 464 [2021-03-11 14:04:15,423 INFO L131 LiptonReduction]: Checked pairs total: 360 [2021-03-11 14:04:15,423 INFO L133 LiptonReduction]: Total number of compositions: 9 [2021-03-11 14:04:15,426 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 20 transitions, 136 flow [2021-03-11 14:04:15,501 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1790 states, 1771 states have (on average 4.481648785996612) internal successors, (7937), 1789 states have internal predecessors, (7937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 1790 states, 1771 states have (on average 4.481648785996612) internal successors, (7937), 1789 states have internal predecessors, (7937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:15,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:15,506 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:15,506 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:15,506 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:15,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:15,507 INFO L82 PathProgramCache]: Analyzing trace with hash 6915, now seen corresponding path program 1 times [2021-03-11 14:04:15,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:15,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137613813] [2021-03-11 14:04:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:15,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:15,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:15,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137613813] [2021-03-11 14:04:15,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:15,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:15,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358695224] [2021-03-11 14:04:15,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:15,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:15,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:15,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:15,522 INFO L87 Difference]: Start difference. First operand has 1790 states, 1771 states have (on average 4.481648785996612) internal successors, (7937), 1789 states have internal predecessors, (7937), 0 states have call successors, (0), 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-03-11 14:04:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:15,542 INFO L93 Difference]: Finished difference Result 1279 states and 5633 transitions. [2021-03-11 14:04:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:15,542 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-03-11 14:04:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:15,547 INFO L225 Difference]: With dead ends: 1279 [2021-03-11 14:04:15,547 INFO L226 Difference]: Without dead ends: 768 [2021-03-11 14:04:15,547 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-03-11 14:04:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2021-03-11 14:04:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 4.340286831812255) internal successors, (3329), 767 states have internal predecessors, (3329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 3329 transitions. [2021-03-11 14:04:15,575 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 3329 transitions. Word has length 2 [2021-03-11 14:04:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:15,575 INFO L480 AbstractCegarLoop]: Abstraction has 768 states and 3329 transitions. [2021-03-11 14:04:15,575 INFO L481 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-03-11 14:04:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 3329 transitions. [2021-03-11 14:04:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-03-11 14:04:15,576 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:15,576 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:04:15,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 14:04:15,576 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:15,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:15,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1756765292, now seen corresponding path program 1 times [2021-03-11 14:04:15,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:15,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566142856] [2021-03-11 14:04:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:15,579 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:15,606 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:15,607 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:15,607 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:15,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 14:04:15,607 WARN L342 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:15,607 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2021-03-11 14:04:15,624 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:15,625 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:15,625 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:15,625 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:15,625 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:15,625 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:15,625 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:15,625 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:15,625 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:15,625 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:15,626 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:15,626 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 32 transitions, 181 flow [2021-03-11 14:04:15,626 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 32 transitions, 181 flow [2021-03-11 14:04:15,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 32 transitions, 181 flow [2021-03-11 14:04:15,634 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2021-03-11 14:04:15,634 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:15,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 59 events. 0/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 216 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2021-03-11 14:04:15,635 INFO L116 LiptonReduction]: Number of co-enabled transitions 576 [2021-03-11 14:04:15,734 INFO L131 LiptonReduction]: Checked pairs total: 450 [2021-03-11 14:04:15,734 INFO L133 LiptonReduction]: Total number of compositions: 10 [2021-03-11 14:04:15,736 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 22 transitions, 161 flow [2021-03-11 14:04:15,889 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3582 states, 3561 states have (on average 4.960685200786296) internal successors, (17665), 3581 states have internal predecessors, (17665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:15,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 3582 states, 3561 states have (on average 4.960685200786296) internal successors, (17665), 3581 states have internal predecessors, (17665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:15,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:15,900 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:15,900 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:15,900 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash 8227, now seen corresponding path program 1 times [2021-03-11 14:04:15,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:15,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376475337] [2021-03-11 14:04:15,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:15,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:15,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:15,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376475337] [2021-03-11 14:04:15,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:15,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:15,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388041203] [2021-03-11 14:04:15,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:15,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:15,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:15,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:15,917 INFO L87 Difference]: Start difference. First operand has 3582 states, 3561 states have (on average 4.960685200786296) internal successors, (17665), 3581 states have internal predecessors, (17665), 0 states have call successors, (0), 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-03-11 14:04:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:15,949 INFO L93 Difference]: Finished difference Result 2559 states and 12545 transitions. [2021-03-11 14:04:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:15,950 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-03-11 14:04:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:15,960 INFO L225 Difference]: With dead ends: 2559 [2021-03-11 14:04:15,960 INFO L226 Difference]: Without dead ends: 1536 [2021-03-11 14:04:15,960 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:16,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2021-03-11 14:04:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1536. [2021-03-11 14:04:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1535 states have (on average 4.837133550488599) internal successors, (7425), 1535 states have internal predecessors, (7425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 7425 transitions. [2021-03-11 14:04:16,045 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 7425 transitions. Word has length 2 [2021-03-11 14:04:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:16,046 INFO L480 AbstractCegarLoop]: Abstraction has 1536 states and 7425 transitions. [2021-03-11 14:04:16,046 INFO L481 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-03-11 14:04:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 7425 transitions. [2021-03-11 14:04:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-03-11 14:04:16,049 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:16,049 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:04:16,050 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-11 14:04:16,050 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:16,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:16,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1145512803, now seen corresponding path program 1 times [2021-03-11 14:04:16,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:16,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006492172] [2021-03-11 14:04:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:16,053 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:16,060 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:16,062 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:16,062 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:16,063 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-11 14:04:16,063 WARN L342 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:16,063 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2021-03-11 14:04:16,072 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:16,072 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:16,073 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:16,073 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:16,073 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:16,073 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:16,073 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:16,073 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:16,073 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:16,073 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:16,074 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:16,074 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 35 transitions, 210 flow [2021-03-11 14:04:16,074 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 35 transitions, 210 flow [2021-03-11 14:04:16,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 35 transitions, 210 flow [2021-03-11 14:04:16,080 INFO L129 PetriNetUnfolder]: 0/65 cut-off events. [2021-03-11 14:04:16,080 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:16,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 65 events. 0/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 234 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2021-03-11 14:04:16,081 INFO L116 LiptonReduction]: Number of co-enabled transitions 700 [2021-03-11 14:04:16,185 INFO L131 LiptonReduction]: Checked pairs total: 550 [2021-03-11 14:04:16,185 INFO L133 LiptonReduction]: Total number of compositions: 11 [2021-03-11 14:04:16,186 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 24 transitions, 188 flow [2021-03-11 14:04:16,565 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 7166 states, 7143 states have (on average 5.4477110457790845) internal successors, (38913), 7165 states have internal predecessors, (38913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 7166 states, 7143 states have (on average 5.4477110457790845) internal successors, (38913), 7165 states have internal predecessors, (38913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:16,581 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:16,581 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:16,581 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:16,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:16,582 INFO L82 PathProgramCache]: Analyzing trace with hash 9667, now seen corresponding path program 1 times [2021-03-11 14:04:16,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:16,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029168935] [2021-03-11 14:04:16,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:16,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:16,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:16,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029168935] [2021-03-11 14:04:16,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:16,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:16,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769435290] [2021-03-11 14:04:16,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:16,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:16,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:16,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:16,604 INFO L87 Difference]: Start difference. First operand has 7166 states, 7143 states have (on average 5.4477110457790845) internal successors, (38913), 7165 states have internal predecessors, (38913), 0 states have call successors, (0), 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-03-11 14:04:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:16,680 INFO L93 Difference]: Finished difference Result 5119 states and 27649 transitions. [2021-03-11 14:04:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:16,681 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-03-11 14:04:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:16,708 INFO L225 Difference]: With dead ends: 5119 [2021-03-11 14:04:16,708 INFO L226 Difference]: Without dead ends: 3072 [2021-03-11 14:04:16,709 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2021-03-11 14:04:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2021-03-11 14:04:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3071 states have (on average 5.335395636600456) internal successors, (16385), 3071 states have internal predecessors, (16385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 16385 transitions. [2021-03-11 14:04:16,953 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 16385 transitions. Word has length 2 [2021-03-11 14:04:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:16,954 INFO L480 AbstractCegarLoop]: Abstraction has 3072 states and 16385 transitions. [2021-03-11 14:04:16,954 INFO L481 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-03-11 14:04:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 16385 transitions. [2021-03-11 14:04:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-03-11 14:04:16,955 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:16,955 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:04:16,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-11 14:04:16,955 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:16,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:16,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1725822537, now seen corresponding path program 1 times [2021-03-11 14:04:16,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:16,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222746507] [2021-03-11 14:04:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:16,958 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:16,960 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:16,961 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:16,961 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:16,961 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-11 14:04:16,961 WARN L342 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:16,961 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2021-03-11 14:04:16,972 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:16,972 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:16,972 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:16,972 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:16,972 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:16,972 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:16,972 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:16,972 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:16,972 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:16,973 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:16,973 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:16,973 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 38 transitions, 241 flow [2021-03-11 14:04:16,973 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 38 transitions, 241 flow [2021-03-11 14:04:16,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 38 transitions, 241 flow [2021-03-11 14:04:16,977 INFO L129 PetriNetUnfolder]: 0/71 cut-off events. [2021-03-11 14:04:16,977 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:16,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 71 events. 0/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 257 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2021-03-11 14:04:16,978 INFO L116 LiptonReduction]: Number of co-enabled transitions 836 [2021-03-11 14:04:17,075 INFO L131 LiptonReduction]: Checked pairs total: 660 [2021-03-11 14:04:17,075 INFO L133 LiptonReduction]: Total number of compositions: 12 [2021-03-11 14:04:17,076 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 26 transitions, 217 flow [2021-03-11 14:04:18,249 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14334 states, 14309 states have (on average 5.939828080229226) internal successors, (84993), 14333 states have internal predecessors, (84993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 14334 states, 14309 states have (on average 5.939828080229226) internal successors, (84993), 14333 states have internal predecessors, (84993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:18,271 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:18,271 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:18,271 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:18,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:18,271 INFO L82 PathProgramCache]: Analyzing trace with hash 11235, now seen corresponding path program 1 times [2021-03-11 14:04:18,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:18,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435952625] [2021-03-11 14:04:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:18,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:18,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:18,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435952625] [2021-03-11 14:04:18,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:18,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:18,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813458571] [2021-03-11 14:04:18,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:18,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:18,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:18,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:18,309 INFO L87 Difference]: Start difference. First operand has 14334 states, 14309 states have (on average 5.939828080229226) internal successors, (84993), 14333 states have internal predecessors, (84993), 0 states have call successors, (0), 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-03-11 14:04:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:18,494 INFO L93 Difference]: Finished difference Result 10239 states and 60417 transitions. [2021-03-11 14:04:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:18,495 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-03-11 14:04:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:18,542 INFO L225 Difference]: With dead ends: 10239 [2021-03-11 14:04:18,543 INFO L226 Difference]: Without dead ends: 6144 [2021-03-11 14:04:18,543 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6144 states. [2021-03-11 14:04:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6144 to 6144. [2021-03-11 14:04:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6144 states, 6143 states have (on average 5.834445710564871) internal successors, (35841), 6143 states have internal predecessors, (35841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6144 states to 6144 states and 35841 transitions. [2021-03-11 14:04:19,230 INFO L78 Accepts]: Start accepts. Automaton has 6144 states and 35841 transitions. Word has length 2 [2021-03-11 14:04:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:19,231 INFO L480 AbstractCegarLoop]: Abstraction has 6144 states and 35841 transitions. [2021-03-11 14:04:19,231 INFO L481 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-03-11 14:04:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 6144 states and 35841 transitions. [2021-03-11 14:04:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 14:04:19,233 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:19,233 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:04:19,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-11 14:04:19,233 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:19,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:19,233 INFO L82 PathProgramCache]: Analyzing trace with hash 772943002, now seen corresponding path program 1 times [2021-03-11 14:04:19,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:19,234 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211920136] [2021-03-11 14:04:19,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:19,237 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:19,238 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:19,240 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:19,240 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:19,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-11 14:04:19,240 WARN L342 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:19,240 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2021-03-11 14:04:19,323 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:19,323 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:19,323 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:19,323 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:19,323 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:19,323 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:19,323 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:19,323 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:19,323 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:19,323 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:19,324 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:19,324 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 41 transitions, 274 flow [2021-03-11 14:04:19,324 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 41 transitions, 274 flow [2021-03-11 14:04:19,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 41 transitions, 274 flow [2021-03-11 14:04:19,328 INFO L129 PetriNetUnfolder]: 0/77 cut-off events. [2021-03-11 14:04:19,328 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:19,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 77 events. 0/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 295 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 0. Up to 13 conditions per place. [2021-03-11 14:04:19,329 INFO L116 LiptonReduction]: Number of co-enabled transitions 984 [2021-03-11 14:04:19,603 INFO L131 LiptonReduction]: Checked pairs total: 780 [2021-03-11 14:04:19,603 INFO L133 LiptonReduction]: Total number of compositions: 13 [2021-03-11 14:04:19,604 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 28 transitions, 248 flow [2021-03-11 14:04:23,221 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 28670 states, 28643 states have (on average 6.435115036832734) internal successors, (184321), 28669 states have internal predecessors, (184321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:23,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 28670 states, 28643 states have (on average 6.435115036832734) internal successors, (184321), 28669 states have internal predecessors, (184321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:23,266 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:23,266 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:23,266 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:23,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:23,266 INFO L82 PathProgramCache]: Analyzing trace with hash 12931, now seen corresponding path program 1 times [2021-03-11 14:04:23,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:23,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389208578] [2021-03-11 14:04:23,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:23,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:23,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:23,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389208578] [2021-03-11 14:04:23,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:23,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:23,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954888240] [2021-03-11 14:04:23,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:23,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:23,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:23,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:23,318 INFO L87 Difference]: Start difference. First operand has 28670 states, 28643 states have (on average 6.435115036832734) internal successors, (184321), 28669 states have internal predecessors, (184321), 0 states have call successors, (0), 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-03-11 14:04:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:23,645 INFO L93 Difference]: Finished difference Result 20479 states and 131073 transitions. [2021-03-11 14:04:23,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:23,646 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-03-11 14:04:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:23,712 INFO L225 Difference]: With dead ends: 20479 [2021-03-11 14:04:23,712 INFO L226 Difference]: Without dead ends: 12288 [2021-03-11 14:04:23,712 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12288 states. [2021-03-11 14:04:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12288 to 12288. [2021-03-11 14:04:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12288 states, 12287 states have (on average 6.333930170098478) internal successors, (77825), 12287 states have internal predecessors, (77825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12288 states to 12288 states and 77825 transitions. [2021-03-11 14:04:26,047 INFO L78 Accepts]: Start accepts. Automaton has 12288 states and 77825 transitions. Word has length 2 [2021-03-11 14:04:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:26,047 INFO L480 AbstractCegarLoop]: Abstraction has 12288 states and 77825 transitions. [2021-03-11 14:04:26,047 INFO L481 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-03-11 14:04:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 12288 states and 77825 transitions. [2021-03-11 14:04:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-03-11 14:04:26,051 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:26,051 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:04:26,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-11 14:04:26,051 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:26,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:26,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1612747174, now seen corresponding path program 1 times [2021-03-11 14:04:26,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:26,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895043505] [2021-03-11 14:04:26,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:26,064 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:26,067 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:26,071 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:26,071 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:26,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-11 14:04:26,072 WARN L342 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:26,072 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2021-03-11 14:04:26,087 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:26,087 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:26,089 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:26,089 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:26,089 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:26,089 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:26,089 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:26,089 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:26,089 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:26,089 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:26,090 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:26,090 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 44 transitions, 309 flow [2021-03-11 14:04:26,090 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 44 transitions, 309 flow [2021-03-11 14:04:26,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 44 transitions, 309 flow [2021-03-11 14:04:26,098 INFO L129 PetriNetUnfolder]: 0/83 cut-off events. [2021-03-11 14:04:26,098 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:26,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 83 events. 0/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 304 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 0. Up to 14 conditions per place. [2021-03-11 14:04:26,100 INFO L116 LiptonReduction]: Number of co-enabled transitions 1144 [2021-03-11 14:04:26,384 INFO L131 LiptonReduction]: Checked pairs total: 910 [2021-03-11 14:04:26,384 INFO L133 LiptonReduction]: Total number of compositions: 14 [2021-03-11 14:04:26,385 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 30 transitions, 281 flow [2021-03-11 14:04:40,834 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 57342 states, 57313 states have (on average 6.932336468166036) internal successors, (397313), 57341 states have internal predecessors, (397313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 57342 states, 57313 states have (on average 6.932336468166036) internal successors, (397313), 57341 states have internal predecessors, (397313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:04:40,915 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:40,915 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:04:40,915 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:40,915 INFO L82 PathProgramCache]: Analyzing trace with hash 14755, now seen corresponding path program 1 times [2021-03-11 14:04:40,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:40,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124687703] [2021-03-11 14:04:40,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:04:40,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:04:40,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:04:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:04:40,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124687703] [2021-03-11 14:04:40,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:04:40,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:04:40,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499680698] [2021-03-11 14:04:40,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:04:40,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:04:40,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:04:40,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:41,013 INFO L87 Difference]: Start difference. First operand has 57342 states, 57313 states have (on average 6.932336468166036) internal successors, (397313), 57341 states have internal predecessors, (397313), 0 states have call successors, (0), 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-03-11 14:04:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:04:41,650 INFO L93 Difference]: Finished difference Result 40959 states and 282625 transitions. [2021-03-11 14:04:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:04:41,650 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-03-11 14:04:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:04:41,828 INFO L225 Difference]: With dead ends: 40959 [2021-03-11 14:04:41,828 INFO L226 Difference]: Without dead ends: 24576 [2021-03-11 14:04:41,828 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:04:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24576 states. [2021-03-11 14:04:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24576 to 24576. [2021-03-11 14:04:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24576 states, 24575 states have (on average 6.833652085452695) internal successors, (167937), 24575 states have internal predecessors, (167937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:04:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24576 states to 24576 states and 167937 transitions. [2021-03-11 14:04:49,430 INFO L78 Accepts]: Start accepts. Automaton has 24576 states and 167937 transitions. Word has length 2 [2021-03-11 14:04:49,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:04:49,430 INFO L480 AbstractCegarLoop]: Abstraction has 24576 states and 167937 transitions. [2021-03-11 14:04:49,430 INFO L481 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-03-11 14:04:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 24576 states and 167937 transitions. [2021-03-11 14:04:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 14:04:49,436 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:04:49,437 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:04:49,437 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-11 14:04:49,437 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:04:49,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:04:49,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2106590247, now seen corresponding path program 1 times [2021-03-11 14:04:49,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:04:49,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998912292] [2021-03-11 14:04:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:04:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:49,440 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:04:49,441 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:04:49,442 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:04:49,443 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:04:49,443 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-11 14:04:49,443 WARN L342 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:04:49,443 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2021-03-11 14:04:49,479 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:04:49,480 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:04:49,480 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:04:49,480 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:04:49,480 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:04:49,480 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:04:49,480 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:04:49,480 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:04:49,480 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:04:49,480 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:04:49,481 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:04:49,481 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 47 transitions, 346 flow [2021-03-11 14:04:49,481 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 47 transitions, 346 flow [2021-03-11 14:04:49,481 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 47 transitions, 346 flow [2021-03-11 14:04:49,485 INFO L129 PetriNetUnfolder]: 0/89 cut-off events. [2021-03-11 14:04:49,485 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:04:49,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 89 events. 0/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 346 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. [2021-03-11 14:04:49,486 INFO L116 LiptonReduction]: Number of co-enabled transitions 1316 [2021-03-11 14:04:49,748 INFO L131 LiptonReduction]: Checked pairs total: 1050 [2021-03-11 14:04:49,748 INFO L133 LiptonReduction]: Total number of compositions: 15 [2021-03-11 14:04:49,749 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 32 transitions, 316 flow [2021-03-11 14:05:47,662 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 114686 states, 114655 states have (on average 7.430718241681566) internal successors, (851969), 114685 states have internal predecessors, (851969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:05:48,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 114686 states, 114655 states have (on average 7.430718241681566) internal successors, (851969), 114685 states have internal predecessors, (851969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:05:48,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:05:48,062 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:05:48,062 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:05:48,062 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:05:48,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:05:48,062 INFO L82 PathProgramCache]: Analyzing trace with hash 16707, now seen corresponding path program 1 times [2021-03-11 14:05:48,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:05:48,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375640821] [2021-03-11 14:05:48,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:05:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:05:48,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:05:48,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:05:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:05:48,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375640821] [2021-03-11 14:05:48,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:05:48,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:05:48,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559616124] [2021-03-11 14:05:48,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:05:48,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:05:48,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:05:48,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:05:48,241 INFO L87 Difference]: Start difference. First operand has 114686 states, 114655 states have (on average 7.430718241681566) internal successors, (851969), 114685 states have internal predecessors, (851969), 0 states have call successors, (0), 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-03-11 14:05:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:05:49,476 INFO L93 Difference]: Finished difference Result 81919 states and 606209 transitions. [2021-03-11 14:05:49,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:05:49,476 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-03-11 14:05:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:05:49,796 INFO L225 Difference]: With dead ends: 81919 [2021-03-11 14:05:49,797 INFO L226 Difference]: Without dead ends: 49152 [2021-03-11 14:05:49,797 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:06:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49152 states. [2021-03-11 14:06:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49152 to 49152. [2021-03-11 14:06:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49152 states, 49151 states have (on average 7.333502878883441) internal successors, (360449), 49151 states have internal predecessors, (360449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:06:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49152 states to 49152 states and 360449 transitions. [2021-03-11 14:06:18,135 INFO L78 Accepts]: Start accepts. Automaton has 49152 states and 360449 transitions. Word has length 2 [2021-03-11 14:06:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:06:18,140 INFO L480 AbstractCegarLoop]: Abstraction has 49152 states and 360449 transitions. [2021-03-11 14:06:18,140 INFO L481 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-03-11 14:06:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand 49152 states and 360449 transitions. [2021-03-11 14:06:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 14:06:18,176 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:06:18,176 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:06:18,176 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-11 14:06:18,176 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:06:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:06:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2129139843, now seen corresponding path program 1 times [2021-03-11 14:06:18,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:06:18,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552565976] [2021-03-11 14:06:18,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:06:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:06:18,189 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:06:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:06:18,194 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:06:18,203 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:06:18,203 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:06:18,203 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-11 14:06:18,203 WARN L342 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:06:18,204 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2021-03-11 14:06:18,217 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:06:18,217 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:06:18,218 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:06:18,218 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:06:18,218 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:06:18,218 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:06:18,218 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:06:18,218 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:06:18,218 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:06:18,218 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:06:18,219 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:06:18,219 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 50 transitions, 385 flow [2021-03-11 14:06:18,219 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 50 transitions, 385 flow [2021-03-11 14:06:18,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 50 transitions, 385 flow [2021-03-11 14:06:18,224 INFO L129 PetriNetUnfolder]: 0/95 cut-off events. [2021-03-11 14:06:18,224 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:06:18,224 INFO L84 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 95 events. 0/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 301 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 0. Up to 16 conditions per place. [2021-03-11 14:06:18,225 INFO L116 LiptonReduction]: Number of co-enabled transitions 1500 [2021-03-11 14:06:18,518 INFO L131 LiptonReduction]: Checked pairs total: 1200 [2021-03-11 14:06:18,519 INFO L133 LiptonReduction]: Total number of compositions: 16 [2021-03-11 14:06:18,520 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 34 transitions, 353 flow [2021-03-11 14:12:04,215 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 229374 states, 229341 states have (on average 7.929785777510345) internal successors, (1818625), 229373 states have internal predecessors, (1818625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:12:04,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 229374 states, 229341 states have (on average 7.929785777510345) internal successors, (1818625), 229373 states have internal predecessors, (1818625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:12:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-03-11 14:12:04,675 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:12:04,676 INFO L519 BasicCegarLoop]: trace histogram [1, 1] [2021-03-11 14:12:04,676 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:12:04,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:12:04,676 INFO L82 PathProgramCache]: Analyzing trace with hash 18787, now seen corresponding path program 1 times [2021-03-11 14:12:04,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:12:04,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273021825] [2021-03-11 14:12:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:12:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 14:12:04,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 14:12:04,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 14:12:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 14:12:04,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273021825] [2021-03-11 14:12:04,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 14:12:04,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 14:12:04,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310577842] [2021-03-11 14:12:04,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 14:12:04,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 14:12:04,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 14:12:04,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:12:05,073 INFO L87 Difference]: Start difference. First operand has 229374 states, 229341 states have (on average 7.929785777510345) internal successors, (1818625), 229373 states have internal predecessors, (1818625), 0 states have call successors, (0), 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-03-11 14:12:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 14:12:08,028 INFO L93 Difference]: Finished difference Result 163839 states and 1294337 transitions. [2021-03-11 14:12:08,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 14:12:08,029 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-03-11 14:12:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 14:12:09,083 INFO L225 Difference]: With dead ends: 163839 [2021-03-11 14:12:09,083 INFO L226 Difference]: Without dead ends: 98304 [2021-03-11 14:12:09,083 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 14:13:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98304 states. [2021-03-11 14:13:58,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98304 to 98304. [2021-03-11 14:13:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98304 states, 98303 states have (on average 7.833423191560787) internal successors, (770049), 98303 states have internal predecessors, (770049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 14:14:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98304 states to 98304 states and 770049 transitions. [2021-03-11 14:14:00,110 INFO L78 Accepts]: Start accepts. Automaton has 98304 states and 770049 transitions. Word has length 2 [2021-03-11 14:14:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 14:14:00,110 INFO L480 AbstractCegarLoop]: Abstraction has 98304 states and 770049 transitions. [2021-03-11 14:14:00,110 INFO L481 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-03-11 14:14:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 98304 states and 770049 transitions. [2021-03-11 14:14:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 14:14:00,128 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 14:14:00,128 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 14:14:00,128 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-03-11 14:14:00,128 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-11 14:14:00,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 14:14:00,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1791364420, now seen corresponding path program 1 times [2021-03-11 14:14:00,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 14:14:00,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371063645] [2021-03-11 14:14:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 14:14:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:14:00,132 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:14:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 14:14:00,133 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 14:14:00,135 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 14:14:00,135 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 14:14:00,135 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-03-11 14:14:00,135 WARN L342 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2021-03-11 14:14:00,135 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2021-03-11 14:14:00,156 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 14:14:00,157 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-03-11 14:14:00,157 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 14:14:00,157 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 14:14:00,157 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 14:14:00,157 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 14:14:00,157 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 14:14:00,157 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 14:14:00,157 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 14:14:00,157 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 14:14:00,158 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 14:14:00,158 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 53 transitions, 426 flow [2021-03-11 14:14:00,159 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 53 transitions, 426 flow [2021-03-11 14:14:00,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 53 transitions, 426 flow [2021-03-11 14:14:00,165 INFO L129 PetriNetUnfolder]: 0/101 cut-off events. [2021-03-11 14:14:00,165 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 14:14:00,165 INFO L84 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 101 events. 0/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 328 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 0. Up to 17 conditions per place. [2021-03-11 14:14:00,167 INFO L116 LiptonReduction]: Number of co-enabled transitions 1696 [2021-03-11 14:14:00,800 INFO L131 LiptonReduction]: Checked pairs total: 1360 [2021-03-11 14:14:00,801 INFO L133 LiptonReduction]: Total number of compositions: 17 [2021-03-11 14:14:00,803 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 36 transitions, 392 flow Received shutdown request... [2021-03-11 14:18:41,318 WARN L545 AbstractCegarLoop]: Verification canceled [2021-03-11 14:18:41,320 WARN L224 ceAbstractionStarter]: Timeout [2021-03-11 14:18:41,320 INFO L202 PluginConnector]: Adding new model fork_loop_inc.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 02:18:41 BasicIcfg [2021-03-11 14:18:41,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 14:18:41,321 INFO L168 Benchmark]: Toolchain (without parser) took 867637.77 ms. Allocated memory was 255.9 MB in the beginning and 6.7 GB in the end (delta: 6.5 GB). Free memory was 237.8 MB in the beginning and 3.9 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.4 GB. Max. memory is 16.0 GB. [2021-03-11 14:18:41,321 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory was 238.8 MB in the beginning and 238.7 MB in the end (delta: 92.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 14:18:41,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.17 ms. Allocated memory is still 255.9 MB. Free memory was 237.3 MB in the beginning and 235.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 14:18:41,321 INFO L168 Benchmark]: Boogie Preprocessor took 10.84 ms. Allocated memory is still 255.9 MB. Free memory was 235.8 MB in the beginning and 234.9 MB in the end (delta: 900.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 14:18:41,322 INFO L168 Benchmark]: RCFGBuilder took 153.39 ms. Allocated memory is still 255.9 MB. Free memory was 234.9 MB in the beginning and 226.9 MB in the end (delta: 7.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. [2021-03-11 14:18:41,322 INFO L168 Benchmark]: TraceAbstraction took 867438.62 ms. Allocated memory was 255.9 MB in the beginning and 6.7 GB in the end (delta: 6.5 GB). Free memory was 226.5 MB in the beginning and 3.9 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.3 GB. Max. memory is 16.0 GB. [2021-03-11 14:18:41,323 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.11 ms. Allocated memory is still 255.9 MB. Free memory was 238.8 MB in the beginning and 238.7 MB in the end (delta: 92.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 20.17 ms. Allocated memory is still 255.9 MB. Free memory was 237.3 MB in the beginning and 235.8 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 10.84 ms. Allocated memory is still 255.9 MB. Free memory was 235.8 MB in the beginning and 234.9 MB in the end (delta: 900.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 153.39 ms. Allocated memory is still 255.9 MB. Free memory was 234.9 MB in the beginning and 226.9 MB in the end (delta: 7.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 867438.62 ms. Allocated memory was 255.9 MB in the beginning and 6.7 GB in the end (delta: 6.5 GB). Free memory was 226.5 MB in the beginning and 3.9 GB in the end (delta: -3.7 GB). Peak memory consumption was 4.3 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.5ms, 11 PlacesBefore, 9 PlacesAfterwards, 8 TransitionsBefore, 6 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 10 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63.2ms, 16 PlacesBefore, 13 PlacesAfterwards, 11 TransitionsBefore, 8 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 77.7ms, 21 PlacesBefore, 17 PlacesAfterwards, 14 TransitionsBefore, 10 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 60 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 57, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 48, unknown conditional: 0, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 53.5ms, 26 PlacesBefore, 21 PlacesAfterwards, 17 TransitionsBefore, 12 TransitionsAfterwards, 136 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 100 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 91.5ms, 31 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 14 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 150 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 137, positive: 132, positive conditional: 0, positive unconditional: 132, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 116, positive: 111, positive conditional: 0, positive unconditional: 111, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 116, positive: 85, positive conditional: 0, positive unconditional: 85, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 137, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 116, unknown conditional: 0, unknown unconditional: 116] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 108.5ms, 36 PlacesBefore, 29 PlacesAfterwards, 23 TransitionsBefore, 16 TransitionsAfterwards, 276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 210 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 179, positive: 173, positive conditional: 0, positive unconditional: 173, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 153, positive: 147, positive conditional: 0, positive unconditional: 147, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 153, positive: 120, positive conditional: 0, positive unconditional: 120, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 153, unknown conditional: 0, unknown unconditional: 153] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 142.0ms, 41 PlacesBefore, 33 PlacesAfterwards, 26 TransitionsBefore, 18 TransitionsAfterwards, 364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 280 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 249, positive: 242, positive conditional: 0, positive unconditional: 242, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 212, positive: 205, positive conditional: 0, positive unconditional: 205, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 212, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 92, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 249, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 212, unknown conditional: 0, unknown unconditional: 212] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 177.2ms, 46 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 20 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 360 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 360, positive: 352, positive conditional: 0, positive unconditional: 352, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 296, positive: 288, positive conditional: 0, positive unconditional: 288, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 296, positive: 216, positive conditional: 0, positive unconditional: 216, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, positive: 112, positive conditional: 0, positive unconditional: 112, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 360, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 296, unknown conditional: 0, unknown unconditional: 296] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 108.4ms, 51 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 22 TransitionsAfterwards, 576 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 450 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 285, positive: 276, positive conditional: 0, positive unconditional: 276, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 276, positive: 267, positive conditional: 0, positive unconditional: 267, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 276, positive: 249, positive conditional: 0, positive unconditional: 249, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 285, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 276, unknown conditional: 0, unknown unconditional: 276] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 110.9ms, 56 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 700 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 339, positive: 329, positive conditional: 0, positive unconditional: 329, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 312, positive: 302, positive conditional: 0, positive unconditional: 302, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 312, positive: 268, positive conditional: 0, positive unconditional: 268, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 339, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 312, unknown conditional: 0, unknown unconditional: 312] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 101.8ms, 61 PlacesBefore, 49 PlacesAfterwards, 38 TransitionsBefore, 26 TransitionsAfterwards, 836 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 660 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 363, positive: 352, positive conditional: 0, positive unconditional: 352, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 352, positive: 341, positive conditional: 0, positive unconditional: 341, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 352, positive: 319, positive conditional: 0, positive unconditional: 319, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 363, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 352, unknown conditional: 0, unknown unconditional: 352] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 279.5ms, 66 PlacesBefore, 53 PlacesAfterwards, 41 TransitionsBefore, 28 TransitionsAfterwards, 984 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 780 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 735, positive: 723, positive conditional: 0, positive unconditional: 723, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 602, positive: 590, positive conditional: 0, positive unconditional: 590, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 602, positive: 456, positive conditional: 0, positive unconditional: 456, negative: 146, negative conditional: 0, negative unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 146, positive: 134, positive conditional: 0, positive unconditional: 134, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 216, positive: 199, positive conditional: 0, positive unconditional: 199, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 735, positive: 133, positive conditional: 0, positive unconditional: 133, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 602, unknown conditional: 0, unknown unconditional: 602] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 293.9ms, 71 PlacesBefore, 57 PlacesAfterwards, 44 TransitionsBefore, 30 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 910 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 777, positive: 764, positive conditional: 0, positive unconditional: 764, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 668, positive: 655, positive conditional: 0, positive unconditional: 655, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 668, positive: 533, positive conditional: 0, positive unconditional: 533, negative: 135, negative conditional: 0, negative unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 135, positive: 122, positive conditional: 0, positive unconditional: 122, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 209, positive: 192, positive conditional: 0, positive unconditional: 192, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 777, positive: 109, positive conditional: 0, positive unconditional: 109, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 668, unknown conditional: 0, unknown unconditional: 668] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 267.6ms, 76 PlacesBefore, 61 PlacesAfterwards, 47 TransitionsBefore, 32 TransitionsAfterwards, 1316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 15 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 1050 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 867, positive: 853, positive conditional: 0, positive unconditional: 853, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 749, positive: 735, positive conditional: 0, positive unconditional: 735, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 749, positive: 616, positive conditional: 0, positive unconditional: 616, negative: 133, negative conditional: 0, negative unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 133, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 188, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 867, positive: 118, positive conditional: 0, positive unconditional: 118, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 749, unknown conditional: 0, unknown unconditional: 749] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 299.3ms, 81 PlacesBefore, 65 PlacesAfterwards, 50 TransitionsBefore, 34 TransitionsAfterwards, 1500 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 1200 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1017, positive: 1002, positive conditional: 0, positive unconditional: 1002, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 876, positive: 861, positive conditional: 0, positive unconditional: 861, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 876, positive: 705, positive conditional: 0, positive unconditional: 705, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 171, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, positive: 199, positive conditional: 0, positive unconditional: 199, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1017, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 876, unknown conditional: 0, unknown unconditional: 876] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 642.1ms, 86 PlacesBefore, 69 PlacesAfterwards, 53 TransitionsBefore, 36 TransitionsAfterwards, 1696 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 1360 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1239, positive: 1223, positive conditional: 0, positive unconditional: 1223, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1028, positive: 1012, positive conditional: 0, positive unconditional: 1012, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1028, positive: 800, positive conditional: 0, positive unconditional: 800, negative: 228, negative conditional: 0, negative unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 228, positive: 212, positive conditional: 0, positive unconditional: 212, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 544, positive: 522, positive conditional: 0, positive unconditional: 522, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1239, positive: 211, positive conditional: 0, positive unconditional: 211, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1028, unknown conditional: 0, unknown unconditional: 1028] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 69 places, 36 transitions, 392 flow. Already constructed 274086 states. Currently 72728 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. Started 16 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 867082.4ms, OverallIterations: 30, TraceHistogramMax: 1, EmptinessCheckTime: 906.8ms, AutomataDifference: 8053.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 707186.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 150 SDtfs, 150 SDslu, 0 SDs, 0 SdLazy, 135 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 231.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=229374occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 150418.9ms AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 15.1ms SsaConstructionTime, 67.9ms SatisfiabilityAnalysisTime, 125.3ms InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 45 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown